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 |
| _version_ | 1848790267748941824 |
|---|---|
| author | Mohemmed, Ammar W. Sahoo, Nirod Chandra Tan, Kim Geok |
| author_facet | Mohemmed, Ammar W. Sahoo, Nirod Chandra Tan, Kim Geok |
| author_sort | Mohemmed, Ammar W. |
| building | MMU Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T18:09:54Z |
| format | Book Section |
| id | mmu-3221 |
| institution | Multimedia University |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-14T18:09:54Z |
| publishDate | 2007 |
| publisher | IEEE Xplore |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | mmu-32212020-12-21T07:28:24Z http://shdl.mmu.edu.my/3221/ Particle swarm optimization with noising metaheuristics for solving network shortest path problem Mohemmed, Ammar W. Sahoo, Nirod Chandra Tan, Kim Geok T Technology (General) QA75.5-76.95 Electronic computers. Computer science 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. IEEE Xplore 2007-05 Book Section NonPeerReviewed text en http://shdl.mmu.edu.my/3221/1/Particle%20swarm%20optimization%20with%20noising%20metaheuristics%20for%20solving%20network%20shortest%20path%20problem.pdf Mohemmed, Ammar W. and Sahoo, Nirod Chandra and Tan, Kim Geok (2007) Particle swarm optimization with noising metaheuristics for solving network shortest path problem. In: IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, 2007. ICT-MICC 2007. IEEE Xplore, pp. 354-359. ISBN 978-1-4244-1094-1 http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=4448659 10.1109/ICTMICC.2007.4448659 10.1109/ICTMICC.2007.4448659 10.1109/ICTMICC.2007.4448659 |
| spellingShingle | T Technology (General) QA75.5-76.95 Electronic computers. Computer science Mohemmed, Ammar W. Sahoo, Nirod Chandra Tan, Kim Geok Particle swarm optimization with noising metaheuristics for solving network shortest path problem |
| title | Particle swarm optimization with noising metaheuristics for solving network shortest path problem |
| title_full | Particle swarm optimization with noising metaheuristics for solving network shortest path problem |
| title_fullStr | Particle swarm optimization with noising metaheuristics for solving network shortest path problem |
| title_full_unstemmed | Particle swarm optimization with noising metaheuristics for solving network shortest path problem |
| title_short | Particle swarm optimization with noising metaheuristics for solving network shortest path problem |
| title_sort | particle swarm optimization with noising metaheuristics for solving network shortest path problem |
| topic | T Technology (General) QA75.5-76.95 Electronic computers. Computer science |
| url | http://shdl.mmu.edu.my/3221/ http://shdl.mmu.edu.my/3221/ 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 |