An effective tabu search approach with improved loading algorithms for the 3L-CVRP

Computers and Operations Research

Volumn 55, Issue , 2015, Pages 127-140

  Tao, Yi ^a   Wang, Fan ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

Capacitated vehicle routing; Improved least waste heuristic; Tabu search; Three dimensional loading

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL EFFICIENCY; FLEET OPERATIONS; ITERATIVE METHODS; SOLID WASTES; TABU SEARCH; VEHICLES;

CAPACITATED VEHICLE ROUTING PROBLEM; CAPACITATED VEHICLES; IMPROVED LEAST WASTE HEURISTIC; INNOVATIVE APPROACHES; NUMERICAL EXPERIMENTS; SIMPLE TABU SEARCH; THREE-DIMENSIONAL BIN PACKINGS; THREE-DIMENSIONAL LOADINGS;

LOADING;

EID: 84919342454     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.10.017     Document Type: Article

References (47)

1. C. Archetti, M.G. Speranza, and M.W.P. Savelsbergh An optimization-based heuristic for the split delivery vehicle routing problem Transp Sci 2 2008 22 31
2. Azevedo BLP, Hokama PH, Miyazawa FK, Xavier EC. A branch-and-cut approach for the vehicle routing problem with two-dimensional loading constraints, 2009.
3. B.S. Baker Jr., E.G. Coffman, and R.L. Rivest Orthogonal packing in two dimensions SIAM J Comput 9 1980 846 855
4. E.D. Boef, J. Korst, S. Martello, D. Pisinger, and D. Vigo Erratum to "the three-dimensional bin packing problem" robot-packable and orthogonal variants of packing problems Oper Res 53 4 2005 735 736
5. A. Bortfeldt A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints Comput Oper Res 39 2012 2248 2257
6. M. Boschetti New lower bounds for the three-dimensional finite bin packing problem Discret Appl Math 140 1-3 2004 241 258
7. N. Christofides, and C. Whitlock An algorithm for two-dimensional cutting problems Oper Res 25 1977 30 44
8. G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Oper Res 12 4 1964 568 581
9. J. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and J. Sormany New heuristics for the vehicle routing problem A. Langevin, D. Riopel, Logistics systems 2005 Kluwer Boston
10. J. Cordeau, G. Laporte, M. Savelsbergh, and D. Vigo Vehicle routing C. Barnhart, G. Laporte, Transportation, handbooks in operations research and management science Vol. 14 2007 Elsevier Amsterdam 367 428
11. T.G. Crainic, G. Perboli, and R. Tadei Ts2pack a two-level tabu search for the three-dimensional bin packing problem Eur J Oper Res 195 3 2009 744 760
12. T. Crainic, G. Perboli, and R. Tadei Extreme point-based heuristics for three-dimensional bin packing INFORMS J Comput 20 3 2008 368 384
13. U. Derigs, and K. Reuter A simple and efficient tabu search heuristic for solving the open vehicle routing problem J Oper Res Soc 60 2009 1658 1669 (12 pp)
14. O. Faroe, D. Pisinger, and M. Zachariasen Guided local search for three-dimensional bin-packing problem INFORMS J Comput 15 3 2003 267 283
15. S.P. Fekete, and J. Schepers New classes of fast lower bounds for bin packing problems Math Program 91 1 2001 11 31
16. K. Fleszar, I.H. Osman, and K.S. Hindi A variable neighbourhood search algorithm for the open vehicle routing problem Eur J Oper Res 195 3 2009 803 809
17. G. Fuellerer Vehicle routing with multi-dimensional loading constraints 2009 University of Vienna Vienna, Austria
18. G. Fuellerer, K.F. Doerner, R.F. Hartl, and M. Iori Ant colony optimization for the two-dimensional loading vehicle routing problem Comput Oper Res 36 3 2009 655 673
19. G. Fuellerer, K.F. Doerner, R.F. Hartl, and M. Iori Metaheuristics for vehicle routing problems with three-dimensional loading constraints Eur J Oper Res 201 2009 751 759
20. G. Fuellerer, K. Doerner, R. Hartl, and M. Iori Metaheuristics for vehicle routing problems with loading constraints Networks 49 4 2007 294 307
21. M. Gendreau, A. Hertz, and G. Laporte New insertion and post-optimization procedures for the traveling salesman problem Oper Res 40 1992 1086 1094
22. M. Gendreau, M. Iori, G. Laporte, and S. Martello A tabu search algorithm for a routing and container loading problem Transp Sci 40 3 2006 342 350
23. M. Gendreau, M. Iori, G. Laporte, and S. Martello A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints Networks 51 1 2008 4 18
24. B.L. Golden, S. Raghavan, and E.A. Wasil The vehicle routing problem latest advances and new challenges 2008 Springer
25. J.F. Goncalves, and MGC. Resende A biased random key genetic algorithm for 2D and 3D bin packing problems Int J Prod Econ 145 2 2013 500 510
26. Iori M. Metaheuristic algorithms for combinatorial optimization problems [Doctoral dissertation]. Bologna, Italy: University of Bologna; 2004.
27. M. Iori Metaheuristic algorithms for combinatorial optimization problems 4OR 3 2005 163 166
28. M. Iori, J.J.S. Gonzalez, and D. Vigo An exact approach for the vehicle routing problem with two-dimensional loading constraints Transp Sci 41 2 2007 253 264
29. Iori M, Martello S. Routing problems with loading constraints. In: TOP, 2010. p. 4-27.
30. A. Lodi, S. Martello, and D. Vigo Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems INFORMS J Comput 11 1999 345 357
31. A. Lodi, S. Martello, and D. Vigo Heuristic algorithms for the three-dimensional bin packing problem Eur J Oper Res 141 2002 410 420
32. S. Martello, D. Pisinger, and D. Vigo The three-dimensional bin packing problem Oper Res 48 2 2000 256 267
33. S. Martello, D. Pisinger, D. Vigo, E.D. Boef, and J. Korst Algorithm 864 general and robot-packable variants of the three-dimensional bin packing problem ACM Trans Math Softw 33 1 2007
34. A. Moura A multi-objective genetic algorithm for the vehicle routing with time windows and loading problem Intell Decis Support 2 2008 187 201
35. A. Moura, and J.F. Oliveira An integrated approach to the vehicle routing and container loading problems OR Spectr 31 4 2009 775 800
36. F. Parreno, R. Alvarez-Valdes, J.F. Oliveira, and J.M. Tamarit A hybrid grasp/vnd algorithm for two- and three-dimensional bin packing Ann Oper Res 179 2010 203 220
37. D. Pisinger Heuristics for the container loading problem Eur J Oper Res 141 2002 382 392
38. Q. Ruan, Z. Zhang, L. Miao, and H. Shen A hybrid approach for the vehicle routing problem with three-dimensional loading constraints Comput Oper Res 40 6 2013 1579 1589
39. Seiden, and V. Stee New bounds for multidimensional packing Algorithmica 36 3 2007 261 293
40. Tao Y, Wang F. A new packing heuristic based algorithm for vehicle routing problem with three-dimensional loading constraints. In: 2010 IEEE international conference on automation science and engineering (CASE 2010), 2010. p. 972-77.
41. C.D. Tarantilis, E.E. Zachariadis, and C.T. Kiranoudis A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem IEEE Trans Intell Transp Syst 10 2 2009 255 271
42. Toth P, Vigo D. The vehicle routing problem, SIAM monographs on discrete mathematics and applications, Philadelphia, 2002.
43. F. Tricoire, K.F. Doerner, R.F. Hartl, and M. Iori Heuristic and exact algorithms for the multi-pile vehicle routing problem OR Spectr 33 4 2011 931 959
44. Wang F, Tao Y, Shi N. A survey on vehicle routing problem with loading constraints. In: 2009 International joint conference on computational sciences and optimization (CSO 2009), 2009. p. 602-06.
45. L. Wei, D. Zhang, and Q. Chen A least wasted first heuristic algorithm for the rectangular packing problem Comput Oper Res 36 5 2009 1608 1614
46. E.E. Zachariadis, C.D. Tarantilis, and C.T. Kiranoudis A guided tabu search for the vehicle routing problem with two-dimensional loading constraints Eur J Oper Res 195 3 2009 729 743
47. W. Zhu, H. Qin, A. Lim, and L. Wang A two-stage tabu search algorithm with enhanced packing heuristics for the 3l-cvrp and m3l-cvrp Comput Oper Res 39 2012 2178 2195