The split delivery vehicle routing problem with three-dimensional loading constraints

 The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints (3L-SDVRP) combines vehicle routing and three-dimensional loading with additional packing constraints. In the 3L-SDVRP splitting deliveries of customers is basically possible, i.e. a customer can be visited in two or more tours. We examine essential problem features and introduce two problem variants. In the first variant, called 3L-SDVRP with forced splitting, a delivery is only split if the demand of a customer cannot be transported by a single vehicle. In the second variant, termed 3L-SDVRP with optional splitting, splitting customer deliveries can be done any number of times. We propose a hybrid algorithm consisting of a local search algorithm for routing and a genetic algorithm and several construction heuristics for packing. Numerical experiments are conducted using three sets of instances with both industrial and academic origins. One of them was provided by an automotive logistics company in Shanghai; in this case some customers per instance have a total freight volume larger than the loading space of a vehicle. The results prove that splitting deliveries can be beneficial not only in the one-dimensional case but also when goods are modeled as three-dimensional items

A Branch-and-cut Approach For The Vehicle Routing Problem With Loading Constraints

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)In this paper we describe a branch-and-cut algorithm for the vehicle routing problem with unloading constraints. The problem is to determine a set of routes with minimum total cost, each route leaving a depot, such that all clients are visited exactly once. Each client has a demand, given by a set of items, that are initially stored in a depot. We consider the versions of the problem with two and tri dimensional parallelepiped items. For each route in a solution, we also need to construct a feasible packing for all the items of the clients in this route. As it would be too expensive to rearrange the vehicle cargo when removing the items of a client, it is important to perform this task without moving the other client items. Such packings are said to satisfy unloading constraints. In this paper we describe a branch-and-cut algorithm that uses several techniques to prune the branch-and-cut enumeration tree. The presented algorithm uses several packing routines with different algorithmic approaches, such as branch-and-bound, constraint programming and metaheuristics. The careful combination of these routines showed that the presented algorithm is competitive, and could obtain optimum solutions within significantly smaller computational times for most of the instances presented in the literature. © Elsevier Ltd.471132011/13382-3, FAPESP, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior306358/2014-0, CAPES, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior306358/2014-0, CNPq, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior311499/2014-7, CAPES, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior311499/2014-7, CNPq, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior477692/2012-5, CAPES, Coordenação de Aperfeiçoamento de Pessoal de Nível Superior477692/2012-5, CNPq, Coordenação de Aperfeiçoamento de Pessoal de Nível SuperiorFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Azevedo, B.L.P., Hokama, P., Miyazawa, F.K., Xavier, E.C., A branch-and-cut approach for the vehicle routing problem with two-dimensional loading constraints (2009) Proceedings of the XLI simpφ'Sio Brasileiro de Pesquisa Operacional, p. 12pgs. , Porto Seguro, BA, BrazilBaker, B., Coffman, E., Rivest, R., Orthogonal packings in two dimensions (1980) SIAM Journal on Computing, 9 (4), pp. 846-855Bischoff, E.E., Ratcliff, M.S.W., Issues in the development of approaches to container loading (1995) Omega, 23 (4), pp. 377-390Clautiaux, F., Jouglet, A., Carlier, J., Moukrim, A., A new constraint programming approach for the orthogonal packing problem (2008) Computers and Operations Research, 35 (3), pp. 944-959Côté, J.-F., Gendreau, M., Potvin, J.-Y., An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints (2014) Operations Research, 62 (5), pp. 1126-1141Dominguez, O., Juan, A., Barrios, B., Faulin, J., Agustin, A., Using biased randomization for solving the two-dimensional loading vehiclerouting problem with heterogeneous fleet (2014) Annals of Operations Research, pp. 1-22Duhamel, C., Lacomme, P., Quilliot, A., Toussaint, H., A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem (2011) Computers and Operations Research, 38 (3), pp. 617-640. , http://dx.doi.org/10.1016/j.cor.2010.08.017Fuellerer, G., Doernera, K., Hartla, R., Iori, M., Ant colony optimization for the two-dimensional loading vehicle routing problem (2009) Computers and Operations Research, 36 (3), pp. 655-673Gendreau, M., Iori, M., Laporte, G., Martello, S., A tabu search algorithm for a routing and container loading problem (2006) Transportation Science, 40 (3), pp. 342-350Gendreau, M., Iori, M., Laporte, G., Martello, S., A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints (2008) Networks, 51 (1), pp. 4-18Gonçalves, J., Resende, M.C., Biased random-key genetic algorithms for combinatorial optimization (2011) Journal of Heuristics, 17 (5), pp. 487-525Gonçalves, J., Resende, M.C., A biased random key genetic algorithm for 2d and 3d bin packing problems (2013) International Journal of Production Economics, 145 (2), pp. 500-510. , http://dx.doi.org/10.1016/j.ijpe.2013.04.019Herz, J.C., Recursive computational procedure for two-dimensional stock cutting (1972) IBM Journal of Research and Development, 16 (5), pp. 462-469Hooker, J.N., (2011) Integrated Methods for Optimization (International Series in Operations Research & Management Science, Vol. 170), , SpringerIori, M., Martello, S., An annotated bibliography of combined routing and loading problems (2013) Yugoslav Journal of Operations Research, 23 (3)Iori, M., Salazar-González, J., Vigo, D., An exact approach for the vehicle routing problem with two-dimensional loading constrains (2007) Transportation Science, 41 (2), pp. 253-264Junqueira, L., Oliveira, J.F., Carravilla, M.A., Morabito, R., An optimization model for the vehicle routing problem with practical three-dimensional loading constraints (2013) International Transactions in Operational Research, 20 (5), pp. 645-666Li, J., Pardalos, P.M., Sun, H., Pei, J., Zhang, Y., Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups (2015) Expert Systems with Applications, 42 (7), pp. 3551-3561Lysgaard, J., Lechtford, A., Eglese, R., A new branch-and-cut algorithm for the capacitated vehicle routing problem (2003) Mathematical Programming, 100 (2), pp. 423-445Martello, S., Pisinger, D., Vigo, D., The three-dimensional bin packing problem (2000) Operations Research, 48 (2), pp. 256-267Martello, S., Pisinger, D., Vigo, D., Boef, E.D., Korst, J., Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem (2007) ACM Trans. Math. Softw, 33Mesyagutov, M., Scheithauer, G., Belov, G., {LP} bounds in various constraint programming approaches for orthogonal packing (2012) Computers and Operations Research, 39 (10), pp. 2425-2438Mesyagutov, M., Scheithauer, G., Belov, G., New constraint programming approaches for 3D orthogonal packing (2012) Technical Report MATH-NM-01-2012, , Technische Universität Dresden Dresden, GermanyMorais, V.W.C., Mateus, G.R., Noronha, T.F., Iterated local search heuristics for the vehicle routing problem with cross-docking (2014) Expert Systems with Applications, 41 (16), pp. 7495-7506Naddef, D., Rinaldi, G., Branch-and-cut algorithms for the capacitated vrp. toth p. vigo d., eds. the vehicle routing problem (2002) SIAM Monographs on Discrete Mathematics and Applications, 9, pp. 53-84universitá di bologna, http://www.or.deis.unibo.it/, Accessed: 11.07.14Reinelt, G., TSPLIB - A traveling salesman problem library (1990) Report, , Inst. für MathematikRossi, F., Beek, P.V., Walsh, T., (2006) Handbook of Constraint Programming (Foundations of Artificial Intelligence), , Elsevier Science Inc. New York, NY, USASilveira, J.L.M.D., Miyazawa, F.K., Xavier, E.C., Heuristics for the strip packing problem with unloading constraints (2013) Computers & or, 40 (4), pp. 991-1003Silveira, J.L.M.D., Miyazawa, F.K., Xavier, E.C., Two-dimensional strip packing with unloading constraints (2014) Discrete Applied Mathematics, 164, pp. 512-521Silveira, J.L.M.D., Xavier, E.C., Pickup and delivery problem with two dimensional loading/unloading constraints (2014) Proceedings of the 5th International Conference in Computational Logistics, ICCL 2014, 8760, pp. 31-46. , Lecture Notes in Computer ScienceSilveira, J.L.M.D., Xavier, E.C., Miyazawa, F.K., A note on a two dimensional knapsack problem with unloading constraints (2013) RAIRO - Theoretical Informatics and Applications, 47 (4), pp. 315-324Toso, R.F., Resende, M.G.C., BrkgaAPI: A C++ Application Programming Interface for Biased Random-key Genetic Algorithms, , http://www2.research.att.com/~mgcr/src/brkgaAPI/, (b) Accessed: 2014-07-11Wei, L., Zhang, Z., Lim, A., An adaptive variable neighborhood search for a heterogeneous fleet vehicle routing problem with three-dimensional loading constraints (2014) Computational Intelligence Magazine, IEEE, 9 (4), pp. 18-30Wolsey, L.A., (1998) Integer Programming, , Wiley-Interscience New York, NY, USAZachariadis, E., Tarantilis, C., Kiranoudis, C., A guided tabu search for the vehicle routing problem with two-dimensional loading constraints (2009) European Journal of Operational Research, 195 (3), pp. 729-74