Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

A particle swarm optimization algorithm with path relinking for the location routing problem

Marinakis Ioannis, Marinaki Magdalini

Full record


URI: http://purl.tuc.gr/dl/dias/381FFA8C-0B9A-4A96-8A5B-A4D68E9FEC44
Year 2008
Type of Item Peer-Reviewed Journal Publication
License
Details
Bibliographic Citation 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-6 https://doi.org/10.1007/s10852-007-9073-6
Appears in Collections

Summary

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.

Services

Statistics