PKPmets.xml<DIASA particle swarm optimization algorithm with path relinking for the location routing problem10.1007/s10852-007-9073-6en20 pagesThis 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.Y. Marinakis, M. Marinaki, "A Particle swarm optimization algorithm with path relinking for the location routing problem," J. of Math. Modelling and Algorithms,vol. 7,no. 1, pp. 59-78,Mar. 2008.doi:10.1007/s10852-007-9073-6http://creativecommons.org/licenses/by/4.0/2015-11-051759-782008falsePK+>A<PKP+>A<mets.xmlPK6wMETS archive created by DIAS