A Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem

This paper introduces a new hybrid algorithmic nature inspired approach based on particle swarm optimization, for solving successfully one of the most popular logistics management problems, the location routing problem (LRP). The proposed algorithm for the solution of the location routing problem, the hybrid particle swarm optimization (HybPSO-LRP), combines a particle swarm optimization (PSO) algorithm, the multiple phase neighborhood search – greedy randomized adaptive search procedure (MPNS-GRASP) algorithm, the expanding neighborhood search (ENS) strategy and a path relinking (PR) strategy. The algorithm is tested on a set of benchmark instances. The results of the algorithm are very satisfactory for these instances and for six of them a new best solution has been found.

[1]  José Pinto Paixão,et al.  Using clustering analysis in a capacitated location-routing problem , 2007, Eur. J. Oper. Res..

[2]  Nicos Christofides,et al.  EXPECTED DISTANCES IN DISTRIBUTION PROBLEMS , 1969 .

[3]  Wen-Chyuan Chiang,et al.  Integrating multi-product production and distribution in newspaper logistics , 2008, Comput. Oper. Res..

[4]  Nikolaos Laoutaris,et al.  On the optimization of storage capacity allocation for content distribution , 2005, Comput. Networks.

[5]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[6]  Egon Balas,et al.  Integer Programming , 2021, Encyclopedia of Optimization.

[7]  Oli B.G. Madsen,et al.  A comparative study of heuristics for a two-level routing-location problem , 1980 .

[8]  Ιωάννης Μαρινάκης,et al.  Vehicle routing in distribution problems , 2005 .

[9]  J K Ghosh,et al.  A GENERALIZED REDUCED GRADIENT BASED APPROACH TO ROUND-TRIP LOCATION PROBLEM , 1981 .

[10]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[11]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[12]  Udatta S. Palekar,et al.  Location Models with Routing Considerations for a Single Obnoxious Facility , 1993, Transp. Sci..

[13]  C. Watson-Gandy,et al.  Depot location with van salesmen — A practical approach , 1973 .

[14]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[15]  Panos M. Pardalos,et al.  Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP , 2009, J. Comb. Optim..

[16]  Juan A. Díaz,et al.  A compact model and tight bounds for a combined location-routing problem , 2005, Comput. Oper. Res..

[17]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[18]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[19]  Panos M. Pardalos,et al.  A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm , 2007, J. Glob. Optim..

[20]  Oli B.G. Madsen,et al.  Methods for solving combined two level location-routing problems of realistic dimensions , 1983 .

[21]  Saudi Arabia,et al.  Locational Analysis of the , 1999 .

[22]  Mark S. Daskin,et al.  Network and Discrete Location , 1995 .

[23]  C. K. Y. Lin,et al.  A location-routing-loading problem for bill delivery services , 2002 .

[24]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[25]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[26]  Christian Prins,et al.  A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem , 2006, EvoCOP.

[27]  David Simchi-Levi,et al.  A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks , 1988, Oper. Res..

[28]  Heung-Suk Hwang,et al.  Design of supply-chain logistics system considering service level , 2002 .

[29]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[30]  C. K. Y. Lin,et al.  Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data , 2006, Eur. J. Oper. Res..

[31]  S. C. Liu,et al.  A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration , 2003 .

[32]  Jaime Cerdá,et al.  A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows , 2007, Eur. J. Oper. Res..

[33]  Mark S. Daskin,et al.  A warehouse location-routing problem , 1985 .

[34]  Yupo Chan,et al.  The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations , 2005, Math. Comput. Model..

[35]  Oded Berman,et al.  Technical Note - Routing and Location-Routing p-Delivery Men Problems on a Path , 1994, Transp. Sci..

[36]  Hokey Min,et al.  Combined location-routing problems: A synthesis and future research directions , 1998, Eur. J. Oper. Res..

[37]  Chinyao Low,et al.  Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..

[38]  Gilbert Laporte,et al.  Location routing problems , 1987 .

[39]  Wen-Chyuan Chiang,et al.  Integrating purchasing and routing in a propane gas supply chain , 2004, Eur. J. Oper. Res..

[40]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[41]  G. Laporte,et al.  An exact algorithm for solving a capacitated location-routing problem , 1986 .

[42]  Panos M. Pardalos,et al.  A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem , 2005, J. Comb. Optim..

[43]  G. Laporte,et al.  Hamiltonian location problems , 1983 .

[44]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[45]  Francesco Maffioli,et al.  Discrete facility location and routing of obnoxious activities , 2003, Discret. Appl. Math..

[46]  James H. Bookbinder,et al.  Vehicle routing considerations in distribution system design , 1988 .

[47]  Hokey Min.  CONSOLIDATION TERMINAL LOCATION-ALLOCATION AND CONSOLIDATED ROUTING PROBLEMS / , 1996 .

[48]  Christian Prins,et al.  A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs , 2005, J. Heuristics.

[49]  W. C. Benton,et al.  The location-routing problem: Considerations in physical distribution system design , 1990, Comput. Oper. Res..

[50]  Leon F. McGinnis,et al.  Invited reviewLocational analysis , 1983 .

[51]  Panos M. Pardalos,et al.  Expanding Neighborhood GRASP for the Traveling Salesman Problem , 2005, Comput. Optim. Appl..

[52]  Said Salhi,et al.  Nested Heuristic Methods for the Location-Routeing Problem , 1996 .

[53]  Konstantinos G. Zografos,et al.  A Combined Location-Routing Model for Hazardous Waste Transportation and Disposal , 1989 .

[54]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[55]  Fred Glover,et al.  Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.

[56]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[57]  Laura I. Burke,et al.  A two-phase tabu search approach to the location routing problem , 1999, Eur. J. Oper. Res..

[58]  Pierre Dejax,et al.  DYNAMIC LOCATION-ROUTING PROBLEMS , 1988 .

[59]  Rafael Caballero,et al.  Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia , 2007, Eur. J. Oper. Res..

[60]  Pierre Dejax,et al.  Dynamic Location-routeing Problems , 1989 .

[61]  Christian Prins,et al.  Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking , 2006, 4OR.

[62]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[63]  Graham K. Rand,et al.  Scientific Management of Transport Systems , 1982 .

[64]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .