Variable neighborhood search coupled with ILP-based very large neighborhood searches for the (Periodic) location-routing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6373 LNCS, Issue , 2010, Pages 174-189

  Pirkwieser, Sandro ^a   Raidl, Günther R ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITATED LOCATION; INTEGER LINEAR PROGRAMMING; LARGE NEIGHBORHOOD SEARCH; LOCATION ROUTING PROBLEM; VARIABLE NEIGHBORHOOD SEARCH; FINE GRAINED;

HEURISTIC ALGORITHMS; LINEAR PROGRAMMING; OPTIMIZATION; INTEGER PROGRAMMING;

INTEGER PROGRAMMING; OPTIMIZATION;

EID: 78349296018     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16054-7_13     Document Type: Conference Paper

References (25)

1. Salhi, S., Rand, G.K.: The effect of ignoring routes when locating depots. European Journal of Operational Research 39(2), 150-156 (1989)
2. Prins, C., Prodhon, C., Calvo, R.W.: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 4(3), 221-238 (2006)
3. Prins, C., Prodhon, C., Calvo, R.W.: A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 183-194. Springer, Heidelberg (2006)
4. Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: A memetic approach for the capacitated location routing problem. In: Prodhon, C., et al. (eds.) Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing, Troyes, France (2008)
5. Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: A GRASP×ELS approach for the capacitated location-routing problem. Computers & OR 37(11), 1912-1923 (2010)
6. Prins, C., Prodhon, C., Ruiz, A., Sorianoa, P., Calvo, R.W.: Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science 41(4), 470-483 (2007)
7. Nagy, G., Salhi, S.: Location-routing: Issues, models and methods. European Journal of Operational Research 177(2), 649-672 (2007)
8. Prodhon, C.: A metaheuristic for the periodic location-routing problem. In: Kalcsics, J., Nickel, S. (eds.) Proceedings of Operations Research 2007, pp. 159-164. Springer, Heidelberg (2007)
9. Prodhon, C., Prins, C.: A memetic algorithm with population management (MA|PM) for the periodic location-routing problem. In: Blesa, M.J., Blum, C., Cotta, C., Fernández, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol. 5296, pp. 43-57. Springer, Heidelberg (2008)
10. Prodhon, C.: An ELS×path relinking hybrid for the periodic location-routing problem. In: Blesa, M.J., Blum, C., Gaspero, L.D., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 15-29. Springer, Heidelberg (2009)
11. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research 195(3), 791-802 (2009)
12. Pirkwieser, S., Raidl, G.R.: A variable neighborhood search for the periodic vehicle routing problem with time windows. In: Prodhon, C., et al. (eds.) Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing, Troyes, France (2008)
13. Polacek, M., Hartl, R.F., Doerner, K.F., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics 10, 613-627 (2004)
14. De Franceschi, R., Fischetti, M., Toth, P.: A new ILP-based refinement heuristic for vehicle routing problems. Math. Program. 105(2-3), 471-499 (2006)
15. Pirkwieser, S., Raidl, G.R.: Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 45-59. Springer, Heidelberg (2009)
16. Raidl, G.R., Puchinger, J.: Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In: Blum, C., et al. (eds.) Hybrid Metaheuristics - An Emergent Approach for Combinatorial Optimization. SCI, vol. 114, pp. 31-62. Springer, Heidelberg (2008)
17. Hansen, P., Mladenović, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145-184. Kluwer Academic Publishers, Boston (2003)
18. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12(4), 568-581 (1964)
19. Potvin, J.Y., Rousseau, J.M.: An exchange heuristic for routeing problems with time windows. Journal of the Operational Research Society 46, 1433-1446 (1995)
20. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
21. Ahuja, R.K., Ergun, Ö., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123(1-3), 75-102 (2002)
22. Akca, Z., Berger, R.T., Ralphs, T.K.: A branch-and-price algorithm for combined location and routing problems under capacity restrictions. In: Chinneck, J.W., et al. (eds.) Operations Research and Cyber-Infrastructure. Operations Research/Computer Science Interfaces Series, vol. 47, pp. 309-330. Springer, Heidelberg (2009)
23. Desrosiers, J., Lübbecke, M.E.: A primer in column generation. In: Desaulniers, G., et al. (eds.) Column Generation, pp. 1-32. Springer, Heidelberg (2005)
24. Rousseau, L.M., Gendreau, M., Pesant, G.: Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics 8(1), 43-58 (2002)
25. Prodhon, C. (June 2010), http://prodhonc.free.fr/