Citation
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
Text
Particle swarm optimization with noising metaheuristics for solving network shortest path problem.pdf Restricted to Repository staff only Download (1MB) |
Official URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?...
Abstract
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.
Item Type: | Book Section |
---|---|
Subjects: | T Technology > T Technology (General) Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science |
Divisions: | Faculty of Engineering and Technology (FET) |
Depositing User: | Ms Suzilawati Abu Samah |
Date Deposited: | 18 Oct 2011 00:56 |
Last Modified: | 21 Dec 2020 07:28 |
URII: | http://shdl.mmu.edu.my/id/eprint/3221 |
Downloads
Downloads per month over past year
Edit (login required) |