Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem
From MaRDI portal
Publication:1959183
DOI10.1007/S10732-009-9109-3zbMath1202.90265OpenAlexW2130775539MaRDI QIDQ1959183
Ammar W. Mohemmed, Tan Kim Geok, Nirod Chandra Sahoo
Publication date: 6 October 2010
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-009-9109-3
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks ⋮ Unnamed Item ⋮ A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- The noising method: A new method for combinatorial optimization
- Search space reduction in QoS routing.
- Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
- Algorithms for finding paths with multiple constraints
- An algorithm for the resource constrained shortest path problem
- A dual algorithm for the constrained shortest path problem
- Heuristic Methods for Delay Constrained Least Cost Routing Using<tex>$k$</tex>-Shortest-Paths
- The noising methods: A generalization of some metaheuristics
This page was built for publication: Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem