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

Celý popis

Podrobná bibliografie

Vydáno v:	European journal of operational research Ročník 261; číslo 3; s. 819 - 834
Hlavní autoři:	Marinakis, Yannis, Migdalas, Athanasios, Sifaleras, Angelo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 16.09.2017
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!