Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics

DOI10.1155/2007/27383zbMath1181.90051OpenAlexW2071193060MaRDI QIDQ2478380

Nirod Chandra Sahoo, Ammar W. Mohemmed

Publication date: 28 March 2008

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/116987

zbMATH Keywords

simulation resultshybrid algorithmencoding/decoding scheme

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (2)

Hybrid co-evolutionary particle swarm optimization and noising metaheuristics for the delay constrained least cost path problem ⋮ Cooperative bacterial for aging optimization

Cites Work

• The noising method: A new method for combinatorial optimization
• Greedy randomized adaptive search procedures
• A hybrid optimization technique coupling an evolutionary and a local search algorithm
• Shortest Path Algorithms: An Evaluation Using Real Road Networks
• Shortest-path algorithms: Taxonomy and annotation
• The noising methods: A generalization of some metaheuristics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics