A scatter search algorithm for solving vehicle routing problem with loading cost

Expert Systems with Applications

Volumn 37, Issue 6, 2010, Pages 4073-4083

  Tang, Jiafu ^a   Zhang, Jun ^a   Pan, Zhendong ^a  

^a KEY LABORATORY OF INTEGRATED AUTOMATION OF PROCESS INDUSTRY   (China)

Author keywords

Loading cost; Meta heuristic algorithm; Scatter search; Vehicle routing problem

Indexed keywords

BENCH-MARK PROBLEMS; COMBINATION METHOD; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL RESULTS; COST SAVING; DISTRIBUTION MANAGEMENT; ENCODING METHODS; IMPROVEMENT METHODS; META HEURISTIC ALGORITHM; NEAREST NEIGHBORS; NEW SOLUTIONS; OBJECTIVE FUNCTIONS; OPTIMAL ROUTES; OTHER ALGORITHMS; REAL-WORLD; SCATTER SEARCH; SCATTER SEARCH ALGORITHM; SWEEP ALGORITHMS; VEHICLE LOAD; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

COSTS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; LEARNING ALGORITHMS; LOADING; OPTIMIZATION; ROUTING ALGORITHMS; THREE DIMENSIONAL;

VEHICLES;

EID: 77249145808     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.11.027     Document Type: Article

References (47)

