A memetic algorithm for the capacitated location-routing problem with mixed backhauls

Computers and Operations Research

Volumn 55, Issue , 2015, Pages 200-216

  Karaoglan, Ismail ^a   Altiparmak, Fulya ^b  

^a SELCUK UNIVERSITY   (Turkey)

^b GAZI UNIVERSITY   (Turkey)

Author keywords

Capacitated location routing problem; Memetic algorithm; Mixed backhauls

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; NETWORK ROUTING; SUPPLY CHAINS;

BRANCH-AND-CUT ALGORITHMS; CAPACITATED LOCATION; COMPUTATIONAL RESULTS; LOGISTICS MANAGEMENT; MEMETIC ALGORITHMS; MIXED BACKHAULS; PICKUP AND DELIVERY; ROUTING DECISIONS;

PROBLEM SOLVING;

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

References (58)

1. S. Salhi, and G.K. Rand The effect of ignoring routes when locating depots Eur J Oper Res 39 2 1989 150 156
2. G. Laporte, Y. Nobert, and D. Arpin An exact algorithm for solving a capacitated location-routing problem Ann Oper Res 6 1986 293 310
3. R.T. Berger, C.R. Coullard, and M.S. Daskin Location-routing problems with distance constraints Transp Sci 41 1 2007 29 43
4. J.M. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R.W. Calvo A branch-and-cut method for the capacitated location-routing problem Comput Oper Res 38 6 2011 931 941
5. H. Min, V. Jayaraman, and R. Srivastava Combined location-routing problems:a synthesis and future research directions Eur J Oper Res 108 1998 1 15
6. G. Laporte Location-routing problems B.L. Golden, A.A. Assad, Vehicle routing: methods and studies 1988 North-Holland Amsterdam 163 198
7. G. Nagy, and S. Salhi Location-routing: issues, models and methods Eur J Oper Res 177 2 2007 649 672
8. R.B. Lopes, C. Ferreira, B.S. Santos, and S. Barreto A taxonomical analysis, current methods and objectives on location-routing problems Int Trans Oper Res 20 6 2013 795 822
9. C. Prodhon, and C. Prins A survey of recent research on location-routing problems Eur J Oper Res 2014
10. G. Berbeglia, J.-F. Cordeau, I. Gribkovskaia, and G. Laporte Static pickup and delivery problems: a classification scheme and survey TOP 15 1 2007 1 31
11. S.N. Parragh, K.F. Doerner, and R.F. Hartl A survey on pickup and delivery problems J Betriebswirtschaft 58 2 2008 81 117
12. G. Mosheiov The traveling salesman problem with pick-up and delivery Eur J Oper Res 79 2 1994 299 310
13. G. Nagy, and S. Salhi The many-to-many location-routing problem TOP 6 2 1998 261 275
14. M.H.J. Webb Cost functions in the location of depots for multiple-delivery journeys Oper Res Q 19 3 1968 311 320
15. N. Christofides, and S. Eilon An algorithm for the vehicle-dispatching problem Oper Res Q 20 3 1969 309 318
16. G. Laporte, and Y. Nobert An exact algorithm for minimizing routing and operating costs in depot location Eur J Oper Res 6 2 1981 224 226
17. G. Laporte, Y. Nobert, and P. Pelletier Hamiltonian location problems Eur J Oper Res 12 1 1983 82 89
18. D. Ambrosino, and M.G. Scutella Distribution network design: new problems and related models Eur J Oper Res 165 3 2005 610 624
19. R. Baldacci, A. Mingozzi, and R.W. Calvo An exact method for the capacitated location-routing problem Oper Res 59 5 2011 1284 1296
20. C. Contardo, J.F. Cordeau, and B. Gendron An exact algorithm based on cut-and-column generation for the capacitated location-routing problem INFORMS J Comput 26 1 2014 88 102
21. S.K. Jacobsen, and O.B.G. Madsen A comparative study of heuristics for a two-level routing-location problem Eur J Oper Res 5 1980 378 387
22. J.M. Nambiar, L.F. Gelders, and L.N. Van Wassenhove A large scale location-allocation problem in the natural rubber industry Eur J Oper Res 6 2 1981 183 189
23. R. Srivastava, and W.C. Benton The location-routing problem: considerations in physical distribution system design Comput Oper Res 17 5 1990 427 435
24. R. Srivastava Alternate solution procedures for the location-routing problem Omega 21 4 1993 497 506
25. J. Perl, and M.S. Daskin A unified warehouse location-routing methodology J Bus Logist 5 1 1984 92 111
26. J. Perl, and M.S. Daskin A warehouse location-routing problem Transp Res Part B 19 5 1985 381 396
27. P.H. Hansen, B. Hegedahl, S. Hjortkjær, and B. Obel A heuristic solution to the warehouse location-routing problem Eur J Oper Res 76 1 1994 111 127
28. D. Tuzun, and L.I. Burke Two-phase tabu search approach to the location routing problem Eur J Oper Res 116 1 1999 87 99
29. C. Clarke, and J.Q. Wright Scheduling of vehicle from a central depot to a number of delivery points Oper Res 12 4 1964 568 581
30. Bouhafs L, Hajjam A, Koukam A. A combination of simulated annealing and Ant Colony System for the capacitated location-routing problem, 2006; p. 409-16.
31. T.H. Wu, C. Low, and J.W. Bai Heuristic solutions to multi-depot location-routing problems Comput Oper Res 29 10 2002 1393 1415
32. Z. Özyurt, and D. Aksen Solving the multi-depot location-routing problem with Lagrangian relaxation E.K. Baker, A. Joseph, A. Mehrotra, M.A. Trick, Extending the horizons: advances in computing, optimization, and decision technologies 2007 Springer US 125 144
33. Y. Chan, and S.F. Baker The multiple depot, multiple traveling salesmen facility-location problem: vehicle range, service frequency, and heuristic implementations Math Comput Model 41 8-9 2005 1035 1053
34. M. Albareda-Sambola A compact model and tight bounds for a combined location-routing problem Comput Oper Res 32 3 2005 407 428
35. C. Prins, C. Prodhon, and R.W. Calvo Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking 4OR 4 3 2006 221 238
36. C. Prins, C. Prodhon, and R. Calvo A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem J. Gottlieb, G. Raidl, Evolutionary computation in combinatorial optimization 2006 Springer Berlin/Heidelberg 183 194
37. 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 Transp Sci 41 4 2007 470 483
38. S. Barreto, C. Ferreira, J. Paixao, and B. Santos Using clustering analysis in a capacitated location-routing problem Eur J Oper Res 179 3 2007 968 977
39. Y. Marinakis, and M. Marinaki A particle swarm optimization algorithm with path relinking for the location routing problem J Math Model Algorithms 7 1 2008 59 78
40. Marinakis Y, Marinaki M, Matsatsinis N, Honey Bees Mating Optimization for the Location Routing Problem, 2008.
41. C. Duhamel, P. Lacomme, C. Prins, and C. Prodhon A GRASP×ELS approach for the capacitated location-routing problem Comput Oper Res 37 11 2010 1912 1923
42. V.C. Hemmelmayr, J.F. Cordeau, and T.G. Crainic An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics Comput Oper Res 39 12 2012 3215 3228
43. C.J. Ting, and C.H. Chen A multiple ant colony optimization algorithm for the capacitated location routing problem Int J Prod Econ 141 1 2013 34 44
44. J.W. Escobar, R. Linfati, and P. Toth A two-phase hybrid heuristic algorithm for the capacitated location-routing problem Comput Oper Res 40 1 2013 70 79
45. C. Contardo, J.F. Cordeau, and B. Gendron A GRASP+ILP-based metaheuristic for the capacitated location-routing problem J Heuristics 20 1 2014 1 38
46. C. Contardo, V. Hemmelmayr, and T.G. Crainic Lower and upper bounds for the two-echelon capacitated location-routing problem Comput Oper Res 39 12 2012 3185 3199
47. V.P. Nguyen, C. Prins, and C. Prodhon Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking Eur J Oper Res 216 1 2012 113 126
48. H. Toyoglu, O.E. Karasan, and B.Y. Kara Distribution network design on the battlefield Nav Res Logist 58 3 2011 188 209
49. H. Toyoglu, O.E. Karasan, and B.Y. Kara A new formulation approach for location-routing problems Netw Spat Econ 12 4 2012 635 659
50. I. Karaoglan, F. Altiparmak, I. Kara, and B. Dengiz The location-routing problem with simultaneous pickup and delivery: formulations and a heuristic approach Omega - Int J Manag Sci 40 4 2012 465 477
51. I. Karaoglan, F. Altiparmak, I. Kara, and B. Dengiz A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery Eur J Oper Res 211 2 2011 318 332
52. M. Gen, and R. Cheng Genetic algorithms & engineering design 1997 Wiley NewYork
53. C. Prins A simple and effective evolutionary algorithm for the vehicle routing problem Comput Oper Res 31 12 2004 1985 2002
54. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
55. C. Prodhon Le probleme de localisation-routage [Ph.D. thesis] 2006 UniversitÁ de Technologie deTroyes France
56. S. Barreto Analise e modelização de problemas de localização-distribuição [Analysis and modelling of location-routing problems] [Ph.D. thesis] 2004 University of Aveiro Portugal
57. S. Salhi, and G. Nagy A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling J Oper Res Soc 50 10 1999 1034 1042
58. E. Angelelli, and R. Mansini The vehicle routing problem with time windows and simultaneous pick-up and delivery A. Klose, M.G. Speranza, L.N. Van Wassenhove, Quantitative approaches to distribution logistics and supply chain management 2002 Springer-Verlag Berlin 249 267