Simulated annealing for the vehicle routing problem with two-dimensional loading constraints

Flexible Services and Manufacturing Journal

Volumn 22, Issue 1-2, 2010, Pages 61-82

  Leung, Stephen C H ^a   Zheng, Jiemin ^b   Zhang, Defu ^b   Zhou, Xiyue ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b XIAMEN UNIVERSITY   (China)

Author keywords

Loading constraints; Simulated annealing; Vehicle routing

Indexed keywords

CAPACITATED VEHICLE ROUTING PROBLEM; COMPUTATIONAL RESULTS; CUSTOMER DEMANDS; DISTRIBUTION LOGISTICS; EFFICIENT DATA STRUCTURES; LOADING CONSTRAINTS; LOADING SURFACE; SIMULATED ANNEALING ALGORITHMS; TRANSPORTATION COST; VEHICLE ROUTING PROBLEMS;

DATA STRUCTURES; LOADING; PROBLEM SOLVING; ROUTING ALGORITHMS; SUPPLY CHAINS; TWO DIMENSIONAL; VEHICLES;

SIMULATED ANNEALING;

EID: 79952625155     PISSN: 19366582     EISSN: 19366590     Source Type: Journal    
DOI: 10.1007/s10696-010-9061-4     Document Type: Article

References (43)

