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

Simple record

URIhttp://purl.tuc.gr/dl/dias/381FFA8C-0B9A-4A96-8A5B-A4D68E9FEC44-
Identifierhttps://doi.org/10.1007/s10852-007-9073-6-
Languageen-
Extent20 pagesen
TitleA particle swarm optimization algorithm with path relinking for the location routing problemen
CreatorMarinakis Ioannisen
CreatorΜαρινακης Ιωαννηςel
CreatorMarinaki Magdalinien
CreatorΜαρινακη Μαγδαληνηel
PublisherSpringer Verlagen
Content SummaryThis 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. en
Type of ItemPeer-Reviewed Journal Publicationen
Type of ItemΔημοσίευση σε Περιοδικό με Κριτέςel
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2015-11-05-
Date of Publication2008-
SubjectParticle swarm optimizationen
Bibliographic CitationY. 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-6en

Services

Statistics

 

Copyright © DIAS 2013