1. Alegre J., Laguna M., and Pacheco J. Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. European Journal of Operational Research 179 3 (2007) 736-746
2. Belenguer J.M., Martinez M.C., and Mota E. Lower bound for the split delivery vehicle routing problem. Operations Research 48 5 (2000) 801-810
3. Bent R., and Van Hentenryck P. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38 4 (2004) 515-530
4. Bookbinder J.H., and Reece K.E. Vehicle routing considerations in distribution system design. European Journal of Operational Research 37 2 (1988) 204-213
5. Brandão J. A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research 195 3 (2009) 716-728
6. Chu C.W. A heuristic algorithm for the truckload and less-than-truckload problem. European Journal of Operational Research 165 3 (2005) 657-667
7. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 4 (1964) 568-581
8. Corberán A., Fernández E., Laguna M., and Marti R. Heuristic solutions to the problem of routing school buses with multiple objectives. Journal of the Operational Research Society 53 4 (2002) 427-435
9. Cordeau J.F., Laporte G., Savelsbergh M.W.P., and Vigo D. Vehicle routing. In: Barnhart C., and Laporte G. (Eds). Transportation, handbooks in operations research and management science (2007), Elsevier, Amsterdam 367-428
10. Cordeau J.F., Gendreau M., Hertz A., Laporte G., and Sormany J.-S. New heuristics for the vehicle routing problem. In: Langevin A., and Riopel D. (Eds). Logistics systems: Design and optimization (2005), Springer, New York 279-297
11. Dantzig G.B., and Ramser J.H. The truck dispatching problem. Management Science 6 1 (1959) 80-91
12. Doerner K.F., Hartl R.F., Benkner S., and Lucka M. Parallel cooperative Savings based Ant colony optimization - Multiple search and decomposition approaches. Parallel Processing Letters 16 (2006) 351-369
13. Dumas Y., Desrosiers J., and Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research 54 1 (1991) 7-22
14. Francis P., and Smilowitz K. Modeling techniques for periodic vehicle routing problems. Transportation Research Part B: Methodological 40 10 (2006) 872-884
15. Fukasawa R., Lysgaard J., De Aragao M.P., Reis M., Uchoa E., and Werneck R.F. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 106 3 (2006) 491-511
16. Gavish, B., & Graves, S. C. (1978). The traveling salesman problem and related problems.
17. Gendreau M., Hertz A., Laporte G., and Stan M. A generalized insertion heuristic for the traveling salesman problem with time windows. Operations Research 46 3 (1998) 330-346
18. Gendreau M., Laporte G., and Potvin J.Y. Metaheuristics for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2002), SIAM Monograph on Discrete Mathematics and Applications, Philadelphia 129-154
19. Gillett B.E., and Miller L.R. A heuristic algorithm for the vehicle dispatch problem. Operations Research 22 2 (1974) 340-349
20. Glover F. Heuristics for integer programming using surrogate constraints. Decision Sciences 8 1 (1977) 156-166
21. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13 5 (1986) 533-549
22. Glover F., Laguna M., and Marti R. Fundamentals of scatter search and path relinking. Control and Cybernetics 29 3 (2000) 652-684
23. Glover F., Laguna M., and Marti R. Scatter search. In: Ashish G., and Shigeyoshi T. (Eds). Advances in evolutionary computing: Theory and applications (2003), Springer-Verlag, New York 519-537
24. Goel A., and Gruhn V. A general vehicle routing problem. European Journal of Operational Research 191 3 (2008) 650-660
25. Gouveia L. A result on projection for the vehicle routing problem. European Journal of Operational Research 85 3 (1995) 610-624
26. Kirkpatrick S., and Gelatt C. Optimisation by simulated annealing. Science 20 (1983) 671-680
27. Kytöjoki J., Nuortio T., Bräysy O., and Gendreau M. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers and Operations Research 34 9 (2007) 2743-2757
28. Laporte G. What you should know about the vehicle routing problem. Naval Research Logistics 54 8 (2007) 811-819
29. Laporte G., Gendreau M., Potvin J.Y., and Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7 4-5 (2000) 285-300
30. Laporte G., and Nobert Y. A branch and bound algorithm for the capacitated vehicle routing problem. OR Spektrum 5 2 (1983) 77-85
31. Laporte G., and Semet F. Classical heuristics for the capacitated VRP. In: Toth P., and Vigo D. (Eds). The vehicle routing problem (2002), SIAM Monograph on Discrete Mathematics and Applications, Philadelphia 109-128
32. Lim A., and Wang F. Multi-depot vehicle routing problem: A one-stage approach. IEEE Transactions on Automation Science and Engineering 2 4 (2005) 397-402
33. Lu Q., and Dessouky M. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science 38 4 (2004) 503-514
34. Marti R., Laguna M., and Glover F. Principles of scatter search. European Journal of Operational Research 169 2 (2006) 359-372
35. Mingozzi A., Giorgi S., and Baldacci R. Exact method for the vehicle routing problem with backhauls. Transportation Science 33 3 (1999) 315-329
36. Mitchell M. An introduction to genetic algorithms (1996), Bradford Books
37. Mota E., Campos V., and Corberán A. A new metaheuristic for the vehicle routing problem with split demands. In: Cotta C., and van Hemert J. (Eds). Lecture Notes in Computer Science (2007), Springer Valencia 121-129
38. Pisinger D., and Ropke S. A general heuristic for vehicle routing problems. Computers and Operations Research 34 8 (2007) 2403-2435
39. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31 12 (2004) 1985-2002
40. Rochat Y., and Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1 1 (1995) 147-167
41. Russell R.A., and Chiang W.C. Scatter search for the vehicle routing problem with time windows. European Journal of Operational Research 169 2 (2006) 606-622
42. Smith K.A. Neural networks for combinatorial optimization: A review of more than a decade of research. INFORMS Journal on Computing 11 (1999) 15-34
43. Stützle T., and Hoos H.H. MAX-MIN ant system. Future Generation Computer System 16 8 (2000) 889-914
44. Tan K.C., Lee L.H., Zhu Q.L., and Ou K. Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering 15 3 (2001) 281-295
45. Tavakkoli M.R., Safaei N., Kah M.M.O., and Rabbani M. A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing. Journal of the Franklin Institute 344 5 (2007) 406-425
46. Waters C.D.J. A solution procedure for the vehicle scheduling problem based on iterative route improvement. Journal of the Operational Research Society 38 9 (1987) 833-839
47. Yi W., and Ozdamar L. A dynamic logistics coordination model for evacuation and support in disaster response activities. European Journal of Operational Research 179 3 (2007) 1177-1193