A Particle Swarm Optimization Algorithm with Path Relinking for the Location Routing Problem |
| |
Authors: | Yannis Marinakis Magdalene Marinaki |
| |
Institution: | (1) Department of Production Engineering and Management, Technical University of Crete, 73100 Chania, Greece |
| |
Abstract: | 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.
|
| |
Keywords: | Particle swarm optimization MPNS-GRASP Path relinking Expanding neighborhood search Location routing problem |
本文献已被 SpringerLink 等数据库收录! |
|