A variable neighborhood search for the capacitated location-routing problem

2011 4th International Conference on Logistics, LOGISTIQUA'2011

Volumn , Issue , 2011, Pages 514-519

  Derbel, Houda ^a   Jarboui, Bassem ^a   Chabchoub, Habib ^a   Hanafi, Saïd ^b   Mladenović, Nenad ^c,d  

^a UNIVERSITY OF SFAX   (Tunisia)

^b LAMIH   (France)

^c BRUNEL UNIVERSITY   (United Kingdom)

^d MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

location routing problem; variable neighborhood search

Indexed keywords

BASIC ELEMENTS; CAPACITATED LOCATION; HEURISTIC APPROACH; LOCAL SEARCH; LOCATION ROUTING PROBLEM; VARIABLE NEIGHBORHOOD SEARCH; VEHICLE FLEETS;

HEURISTIC METHODS;

FLEET OPERATIONS;

EID: 79960926660     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LOGISTIQUA.2011.5939452     Document Type: Conference Paper

References (29)

1. G. Nagy S. Salhi, "Location-routing: issues, models and methods," European journal of operational research, vol. 177, pp. 649-672, 2007.
2. M. Albreda-Sambola, J. Diaz, and E. Fernandez, "A compact model and tight bounds for a combined location-routing problem," Computers and Operations Research, vol. 32, no. 3, pp. 407-428, 2005.
3. H. Min, V. Jayaramann, and R. Srivastava, "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, vol. 108, pp. 1-15, 1998. (Pubitemid 128372582)
4. G. Laporte, Vehicle routing: methods and studies. North-Holland: Amsterdam: Golden BL, Assad AA, 1988, ch. Location-Routing Problems, pp. 163-197.
5. J. Perl and M. Daskin," A warehouse location problem," Transportation Research, vol. 19B, no. 5, pp. 381-396, 1985.
6. G. Laporte,Y. Norbert, and D. Arpin," An exact algorithm for solving a capacitated location-routing problem," Annals of Operations Research, vol. 6, pp. 293-310, 1986.
7. G. Laporte,Y. Nobert, and S. Taillefer," Solving a family of multi-depot vehicle routing and location-routing problems," Transportation Science, vol. 22, pp. 22-172, 1988.
8. J. -M. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Calvo, "A branch-and-cut method for the capacitated location-routing problem," Computers and Operations Research, vol. 38, pp. 931-941, 2011.
9. H. Derbel, B. Jarboui, S. Hanafi, and H. Chabchoub, "An iterated local search for solving a location-routing problem," Electronic Notes in Discrete Mathematics, vol. 36, pp. 875-882, 2010.
10. D. Tuzun L. Burke, "A two-phase tabu search approach to the location routing problem," European Journal of Operational Research, vol. 116, no. 1, pp. 87-99, 1999.
11. S. Salhi M. Fraser, "An integrated heuristic approach for the combined location vehicle fleet mix problem," Studies in Locational Analysis, vol. 8, pp. 3-21, 1996.
12. T. -H. Wu, C. Low, and J. -W. Bai, "Heuristic solutions to multidepot location-routing problems," Computers and Operations Research, vol. 29, pp. 1393-1415, 2002. (Pubitemid 34409654)
13. S. Salhi and G. Rand, "The effect of ignoring routes when locating depots," European Journal of Operational Research, vol. 39, pp. 150-156, 1989.
14. G. Nagy and S. Salhi," Nested heuristic methods for the location-routing problem," Journal of Operational Research Society, vol. 47, pp. Il66-74, 1996.
15. -," A nested location-routing heuristic using route length estimation," Studies in Locational Analysis, vol. 10, pp. 109-27, 1996.
16. S. Salhi and G. Nagy, "Consistency and robustness in location-routing," Studies in Locational Analysis, vol. 13, pp. 3-19, 1999.
17. C. Prins, C. Prodhon, and R. Wolfer-Calvo, "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, vol. 4, pp. 221-238, 2006.
18. C. Prins, C. Prodhon, A. Ruiz, P. Soriano, and R. W. Calvo, "Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic," Transportation Science, vol. 41, pp. 470-483, 2007.
19. V. Yu, S. Lin, W. Lee, and C. Ting, "A simulated annealing heuristic for the capacitated location routing problem," Computers and Industrial Engineering, vol. 58, 2010.
20. S. Kirkpatrick, C. Gelatt, and M. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
21. F. Glover, "Tabu search," ORSA Journal on Computing, vol. 1, pp. 190-206, 1989.
22. N. Mladenovic P. Hansen, "Variable neighborhood search," Computers and Operations Research, vol. 24, no. 11, pp. 1097-1100, 1997.
23. P. Hansen, N. Mladenović, and J. M. Pérez, "Variable neighbourhood search: methods and applications," Annals of Operations Research, vol. 175, no. 1, pp. 367-407, 2010.
24. P. Hansen, B. Hegedahl, S. Hjortkjaer, and B. Obel, "A heuristic solution to the warehouse location-routing problem," European Journal of Operational Research, vol. 76, pp. 111-127, 1994.
25. P. Hansen and N. Mladenović, Handbook of metaheuristics. Kluwer Academic Publisher, 2003, ch. Variable neighbourhood search, pp. 145-84.
26. S. Barreto, "Análise e modelizaça&tild;o de problemas de localizaça&tild;o distribuiça&tild;o [analysis and modelling of location-routing problems]," Ph.D. dissertation, University of Aveiro, campus universitrio de Santiago, Portugal, 2004.
27. "http://prodhonc.free.fr/homepage."
28. C. Prins, C. Prodhon, and R. Wolfer-Calvo," A memetic algorithm with population management (ma - pm) for the capacitated location-routing problem," In: Lecture Notes in Computer Science. Berlin: Springer, vol. 3906, pp. 183-94, 2006. (Pubitemid 44019284)
29. C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon, "A graspxels approach for the capacitated location-routing problem," Computers and Operations Research, vol. 37, no. 11, pp. 1912-1923, 2010.