A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
type: Item
instance of: scholarly article
title: A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
zbMATH Open document ID: 1403.90642
author: Yannis Marinakis
author: Athanasios Migdalas
author: Angelo Sifaleras
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6875904
zbMATH Keywords: particle swarm optimization
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: expanding neighborhood topology
zbMATH Keywords: constrained shortest path problem
Wikidata QID: Q57780886
describes a project that uses: MCPSO
describes a project that uses: Scatter Search
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.03.031
OpenAlex ID: W2594963174
cites work: A penalty function heuristic for the resource constrained shortest path problem
cites work: A review of particle swarm optimization. I: Background and development
cites work: A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
cites work: An algorithm for the resource constrained shortest path problem
cites work: Locating multiple optima using particle swarm optimization
cites work: Lagrangian relaxation and enumeration for solving constrained shortest-path problems
cites work: Particle Swarm Optimization
cites work: Nature inspired cooperative strategies for optimization (NICSO 2007). Selected papers based on the presentations at the 2nd workshop, Acireale, Italy, November 8--10, 2007.
cites work: Discrete particle swarm optimization for the minimum labelling Steiner tree problem
cites work: A note on two problems in connexion with graphs
cites work: Q5480099
cites work: Greedy randomized adaptive search procedures
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Scatter Search and Path Relinking: Advances and Applications
cites work: Q4692508
cites work: Variable neighborhood search: Principles and applications
cites work: Variable neighbourhood search: methods and applications
cites work: Particle swarm optimization with age-group topology for multimodal functions and data clustering
cites work: The shortest route problem with constraints
cites work: Optimization by Simulated Annealing
cites work: On an exact method for the constrained shortest path problem
cites work: A particle swarm optimization algorithm with path relinking for the location routing problem
cites work: A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
cites work: Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
cites work: MCPSO: a multi-swarm cooperative particle swarm optimizer
cites work: Recent approaches to global optimization problems through particle Swarm optimization
cites work: Differential evolution. A practical approach to global optimization. With CD-ROM.
cites work: Minimum cost network flows: Problems, algorithms, and software
cites work: Constrained shortest link-disjoint paths selection: a network programming based approach
DOI: 10.1016/J.EJOR.2017.03.031
description: scientific article; zbMATH DE number 6875904