A Metaheuristic for the Periodic Location-Routing Problem
作者： Caroline Prodhon
DOI: 10.1007/978-3-540-77903-2_25
关键词: Distribution system 、 Routing (electronic design automation) 、 Extension (predicate logic) 、 Computer science 、 Metaheuristic 、 Heuristic 、 Mathematical optimization 、 Location routing 、 Vehicle routing problem 、 Parallel metaheuristic
摘要: The well-known Vehicle Routing Problem (VRP) has been generalized toward tactical or strategic decision levels of companies but not both. extension Periodic VRP (PVRP) plans trips over a multi-period horizon, subject to frequency constraints. Location-Routing (LRP) tackles location and routing decisions simultaneously as in most distribution systems interdependence between these leads low-quality solutions if depots are located first, regardless the future routes. Our goal is combine for first time PVRP LRP into PLRP. A metaheuristic proposed solve large size instances It based on our Randomized Extended Clarke Wright Algorithm (RECWA) it tries take consideration several when making choice during construction solution. method evaluated three sets results promising. Solutions compared literature particular cases such one-day horizon one available depot (PVRP).
springer.com
sci-hub.se 参考文章(13)
Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo, A memetic algorithm with population management (MA european conference on evolutionary computation in combinatorial optimization. pp. 183- 194 ,(2006) , 10.1007/11730095_16
Jean-Fran�ois Cordeau, Michel Gendreau, Gilbert Laporte, A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks. ,vol. 30, pp. 105- 119 ,(1997) , 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G
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
Sérgio Barreto, Carlos Ferreira, José Paixão, Beatriz Sousa Santos, Using clustering analysis in a capacitated location-routing problem European Journal of Operational Research. ,vol. 179, pp. 968- 977 ,(2007) , 10.1016/J.EJOR.2005.06.074
C.C.R. Tan, J.E. Beasley, A heuristic algorithm for the period vehicle routing problem Omega. ,vol. 12, pp. 497- 504 ,(1984) , 10.1016/0305-0483(84)90050-1
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
Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo, Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking A Quarterly Journal of Operations Research. ,vol. 4, pp. 221- 238 ,(2006) , 10.1007/S10288-006-0001-9
M. Gaudioso, G. Paletta, A Heuristic for the Periodic Vehicle Routing Problem Transportation Science. ,vol. 26, pp. 86- 92 ,(1992) , 10.1287/TRSC.26.2.86
G. Clarke, J. W. Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points Operations Research. ,vol. 12, pp. 568- 581 ,(1964) , 10.1287/OPRE.12.4.568
N. Christofides, J. E. Beasley, The period routing problem Networks. ,vol. 14, pp. 237- 256 ,(1984) , 10.1002/NET.3230140205