A hybrid Particle Swarm Optimization – Variable Neighborhood Search algorithm for Constrained Shortest Path problems

•The Constrained Shortest Path problem is solved using a hybridized version of PSO.•A different equation for the particles’ velocities is used.•A novel expanding neighborhood topology is applied.•A VNS algorithm is applied in order to optimize the particles’ position.•The algorithm is tested in a nu...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 261; no. 3; pp. 819 - 834
Main Authors: Marinakis, Yannis, Migdalas, Athanasios, Sifaleras, Angelo
Format: Journal Article
Language:English
Published: Elsevier B.V 16.09.2017
Subjects:
Constrained Shortest Path problem
Expanding neighborhood topology
Industrial Logistics
Industriell logistik
Particle Swarm Optimization
Variable Neighborhood Search
Expanding neighborhood topology
Variable Neighborhood Search
Particle Swarm Optimization
Constrained Shortest Path problem
ISSN:0377-2217, 1872-6860, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•The Constrained Shortest Path problem is solved using a hybridized version of PSO.•A different equation for the particles’ velocities is used.•A novel expanding neighborhood topology is applied.•A VNS algorithm is applied in order to optimize the particles’ position.•The algorithm is tested in a number of modified instances from the TSPLIB. In this paper, a well known NP-hard problem, the Constrained Shortest Path problem, is studied. As efficient metaheuristic approaches are required for its solution, a new hybridized version of Particle Swarm Optimization algorithm with Variable Neighborhood Search is proposed for solving this significant combinatorial optimization problem. Particle Swarm Optimization (PSO) is a population-based swarm intelligence algorithm that simulates the social behavior of social organisms by using the physical movements of the particles in the swarm. A Variable Neighborhood Search (VNS) algorithm is applied in order to optimize the particles’ position. In the proposed algorithm, the Particle Swarm Optimization with combined Local and Global Expanding Neighborhood Topology (PSOLGENT), a different equation for the velocities of particles is given and a novel expanding neighborhood topology is used. Another issue in the application of the VNS algorithm in the Constrained Shortest Path problem is which local search algorithms are suitable from this problem. In this paper, a number of continuous local search algorithms are used. The algorithm is tested in a number of modified instances from the TSPLIB and comparisons with classic versions of PSO and with other versions of the proposed method are performed. Also, the results of the algorithm are compared with the results of a number of metaheuristic and evolutionary algorithms. The results obtained are very satisfactory and strengthen the efficiency of the algorithm.
ISSN:0377-2217
1872-6860
1872-6860
DOI:10.1016/j.ejor.2017.03.031