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

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!