GRASP with path relinking for the capacitated arc routing problem with time windows

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

Volumn 4448 LNCS, Issue , 2007, Pages 722-731

  Reghioui, Mohamed ^a   Prins, Christian ^a   Labadi, Nacima ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Arc routing; GRASP; Path relinking; Time windows

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; HEURISTIC METHODS; NETWORK ROUTING;

ARC ROUTING; GRASP; PATH RELINKING; TIME WINDOWS;

PROBLEM SOLVING;

EID: 34548057084     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71805-5_78     Document Type: Conference Paper

References (12)

1. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Vol. 6. Journal of Global Optimization (1995) 109-133
2. Golden, B.L., DeArmon, J.S., Baker, E.K.: Computational experiments with algorithms for a class of routing problems. Vol. 10(1). Computers & Operation Research (1983) 47-59
3. Gueguen, C.: Exact solution methods for vehicle routing problems. Ph.D. thesis (in French), Central School of Paris (1999)
4. Ho S.C., Gendreau M.: Path relinking for the vehicle routing problem. Vol. 12(1-2). Journal of Heuristics (2006) 55-72
5. Kindervater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges. In E.H.L. Aarts and J.K. Lenstra (Eds.): Local Search in Combinatorial Optimization, Wiley, Chichester (1997) 337-360
6. Lacomme P., Prins C., Ramdane-Chérif W.: Competitive memetic algorithms for arc routing problems, Vol. 131, Annals of Operations Research (2004) 159-185
7. Marti, R., Laguna, M., Campos, V.: Scatter Search vs Genetic Algorithms: an experimental evaluation with permutation problems. In G. Rego and B. Alidaee (Eds.): Metaheuristic optimization via memory and evolution, Tabu Search and Scatter Search, OR/CS Interfaces Series vol. 30, Springer (2005) 263-283
8. Mullaseril, P.A.: Capacitated Rural Postman Problem with Time Windows and Split Delivery. Ph.D. thesis, MIS Department, University of Arizona, Tucson, Arizona (1997)
9. Pearn, W.L.: Augment-insert algorithms for the Capacitated Arc Routing Problem. Vol. 18(2). Computers & Operations Research (1991) 189-198
10. Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: recent advances and applications. In T. Ibaraki, K. Nonobe and M. Yagiura (Eds.): Metaheuristics: Progress as Real Problem Solvers, Springer (2005) 29-63
11. Tagmouti, M., Gendreau, M., Potvin, J.-Y.: Arc routing problems with time-dependent service costs, Research report 2005/10, CRT, Montréal (2005)
12. Wohlk, S.: Contributions to arc routing, Ph.D. thesis, Faculty of Social Sciences, University of Southern Denmark (2005)