A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems

DOI10.1016/j.ejor.2017.03.031zbMath1403.90642WikidataQ57780886 ScholiaQ57780886MaRDI QIDQ1753628

Yannis Marinakis, Athanasios Migdalas, Angelo Sifaleras

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.031

zbMATH Keywords

variable neighborhood search; particle swarm optimization; constrained shortest path problem; expanding neighborhood topology

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C59: Approximation methods and heuristics in mathematical programming

05C85: Graph algorithms (graph-theoretic aspects)

Uses Software

• Scatter Search
• MCPSO