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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 261; H. 3; S. 819 - 834
Hauptverfasser:	Marinakis, Yannis, Migdalas, Athanasios, Sifaleras, Angelo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.09.2017
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!