Variable neighborhood search for location routing

Computers and Operations Research

Volumn 40, Issue 1, 2013, Pages 47-57

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

^a UNIVERSITY OF SFAX   (Tunisia)

^b BRUNEL UNIVERSITY   (United Kingdom)

^c LAMIH   (France)

^d MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Heuristic; Location routing; Variable neighborhood search

Indexed keywords

HEURISTIC; LEAST COST ROUTES; LOCAL SEARCH; LOCATION ROUTING PROBLEM; LOCATION-ROUTING; NEIGHBORHOOD SEARCH; NEIGHBORHOOD STRUCTURE; VARIABLE NEIGHBORHOOD SEARCH;

COMPUTER SCIENCE; OPERATIONS RESEARCH;

HEURISTIC ALGORITHMS;

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

References (33)

1. M. Albreda-Sambola, J. Diaz, and E. Fernandez A compact model and tight bounds for a combined location-routing problem Computers and Operations Research 32 3 2005 407 428
2. Barreto S. Análise e modelização de problemas de localização-distribuição [analysis and modelling of location-routing problems]. PhD thesis. Portugal: University of Aveiro, campus universit'ario de Santiago; 2004.
3. O. Bräysy A reactive variable neighborhood search for the vehicle-routing problem with time windows INFORMS Journal on Computing 15 4 2003 347 368
4. J. Brimberg, P. Hansen, N. Mladenović, and E. Taillard Improvements and comparison of heuristics for solving the multisource Weber problem Operations Research 48 3 2000 444 460
5. E. Carrizosa, N. Mladenović, and R. Todosijević Sum of squares clustering on networks Yugoslav Journal of Operations Research 21 2011 157 161
6. Derbel H, Jarboui B, Chabchoub B, Hanafi S, Mladenović N. A variable neighborhood search for the capacitated location-routing problem. In: LOGISTIQUA, 4th international conference on logistics; 2011. p. 514-9.
7. H. Derbel, B. Jarboui, S. Hanafi, and H. Chabchoub An iterated local search for solving a location-routing problem Electronic Notes in Discrete Mathematics 36 2010 875 882
8. C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon A GRASPxELS approach for the capacitated location-routing problem Computers and Operations Research 37 11 2009 1912 1923
9. J. Fathali, and H. Kakhki Solving the p-median problem with POS/NEG weights by variable neighborhood search and some results for special cases European Journal of Operational Research 170 2006 440 462
10. K. Fleszar, and K. Hindi An effective VNS for the capacitated p-median problem European Journal of Operational Research 191 2008 612 622
11. F. Glover Tabu search ORSA Journal on Computing 1 1989 190 206
12. P. Hansen, and N. Mladenović Variable neighborhood search for the p-median Location Science 5 1997 207 226
13. P. Hansen, and N. Mladenović Variable neighborhood search: principles and applications European Journal of Operational Research 130 2001 449 467
14. P. Hansen, and N. Mladenović Variable neighborhood search. Handbook of metaheuristics 2003 Kluwer Academic Publisher Boston, Dordrecht, London p. 145-84
15. P. Hansen, N. Mladenović, and J.M. Pérez Variable neighbourhood search: methods and applications Annals of Operations Research 175 1 2010 367 407
16. A. Ilić, D. Urošević, J. Brimberg, and N. Mladenović A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem European Journal of Operational Research 206 2010 289 300
17. S. Jacobsen, and O. Madsen A comparative study of heuristics for a two-level routing-location problem European Journal of Operational Research 5 1980 378 387
18. S. Kirkpatrick, C. Gelatt, and M. Vecchi Optimization by simulated annealing Science 220 1983 671 680
19. T. Kulcar Optimizing solid waste collection in brussels European Journal of Operational Research 90 1996 26 44
20. G. Laporte, and Y. Norbert An exact algorithm for minimizing routing and operating costs in depot location European Journal of Operational Research 6 1981 224 226
21. G. Laporte, Y. Norbert, and D. Arpin An exact algorithm for solving a capacitated location-routing problem Annals of Operations Research 6 1986 293 310
22. N. Mladenović, and P. Hansen Variable neighborhood search Computers and Operations Research 24 11 1997 1097 1100
23. G. Nagy, and S. Salhi Nested heuristic methods for the location-routing problem Journal of Operational Research Society 47 1996 1166 1174
24. G. Nagy, and S. Salhi A nested location-routing heuristic using route length estimation Studies in Locational Analysis 10 1996 109 127
25. G. Nagy, and S. Salhi Location-routing: issues, models and methods European Journal of Operational Research 177 2007 649 672
26. S. Parragh, K. Doerner, and R. Hartl Variable neighborhood search for the dial-a-ride problem Computers and Operations Research 37 2010 1129 1138
27. M. Polacek, K. Doerner, R. Hartl, and V. Maniezzo A variable neighborhood search for the capacitated arc routing problem with intermediate facilities Journal of Heuristics 14 2008 405 423
28. M. Polacek, R. Hartl, K. Doerner, and M. Reimann A variable neighborhood search for the multi depot vehicle routing problem with time windows Journal of Heuristics 10 2004 613 627
29. 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 4 2006 221 238
30. S. Salhi, and M. Sari A multi-level composite heuristic for the multi-depot vehicle fleet mix problem European Journal of Operational Research 103 1997 95 112
31. C. Tarantalis, and C. Kiranoudis Boneroute: an adaptive memory-based method for effective fleet management Annals of Operations Research 115 2002 227 241
32. D. Tuzun, and L. Burke A two-phase tabu search approach to the location routing problem European Journal of Operational Research 47 1996 1166 1174
33. F. Vincent, L. Shih-Wei, L. Wenyih, and T. Ching-Jung A simulated annealing heuristic for the capacitated location routing problem Computers and Industrial Engineering 58 2 2010 288 299