A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows

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

Volumn 4972 LNCS, Issue , 2008, Pages 254-265

  Hashimoto, Hideki ^a   Yagiura, Mutsunori ^b  

^a KYOTO UNIVERSITY   (Japan)

^b NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; ARSENIC COMPOUNDS; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; CONTROL SYSTEM ANALYSIS; CONTROL THEORY; MECHANISMS; MILITARY DATA PROCESSING; NETWORK ROUTING; OPTIMIZATION; PARAMETER ESTIMATION; ROUTING ALGORITHMS; VEHICLE ROUTING; VEHICLES; WINDOWS;

ADAPTIVE MECHANISMS; COMPUTATIONAL RESULTS; CONTROL PARAMETERS; EUROPEAN; EVOLUTIONARY COMPUTATION (EC); EVOLUTIONARY MECHANISMS; HEIDELBERG (CO); HIGHLY EFFICIENT; LOCAL SEARCH (LS); NEIGHBOR LIST; NEIGHBORHOOD SEARCH; NEW SOLUTIONS; PATH RELINKING (PR); PENALTY WEIGHTS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW);

EVOLUTIONARY ALGORITHMS;

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

References (23)

1. Bräysy, O., Dullaert, W., Gendreau, M.: Evolutionary algorithms for the vehicle routing problem with time windows. Journal of Heuristics 10, 587-611 (2004)
2. Glover, F., Laguna, M., Marti, R.: Scatter search and path relinking: Advances and applications. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 1-35. Kluwer Academic Publishers, Dordrecht (2003)
3. Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study in local optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215-310. John Wiley and Sons, Chichester (1997)
4. Park, N., Okano, H., Imai, H.: A path-exchange-type local search algorithm for vehicle routing and its efficient search strategy. Journal of the Operations Research Society of Japan 43(1), 197-208 (2000)
5. Potvin, J.Y., Kervahut, T., Garcia, B.L., Rousseau, J.M.: The vehicle routing problem with time windows part I: tabu search. INFORMS Journal on Computing 8(2), 158-164 (1996)
6. Lin, S.: Computer solutions of the traveling salesman problem. Bell System Technical Journal 44, 2245-2269 (1965)
7. Taillard, É., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31(2), 170-186 (1997)
8. Reiter, S., Sherman, G.: Discrete optimizing. Journal of the Society for Industrial and Applied Mathematics 13(3), 864-889 (1965)
9. Nagata, Y.: Effective memetic algorithm for the vehicle routing problem with time windows: Edge assembly crossover for the VRPTW. In: Proceedings of the Seventh Metaheuristics International Conference (MIC 2007) (2007)
10. Ibaraki, T., Imahori, S., Kubo, M., Masuda, T., Uno, T., Yagiura, M.: Effective local search algorithms for routing and scheduling problems with general time-window constraints. Transportation Science 39(2), 206-232 (2005)
11. Ibaraki, T., Imahori, S., Nonobe, K., Sobue, K., Uno, T., Yagiura, M.: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Applied Mathematics (in press)
12. Hashimoto, H., Yagiura, M., Ibaraki, T.: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. In: Discrete Optimization (in press)
13. Hashimoto, H., Ibaraki, T., Imahori, S., Yagiura, M.: The vehicle routing problem with flexible time windows and traveling times. Discrete Applied Mathematics 154, 2271-2290 (2006)
14. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254-265 (1987)
15. Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research 162, 220-238 (2005)
16. Bräysy, O., Hasle, G., Dullaert, W.: A multi-start local search algorithm for the vehicle routing problem with time windows. European Journal of Operational Research 159, 586-605 (2004)
17. Prescott-Gagnon, E., Desaulniers, G., Rousseau, L.M.: A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Technical report, GERAD (Group for Research in Decision Analysis) (2007)
18. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers and Operations Research 34, 2403-2435 (2007)
19. Mester, D., Bräysy, O.: Active guided evolution strategies for large-scale vehicle routing problems with time windows. Computers and Operations Research 32, 1593-1614 (2005)
20. Le Bouthillier, A., Crainic, T.G., Kropf, P.: A guided cooperative search for the vehicle routing problem with time windows. IEEE Intelligent Systems 20(4), 36-42 (2005)
21. Le Bouthillier, A., Crainic, T.G.: A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers and Operations Research 32, 1685-1708 (2005)
22. Gehring, H., Homberger, J.: A parallel two-phase metaheuristic for routing problems with time-windows. Asia-Pacific Journal of Operational Research 18, 35-47 (2001)
23. Bent, R., Van Hentenryck, P.: Randomized adaptive spatial decoupling for large-scale vehicle routing with time windows. In: AAAI, pp. 173-178. AAAI Press, Menlo Park (2007)