Particle swarm optimization with noising metaheuristics for solving network shortest path problem
This paper presents an efficient particle swarm optimization (PSO) based search algorithm for solving the single source shortest path problem (SPP), commonly encountered in graph theory. A particle encoding/decoding scheme has been devised for particle-representation of the SPP parameters. The searc...
| Main Authors: | , , |
|---|---|
| Format: | Book Section |
| Language: | English |
| Published: |
IEEE Xplore
2007
|
| Subjects: | |
| Online Access: | http://shdl.mmu.edu.my/3221/ http://shdl.mmu.edu.my/3221/1/Particle%20swarm%20optimization%20with%20noising%20metaheuristics%20for%20solving%20network%20shortest%20path%20problem.pdf |
| Summary: | This paper presents an efficient particle swarm optimization (PSO) based search algorithm for solving the single source shortest path problem (SPP), commonly encountered in graph theory. A particle encoding/decoding scheme has been devised for particle-representation of the SPP parameters. The search capability of PSO is diversified by hybridizing the PSO with a noising metaheuristics. Numerical computation results on several networks with random topologies illustrate the efficiency of the proposed hybrid PSO-Noising method for computation of shortest paths in networks. |
|---|