A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
DOI10.1016/J.EJOR.2017.03.031zbMATH Open1403.90642OpenAlexW2594963174WikidataQ57780886 ScholiaQ57780886MaRDI QIDQ1753628FDOQ1753628
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
particle swarm optimizationvariable neighborhood searchconstrained shortest path problemexpanding neighborhood topology
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- MCPSO: a multi-swarm cooperative particle swarm optimizer
- Optimization by Simulated Annealing
- A note on two problems in connexion with graphs
- Tabu Search—Part I
- Particle Swarm Optimization
- A particle swarm optimization algorithm with path relinking for the location routing problem
- Variable neighborhood search: Principles and applications
- Differential evolution. A practical approach to global optimization. With CD-ROM.
- Variable neighbourhood search: methods and applications
- Greedy randomized adaptive search procedures
- Tabu Search—Part II
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- A penalty function heuristic for the resource constrained shortest path problem
- The shortest route problem with constraints
- On an exact method for the constrained shortest path problem
- An algorithm for the resource constrained shortest path problem
- A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
- Recent approaches to global optimization problems through particle Swarm optimization
- Locating multiple optima using particle swarm optimization
- A review of particle swarm optimization. I: Background and development
- Scatter Search and Path Relinking: Advances and Applications
- Minimum cost network flows: Problems, algorithms, and software
- Constrained shortest link-disjoint paths selection: a network programming based approach
- A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem
- Particle swarm optimization with age-group topology for multimodal functions and data clustering
- 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
- Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
Cited In (10)
- Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
- Algorithms for the minmax regret path problem with interval data
- An efficient exact approach for the constrained shortest path tour problem
- An exact reduction technique for the k-colour shortest path problem
- Stochastic stability analysis of particle swarm optimization with pseudo random number assignment strategy
- A hybridization approach with predicted solution candidates for improving population-based optimization algorithms
- Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields
- A decision method on yard cranes transformation and deployment in green ports
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- Route optimization in township logistics distribution considering customer satisfaction based on adaptive genetic algorithm
Uses Software
This page was built for publication: A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753628)
