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

DOI10.1016/J.EJOR.2017.03.031zbMath1403.90642OpenAlexW2594963174WikidataQ57780886 ScholiaQ57780886MaRDI QIDQ1753628

Yannis Marinakis, Angelo Sifaleras, Athanasios Migdalas

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 searchparticle swarm optimizationconstrained shortest path problemexpanding neighborhood topology

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields ⋮ A hybridization approach with predicted solution candidates for improving population-based optimization algorithms ⋮ A decision method on yard cranes transformation and deployment in green ports ⋮ Algorithms for the minmax regret path problem with interval data ⋮ The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ An efficient exact approach for the constrained shortest path tour problem ⋮ Route optimization in township logistics distribution considering customer satisfaction based on adaptive genetic algorithm ⋮ Stochastic stability analysis of particle swarm optimization with pseudo random number assignment strategy ⋮ An exact reduction technique for the k-colour shortest path problem

Uses Software

• Scatter Search
• MCPSO

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Optimization by Simulated Annealing
• On an exact method for the constrained shortest path problem
• Recent approaches to global optimization problems through particle Swarm optimization
• Differential evolution. A practical approach to global optimization. With CD-ROM.
• MCPSO: a multi-swarm cooperative particle swarm optimizer
• Particle swarm optimization with age-group topology for multimodal functions and data clustering
• A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
• Nature inspired cooperative strategies for optimization (NICSO 2007). Selected papers based on the presentations at the 2nd workshop, Acireale, Italy, November 8--10, 2007.
• Discrete particle swarm optimization for the minimum labelling Steiner tree problem
• Variable neighbourhood search: methods and applications
• A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
• Greedy randomized adaptive search procedures
• A penalty function heuristic for the resource constrained shortest path problem
• Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
• Locating multiple optima using particle swarm optimization
• A review of particle swarm optimization. I: Background and development
• A particle swarm optimization algorithm with path relinking for the location routing problem
• The shortest route problem with constraints
• Particle Swarm Optimization
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems
• An algorithm for the resource constrained shortest path problem
• Tabu Search—Part I
• Tabu Search—Part II
• Scatter Search and Path Relinking: Advances and Applications
• Constrained shortest link-disjoint paths selection: a network programming based approach
• Minimum cost network flows: Problems, algorithms, and software
• Variable neighborhood search: Principles and applications

This page was built for publication: A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems