An optimization model for the vehicle routing problem with practical three-dimensional loading constraints

International Transactions in Operational Research

Volumn 20, Issue 5, 2013, Pages 645-666

  Junqueira, Leonardo ^a   Oliveira, José F ^b   Carravilla, Maria Antónia ^b   Morabito, Reinaldo ^a  

^a FEDERAL UNIVERSITY OF SÃO CARLOS   (Brazil)

^b UNIVERSITY OF PORTO   (Portugal)

Author keywords

Capacitated vehicle routing problem; Mathematical modeling; Three dimensional loading

Indexed keywords

APPROXIMATE SOLUTION; CAPACITATED VEHICLE ROUTING PROBLEM; DECOMPOSITION METHODS; INTEGER LINEAR PROGRAMMING MODELS; OPTIMIZATION MODELS; OPTIMIZATION SOLVERS; THREE-DIMENSIONAL LOADINGS; VEHICLE ROUTING PROBLEMS;

INTEGER PROGRAMMING; MATHEMATICAL MODELS; NETWORK ROUTING; PROBLEM SOLVING; ROUTING ALGORITHMS;

THREE DIMENSIONAL;

EID: 84880998647     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2012.00872.x     Document Type: Article

References (36)

1. Beasley, J., 1985. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33, 1, 49-64.
2. Bischoff, E.E., 2006. Three-dimensional packing of items with limited load bearing strength. European Journal of Operational Research 3, 168, 952-966.
3. Bischoff, E.E., Ratcliff, M.S.W., 1995. Issues in the development of approaches to container loading. Omega 23, 4, 377-390.
4. Bortfeldt, A., 2012. A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Computers & Operations Research 39, 9, 2248-2257.
5. Bortfeldt, A., Gehring, H., 2001. A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research 131, 1, 143-161.
6. Bortfeldt, A., Wäscher, G., 2012. Container loading problems-a state-of-the-art review. Working Paper No. 07/2012, Faculty of Economics and Management, Otto-von-Guericke University Magdeburg.
7. Christensen, S.G., Rousøe, D.M., 2009. Container loading with multi-drop constraints. International Transactions in Operational Research 16, 6, 727-743.
8. Christofides, N., Whitlock, C., 1977. An algorithm for two-dimensional cutting problems. Operations Research 25, 1, 30-44.
9. Duhamel, C., Lacomme, P., Quilliot, A., Toussaint, H., 2011. A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Computers & Operations Research 38, 3, 617-640.
10. Eley, M., 2002. Solving container loading problems by block arrangement. European Journal of Operational Research 141, 2, 393-409.
11. Fox, K.R., Gavish, B., Graves, S.C., 1980. An n-constraint formulation of the (time-dependent) traveling salesman problem. Operations Research 28, 4, 1018-1021.
12. Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M., 2009. Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research 36, 3, 655-673.
13. Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M., 2010. Metaheuristics for vehicle routing problems with three-dimensional loading constraints. European Journal of Operational Research 201, 3, 751-759.
14. Gendreau, M., Iori, M., Laporte, G., Martello, S., 2006. A Tabu search algorithm for a routing and container loading problem. Transportation Science 40, 3, 342-350.
15. Gendreau, M., Iori, M., Laporte, G., Martello, S., 2008. A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51, 2, 4-18.
16. Golden, B., Raghavan, S., Wasil, E. (eds), 2008. The Vehicle Routing Problem: Latest Advances and New Challenges, volume 43 of Operations Research/Computer Science Interfaces. Springer, Boston, MA.
17. Gouveia, L., Voss, S., 1995. A classification of formulations for the (time-dependent) traveling salesman problem. European Journal of Operational Research 83, 1, 69-82.
18. Iori, M., Martello, S., 2010. Routing problems with loading constraints. Top 18, 1, 4-27.
19. Iori, M., Salazar-Gonzalez, J.-J., Vigo, D., 2007. An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science 41, 2, 253-264.
20. Junqueira, L., Morabito, R., Yamashita, D.S., 2012a. Three-dimensional container loading models with cargo stability and load bearing constraints. Computers & Operations Research 39, 1, 74-85.
21. Junqueira, L., Morabito, R., Yamashita, D.S., 2012b. MIP-based approaches for the container loading problem with multi-drop constraints. Annals of Operations Research 199, 1, 51-75.
22. Lai, K.K., Xue, J., Xu, B., 1998. Container packing in a multi-customer delivering operation. Computers & Industrial Engineering 35, 1-2, 323-326.
23. Leung, S.C., Zhou, X., Zhang, D., Zheng, J., 2011. Extended guided Tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Computers & Operations Research 38, 1, 205-215.
24. Mendéz-Diaz, I., Zabala, P., Lucena, A., 2008. A new formulation for the traveling delivery man problem. Discrete Applied Mathematics 156, 17, 3223-3237.
25. Morabito, R., Arenales, M.N., 1994. An AND/OR-graph approach to the container loading problem. International Transactions in Operational Research 1, 1, 59-73.
26. Moura, A., Oliveira, J.F., 2005. A GRASP approach to the container-loading problem. IEEE Intelligent Systems 20, 4, 50-57.
27. Moura, A., Oliveira, J.F., 2009. An integrated approach to the vehicle routing and container loading problems. OR Spectrum 31, 4, 775-800.
28. Öncan, T., Altinel, I.K., Laporte, G., 2009. A comparative analysis of several asymmetric traveling salesman problem formulations. Computers & Operations Research 36, 3, 637-654.
29. Pisinger, D., 2002. Heuristics for the container loading problem. European Journal of Operational Research 141, 2, 382-392.
30. Ratcliff, M.S.W., Bischoff, E.E., 1998. Allowing for weight considerations in container loading. OR Spektrum 20, 1, 65-71.
31. Silva, J.L.d.C., Soma, N.Y., Maculan, N., 2003. A greedy search for the three-dimensional bin packing problem: the packing static stability case. International Transactions in Operational Research 10, 2, 141-153.
32. Tarantilis, C.D., Zachariadis, E.E., Kiranoudis, C.T., 2009. A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Transactions on Intelligent Transportation Systems 10, 2, 255-271.
33. Toth, P., Vigo, D., 2002. The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA.
34. Wäscher, G., Haußner, H., Schumann, H., 2007. An improved typology of cutting and packing problems. European Journal of Operational Research 183, 1109-1130.
35. Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T., 2009. A guided Tabu search for the vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research 195, 3, 729-743.
36. Zhu, W., Qin, H., Lim, A., Wang, L., 2012. A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-7CVRP. Computers & Operations Research 39, 9, 2178-2195.