Multilevel variable neighborhood search for periodic routing problems

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

Volumn 6022 LNCS, Issue , 2010, Pages 226-238

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

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COARSENING; COMBINATORIAL OPTIMIZATION;

BENCHMARK TESTS; CPU TIME; MULTILEVEL REFINEMENT; NEW APPROACHES; PATH-BASED; PERIODIC ROUTING PROBLEMS; SUITABLE SOLUTIONS; VARIABLE NEIGHBORHOOD SEARCH;

OPTIMIZATION;

EID: 77952294690     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12139-5_20     Document Type: Conference Paper

References (15)

1. Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research 131, 325-372 (2004)
2. Walshaw, C.: Multilevel refinement for combinatorial optimisation: Boosting metaheuristic performance. In: Blum, C., et al. (eds.) Hybrid Metaheuristics: An Emerging Approach to Optimization. SCI, vol.114, pp. 261-289. Springer, Heidelberg (2008)
3. Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105-119 (1997) (Pubitemid 127360996)
4. Bertazzi, L., Paletta, G., Speranza, M.G.: An improved heuristic for the period traveling salesman problem. Computers & Operations Research 31(8), 1215-1222 (2004) (Pubitemid 38356029)
5. Alegre, J., Laguna, M., Pacheco, J.: Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts. European Journal of Operational Research 179(3), 736-746 (2007)
6. 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)
7. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
8. Francis, P.M., Smilowitz, K.R., Tzur, M.: The period vehicle routing problem and its extensions. In: Golden, B., et al. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 73-102. Springer, US (2008)
9. 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)
10. Rodney, D., Soper, A., Walshaw, C.: Multilevel refinement strategies for the capacity vehicle routing problem. International Journal of Information Technology & Intelligent Computing 2(3) (2007)
11. Walshaw, C.: A multilevel approach to the travelling salesman problem. Operations Research 50(5), 862-877 (2002)
12. Bouhmala, N.: Combining local search with the multilevel paradigm for the traveling salesman problem. In: Blum, C., et al. (eds.) Proc. 1st IntlWorkshop on Hybrid Metaheuristics, pp. 51-58 (2004)
13. Hansen, P., Mladenovíc, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145-184. Kluwer Academic Publishers, Boston (2003)
14. 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)
15. 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)