Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
作者： Christian Prins , Caroline Prodhon , Roberto Wolfler Calvo
DOI: 10.1007/S10288-006-0001-9
关键词: Upper and lower bounds 、 Heuristic 、 Heuristics 、 Path (graph theory) 、 Process (computing) 、 GRASP 、 Routing (electronic design automation) 、 Metaheuristic 、 Mathematics 、 Mathematical optimization
摘要: As shown in recent researches, the costs distribution systems may be excessive if routes are ignored when locating depots. The location routing problem (LRP) overcomes this drawback by simultaneously tackling and decisions. This paper presents a new metaheuristic to solve LRP with capacitated A first phase executes GRASP, based on an extended randomized version of Clarke Wright algorithm. is implemented learning process choice In second phase, solutions generated post-optimization using path relinking. method evaluated sets randomly instances, compared other heuristics lower bound. Solutions obtained reasonable amount time for such strategic problem. Furthermore, algorithm competitive published case uncapacitated
springer.com
sci-hub.se 参考文章(24)
Marcelo Prais, Celso C. Ribeiro, Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment Informs Journal on Computing. ,vol. 12, pp. 164- 176 ,(2000) , 10.1287/IJOC.12.3.164.12639
Tai-Hsi Wu, Chinyao Low, Jiunn-Wei Bai, Heuristic solutions to multi-depot location-routing problems Computers & Operations Research. ,vol. 29, pp. 1393- 1415 ,(2002) , 10.1016/S0305-0548(01)00038-7
Dilek Tuzun, Laura I. Burke, A two-phase tabu search approach to the location routing problem European Journal of Operational Research. ,vol. 116, pp. 87- 99 ,(1999) , 10.1016/S0377-2217(98)00107-6
Hokey Min, Vaidyanathan Jayaraman, Rajesh Srivastava, Combined Location-Routing Problems: A Synthesis and Future Research Directions European Journal of Operational Research. ,vol. 108, pp. 1- 15 ,(1998) , 10.1016/S0377-2217(97)00172-0
Yupo Chan, William B. Carter, Michael D. Burnes, A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands Computers & Operations Research. ,vol. 28, pp. 803- 826 ,(2001) , 10.1016/S0305-0548(00)00009-5
R. Horst, N. V. Thoai, J. De Vries, A new simplicial cover technique in constrained global optimization Journal of Global Optimization. ,vol. 2, pp. 1- 19 ,(1992) , 10.1007/BF00121299
T. William Chien, Heuristic Procedures for Practical-Sized Uncapacitated Location-Capacitated Routing Problems Decision Sciences. ,vol. 24, pp. 995- 1021 ,(1993) , 10.1111/J.1540-5915.1993.TB00500.X
R Srivastava, Alternate solution procedures for the location-routing problem Omega-international Journal of Management Science. ,vol. 21, pp. 497- 506 ,(1993) , 10.1016/0305-0483(93)90082-V
Said Salhi, Graham K. Rand, The effect of ignoring routes when locating depots European Journal of Operational Research. ,vol. 39, pp. 150- 156 ,(1989) , 10.1016/0377-2217(89)90188-4
Gilbert Laporte, François Louveaux, Hélène Mercure, Models and exact solutions for a class of stochastic location-routing problems European Journal of Operational Research. ,vol. 39, pp. 71- 78 ,(1989) , 10.1016/0377-2217(89)90354-8