1. R Baldacci N Christofides A Mingozzi 2008 An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts Math Program 115 351 385 2411402 10.1007/s10107-007-0178-5 05351844
2. L Bodin B Golden A Assad M Ball 1983 The state of the art in the routing and scheduling of vehicles and crews Comput Oper Res 10 63 212 758162 10.1016/0305-0548(83)90030-8 (Pubitemid 13577352)
3. MA Boschetti A Mingozzi 2003 The two-dimensional finite bin packing problem. Part I: new lower bounds for the oriented case 4OR Q J Oper Res 1 27 42 2027776 1062.90051
4. MA Boschetti A Mingozzi 2003 The two-dimensional finite bin packing problem. Part II: New lower and upper bounds 4OR Q J Oper Res 1 135 147 2029064 1097.90033
5. AV Breedam 1995 Improvement heuristics for the vehicle routing problem based on simulated annealing Eur J Oper Res 86 480 490 10.1016/0377-2217(94) 00064-J 0914.90107
6. V Cerny 1985 Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm J Optim Theory Appl 45 41 51 778156 10.1007/BF00940812 0534.90091 (Pubitemid 15462741)
7. B Chazelle 1983 The bottom-left bin packing heuristic: an efficient implementation IEEE Trans Comput C-32 697 707 10.1109/TC.1983.1676307 (Pubitemid 14472726)
8. WC Chiang RA Russell 1996 Simulated annealing metaheuristics for the vehicle routing problem with time windows Ann Oper Res 63 3 27 10.1007/BF02601637 0849.90054 (Pubitemid 126729233)
9. JF Cordeau M Gendreau G Laporte JY Potvin F Semet 2002 A guide to vehicle routing heuristics J Oper Res Soc 53 512 522 10.1057/palgrave.jors.2601319 1099.90506 (Pubitemid 34550664)
10. Cordeau JF, Gendreau M, Hertz A, Laporte G, Sormany JS (2005) New heuristics for the vehicle routing problem. In: Langevin A, Riopel D (eds) Logistics systems: design and optimization. New York, Springer, pp 279-297
11. G Croes 1958 A method for solving traveling salesman problems Oper Res 6 791 812 99887 10.1287/opre.6.6.791
12. GB Dantzig JH Ramser 1959 The truck dispatching problem Manage Sci 6 80 91 115817 10.1287/mnsc.6.1.80 0995.90560
13. Ferenc B (2004) Surprising results of trie-based FIM algorithms. In: Bart G, Mohammed JZ, Roberto B (ed) Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations (FIMI'04), vol. 126 of CEUR workshop proceedings, Brighton, UK
14. Fisher ML (1995) Handbooks in operations research and management science. In: Ball MO, Magnanti TL, Momma CL, Nemhauser GL (eds) Network routing, vol 8. Amsterdam, North-Holland, pp 1-33
15. G Fuellerer KF Doerner RF Hartl M Iori 2009 Ant colony optimization for the two-dimensional loading vehicle routing problem Comput Oper Res 36 655 673 10.1016/j.cor.2007.10.021 1157.90335
16. R Fukasawa H Longo J Lysgaard PA Marcus M Reis E Uchoa RF Werneck 2006 Robust branch-and-cut-and-price for the capacitated vehicle routing problem Math Program 106 491 511 2216792 10.1007/s10107-005-0644-x 1094.90050
17. Gendreau M, Laporte G, Potvin JY (1997) Vehicle routing: modern heuristics. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chichester, pp 311-336
18. Gendreau M, Laporte G, Potvin JY (2002) Metaheuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem. Monographs on discrete mathematics and applications. SIAM, Philadelphia, pp 129-154
19. M Gendreau M Iori G Laporte S Martello 2008 A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints Networks 51 4 18 2375146 10.1002/net.20192 1146.90012
20. Iori M (2004) Metaheuristic algorithms for combinatorial optimization problems. PhD thesis, DEIS, University of Bologna
21. M Iori 2005 Metaheuristic algorithms for combinatorial optimization problems 4OR Q J Oper Res 3 163 166 10.1007/s10288-005-0052-3 1134.90300 (Pubitemid 41603229)
22. M Iori JJ Salazar Gonzalez D Vigo 2007 An exact approach for the vehicle routing problem with two dimensional loading constraints Transp Sci 41 253 264 10.1287/trsc.1060.0165
23. S Kirkpatrick CD Gelatt MP Vecchi 1983 Optimization by simulated annealing Science 220 671 680 702485 10.1126/science.220.4598.671
24. G Laporte 2009 Fifty years of vehicle routing Transp Sci 43 408 416 2502322 10.1287/trsc.1090.0301
25. Laporte G, Semet F (2002) Classical heuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem. Monographs on discrete mathematics and applications. SIAM, Philadelphia, pp 109-128
26. G Laporte M Gendreau JY Potvin F Semet 2000 Classical and modern heuristics for the vehicle routing problem Int Tran Oper Res 7 285 300 1775478 10.1111/j.1475-3995.2000.tb00200.x
27. XY Li P Tian SCH Leung 2009 An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems J Oper Res Soc 60 7 1012 1025 10.1057/palgrave.jors.2602644 1168.90657
28. S Lin 1965 Computer solutions of the traveling salesman problem Bell Syst Tech J 44 2245 2269 0136.14705
29. SW Lin VF Yu SY Chou 2009 Solving the truck and trailer routing problem based on a simulated annealing heuristic Comput Oper Res 36 1683 1692 10.1016/j.cor.2008.04.005 1177.90079
30. A Lodi S Martello D Vigo 1999 Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems INFORMS J Comput 11 345 357 1758622 10.1287/ijoc.11.4.345 1034.90500
31. S Martello D Vigo 1998 Exact solution of the two-dimensional finite bin packing problem Manage Sci 44 388 399 10.1287/mnsc.44.3.388 0989.90114 (Pubitemid 128568186)
32. D Mester O Bräysy 2007 Active-guided evolution strategies for large scale capacitated vehicle routing problems Comput Oper Res 34 10 2964 2975 10.1016/j.cor.2005.11.006 1185.90176 (Pubitemid 46356733)
33. RT Moghaddam N Safaei Y Gholipour 2006 A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length Appl Math Comput 176 445 454 2232038 10.1016/j.amc.2005.09.040 1149.90312 (Pubitemid 43674375)
34. IH Osman 1993 Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem Ann Oper Res 41 421 451 10.1007/BF02023004 0775.90153
35. D Pisinger M Sigurd 2007 Using decomposition techniques and constraint programming for solving the two-dimensional bin packing problem INFORMS J Comput 19 36 51 2300583 10.1287/ijoc.1060.0181
36. C Prins 2004 A simple and effective evolutionary algorithm for the vehicle routing problem Comput Oper Res 31 12 1985 2002 2082636 10.1016/S0305-0548(03)00158-8 1100.90504 (Pubitemid 38728564)
37. CD Tarantilis 2005 Solving the vehicle routing problem with adaptive memory programming methodology Comput Oper Res 32 9 2309 2327 2124714 10.1016/j.cor.2004.03.005 1116.90119 (Pubitemid 40114318)
38. CD Tarantilis CT Kiranoudis 2002 Bone route: an effective memory-based method for effective fleet management Ann Oper Res 115 227 241 1958802 10.1023/A:1021157406318 1013.90020 (Pubitemid 37132216)
39. Toth P, Vigo D (2002a) The vehicle routing problem. Monographs on discrete mathematics and applications. SIAM, Philadelphia
40. Toth P, Vigo D (2002b) Branch-and-bound algorithms for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM, Philadelphia, pp 29-52
41. CDJ Waters 1987 A solution procedure for the vehicle scheduling problem based on iterative route improvement J Oper Res Soc 38 833 839 0628.90037
42. L Wei D Zhang Q Chen 2009 A least wasted first heuristic algorithm for rectangular packing problem Comput Oper Res 36 5 1608 1614 2586328 10.1016/j.cor.2008.03.004 1179.90174
43. EE Zachariadis CD Tarantilis CT Kiranoudis 2009 A guided tabu search for the vehicle routing problem with two-dimensional loading constraints Eur J Oper Res 195 729 743 10.1016/j.ejor.2007.05.058 1155.90331