A particle swarm optimization algorithm with path relinking for the location routing problemA particle swarm optimization algorithm with path relinking for the location routing problem Peer-Reviewed Journal Publication Δημοσίευση σε Περιοδικό με Κριτές 2015-11-052008enThis 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. http://creativecommons.org/licenses/by/4.0/Journal of Mathematical Modelling and Algorithms1759-78 Marinakis Ioannis Μαρινακης Ιωαννης Marinaki Magdalini Μαρινακη Μαγδαληνη Springer Verlag Particle swarm optimization