Efficient local search limitation strategies for vehicle routing problems

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

Volumn 4972 LNCS, Issue , 2008, Pages 48-60

  Nagata, Yuichi ^a   Bräysy, Olli ^b  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; FLEET OPERATIONS; NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS; SOLUTIONS; STANDARDS; VEHICLES;

BENCH-MARK PROBLEMS; EUROPEAN; EVOLUTIONARY COMPUTATION (EC); HEIDELBERG (CO); LOCAL SEARCH (LS); MEMETIC ALGORITHM (MA); SOLUTION QUALITY; TRANSPORTATION COSTS; VEHICLE ROUTING PROBLEM (VRP); VEHICLE ROUTING PROBLEMS (VRP);

VEHICLE ROUTING;

EID: 47249126846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78604-7_5     Document Type: Conference Paper

References (20)

1. Alba, E., Dorronsoro, B.: Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Information Processing Letters 98, 225-230 (2006)
2. Bentley, J.L.: Experiments on Traveling Salesman Geuristics. In: Proc. of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 91-99 (1990)
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-318. Wiley, Chichester (1979)
4. 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.) Logistics systems: design and optimization, pp. 279-297. Springer, New York (2005)
5. Gendreau, M., Laporte, G., Potvin, J.Y.: Metaheuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The vehicle routing problem, pp. 129-154. SIAM, Philadelphia (2001)
6. Golden, B.L., Wasil, E.A., Kelly, J.P., Chao, I.M.: Metaheuristics in vehicle routing. In: Crainic, T.G., Laporte, G. (eds.) Fleet management and logistics, pp. 33-56. Kluwer, Boston (1998)
7. Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study. In: Aarts, E., Lenstra, J.K. (eds.) Local search in combinatorial optimization, Jhon Wiley & Sons, Chichester (1997)
8. Kubiak, M., Wesolek, P.: Accelerating Local Search in a Memetic Algorithm for the CVRP. In: Cotta, C., van Hemert, J.I. (eds.) EvoCOP 2007. LNCS, vol. 4446, pp. 142-153. Springer, Heidelberg (2007)
9. Kubiak, M.: Systematic construction of recombination operators for the vehicle routing problem. Foundations of Computing and Decision Science 29, 205-226 (2004)
10. Laporte, G., Semet, F.: Classical heuristics for the capacitated VRP. In: Toth, P., Vigo, D. (eds.) The vehicle routing problem, pp. 109-128. SIAM, Philadelphia (2001)
11. Merz, P., Freisleben, B.: Memetic Algorithms for the Traveling Salesman Problem. Complex Systems 13, 297-345 (2001)
12. Merz, P., Freisleben, B.: A genetic local search approach to the quadratic assignment problem. In: Proc. of the 7th Int. conf. on Genetic Algorithms, pp. 238-245 (1997)
13. Mester, D., Bräysy, O.: Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Computers & Operations Research 34, 2964-2975 (2007)
14. 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)
15. Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms, C3P Report 826, California Inst. of Tech. (1989)
16. Nagata, Y.: Edge Assembly Crossover for the Capacitated Vehicle Routing Problem. In: Cotta, C., van Hemert, J.I. (eds.) EvoCOP 2007. LNCS, vol. 4446, pp. 142-153. Springer, Heidelberg (2007)
17. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers & Operations Research 34, 2403-2435 (2007)
18. Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1, 147-167 (1995)
19. Taillard, E.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661-673 (1993)
20. Tarantilis, C.D.: Solving the vehicle routing problem with adaptive memory programming methodology. Computers & Operations Research 32, 2309-2327 (2005)