A GRASP × evolutionary local search hybrid for the vehicle routing problem

Studies in Computational Intelligence

Volumn 161, Issue , 2009, Pages 35-53

  Prins, Christian ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 51849120602     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-85152-3_2     Document Type: Article

References (27)

1. Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart Jr., W.R.: Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1, 9-32 (1995)
2. Beasley, J.E.: Route-first cluster-second methods for vehicle routing. Omega 11, 403-408 (1983)
3. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315-338. Wiley, Chichester (1979)
4. Clarke, G.,Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568-581 (1964)
5. Cordeau, J.F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.S.: New heuristics for the vehicle routing problem. In: Langevin, A., Riopel, D. (eds.) Logistic Systems: Design and Optimization, pp. 279-298. Wiley, Chichester (2005)
6. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
7. Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee (2006)
8. Ergun, O., Orlin, J.B., Steele-Feldman, A.: Creating very large scale neighborhoods out of smaller ones by compounding moves: A study on the vehicle routing problem. Technical report, Massachusetts Institute of Technology (2003)
9. Feo, T.A., Bard, J.: Flight scheduling and maintenance base planning. Management Science 35, 1415-1432 (1989)
10. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109-133 (1995)
11. Fukasawa, R., Lysgaard, J., Poggi de Aragão, M., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 106, 491-511 (2006)
12. Glover, F., Laguna, M.: Tabu search. Kluwer, Dordrecht (1997)
13. Golden, B.L., Wasil, E.A., Kelly, J.P., Chao, I.M.: The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets and computational results. In: Crainic, T.G., Laporte, G. (eds.) Fleet management and logistics, pp. 33-56. Kluwer, Dordrecht (1998)
14. Irnich, S., Funke, B., Grünert, T.: Sequential search and its application to vehicle-routing problems. Computers & Operations Research 33, 2405-2429 (2006)
15. Labadi, N., Prins, C., Reghioui, M.: GRASP with path relinking for the capacitated arc routing problem with time windows. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 722-731. Springer, Heidelberg (2007)
16. Laporte, G., Gendreau,M., Potvin, J.Y., Semet, F.: Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7, 285-300 (2000)
17. Lourenco̧, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of metaheuristics, pp. 321-353 (2002)
18. Mester, D., Bräysy, O.: Active guided evolution strategies for large scale vehicle routing problems with time windows. Computers & Operations Research 32, 1593-1614 (2005)
19. Mester, D., Bräysy, O.: Active guided evolution strategies for large scale capacitated vehicle routing problems. Computers & Operations Research 34, 2964-2975 (2007)
20. Pisinger, D., Röpke, S.: A general heuristic for vehicle routing problems. Computers & Operations Research 34, 2403-2435 (2007)
21. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31, 1985-2002 (2004)
22. ReSmann, M., Doerner, K., Hartl, R.F.: D-ants: savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research 31, 563-591 (2004)
23. Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1, 147-167 (1995)
24. Tarantilis, C.D.: Solving the vehicle routing problem with adaptive memory programming methodology. Computers & Operations Research 32, 2309-2327 (2005)
25. TarantAlis, C.D., Kiranoudis, C.T.: Bone route: an adaptive memory-based method for effective fleet management. Annals of Operations Research 115, 227-241 (2002)
26. Toth, P., Vigo, D.: The vehicle routing problem. SIAM, Philadelphia (2002)
27. Wolf, S., Merz, P.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI/ICCV 2007. LNCS, vol. 4771, pp. 1-15. Springer, Heidelberg (2007)