A GRASP×ELS approach for the capacitated location-routing problem

Computers and Operations Research

Volumn 37, Issue 11, 2010, Pages 1912-1923

  Duhamel, Christophe ^a   Lacomme, Philippe ^a   Prins, Christian ^b   Prodhon, Caroline ^b  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Evolutionary local search; GRASP; Iterated local search; Location routing problem

Indexed keywords

CAPACITATED LOCATION; DELIMITERS; DISTRIBUTION NETWORK; FLEET ASSIGNMENT; FLEET SIZES; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; ITERATED LOCAL SEARCH; LIMITED CAPACITY; LOCAL SEARCH; LOCATION ROUTING PROBLEM; NUMERICAL EXPERIMENTS; ROUTING DECISIONS; SET OF CUSTOMERS; SOLUTION METHODS; SOLUTION SPACE; TOTAL COSTS; VEHICLE CAPACITY;

COSTS; DISTRIBUTED PARAMETER NETWORKS; LOCATION; NUMERICAL METHODS;

FLEET OPERATIONS;

EID: 77951111804     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.07.004     Document Type: Article

References (27)

1. Salhi S., and Rand GK. The effect of ignoring routes when locating depots. European Journal of Operational Research 39 (1989) 150-156
2. Min H., Jayaraman V., and Srivastava R. Combined location-routing problems: a synthesis and future research directions. European Journal of Operational Research 108 (1998) 1-15
3. Nagy G., and Salhi S. Location-routing: issues, models and methods. European Journal of Operational Research 177 (2007) 649-672
4. Laporte G. Location-routing problems. In: Golden B.L., and Assad A.A. (Eds). Vehicle routing: methods and studies (1988), North-Holland, Amsterdam 163-197
5. Wu T.H., Low C., and Bai JW. Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research 29 (2002) 1393-1415
6. Prins C., Prodhon C., and Wolfler-Calvo R. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR-A Quarterly Journal of Operations Research 4 3 (2006) 221-238
7. Prins C., Prodhon C., and Wolfler-Calvo R. A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. In: Lecture notes in computer science. vol. 3906 (2006), Springer, Berlin p. 183-94
8. Barreto S. Analise e modelização de problemas de localização-distribuição [Analysis and modelling of location-routing problems]. PhD thesis, University of Aveiro, Portugal; October 2004.
9. Prins C., Prodhon C., Soriano P., Ruiz A., and Wolfler-Calvo R. Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science 41 4 (2007) 470-483
10. Prins C. A GRASP×evolutionary local search hybrid for the vehicle routing problem. In: Pereira F.B., and Tavares J. (Eds). Bio-inspired algorithms for the vehicle routing problem, studies in computational intelligence vol. 161 (2009), Springer, Berlin 35-53
11. Feo T.A., and Bard J. Flight scheduling and maintenance base planning. Management Science 36 (1989) 1415-1432
12. Feo T.A., and Resende MGC. Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-133
13. Wolf S., and Merz P. Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Lecture notes in computer science. vol. 4771 (2007), Springer, Berlin p. 1-15
14. Beasley JE. Route-first cluster-second methods for vehicle routing. Omega 11 (1983) 403-408
15. Lacomme P., Prins C., and Ramdane-Chérif W. Competitive memetic algorithms for arc routing problems. Annals of Operations Research 131 (2004) 159-185
16. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31 (2004) 1985-2002
17. Hertz A., Plumettaz M., and Zufferey N. Variable space search for graph coloring. Discrete Applied Mathematics 156 13 (2008) 2551-2560
18. Clarke G., and Wright J. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
19. Golden B.L., DeArmon J.S., and Baker EK. Computational experiments with algorithms for a class of routing problems. Computers and Operations Research 10 (1983) 47-59
20. Lin S., and Kernighan B. An effective heuristic algorithm for the traveling salesman problem. Operations Research 21 (1973) 498-516
21. Desrosiers J., Soumis F., and Desrochers M. Routing with time windows by column generation. Networks 14 (1988) 545-565
22. Wirth N. Algorithms+data structures=programs. Prentice-Hall Series in Automatic Computation, 1976.
23. Levy G. Algorithmique combinatoire: méthodes constructives (1994), Dunod, Paris
24. Kaplan H, Tarjan RE. New heap data structures. Technical Report TR-597-99, Princeton University. 〈http://www.cs.princeton.edu/research/techreps/TR-597-99〉, 1999.
25. Prins C., Prodhon C., Wolfler-Calvo R. Nouveau algorithmes pour le problème de localisation et routage sous contraintes de capacité. In: MOSIM'04 (4ème Conférence Francophone de Modélisation et Simulation, Nantes, France, 01-03/09/2004), p. 1115-22, Editions Tec-Doc Lavoisier, 2004. ISBN 2-7430-0731-1.
26. Tuzun D., and Burke LI. A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 116 (1999) 87-99
27. Prodhon C. 〈http://prodhonc.free.fr/homepage〉, 2008.