Solving shortest path problem using particle swarm optimization

Citation

Mohemmed, Ammar W. and Sahoo, Nirod Chandra and Geok, Tan Kim (2008) Solving shortest path problem using particle swarm optimization. Applied Soft Computing, 8 (4). pp. 1643-1653. ISSN 15684946

Full text not available from this repository.

Abstract

This paper presents the investigations on the application of particle swarm optimization (PSO) to solve shortest path (SP) routing problems. A modified priority-based encoding incorporating a heuristic operator for reducing the possibility of loop-formation in the path construction process is proposed for particle representation in PSO. Simulation experiments have been carried out on different network topologies for networks consisting of 15-70 nodes. It is noted that the proposed PSO-based approach can find the optimal path with good success rates and also can find closer sub-optimal paths with high certainty for all the tested networks. It is observed that the performance of the proposed algorithm surpasses those of recently reported genetic algorithm based approaches for this problem. (c) 2008 Elsevier B.V. All rights reserved.

Item Type: Article
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: 09 Sep 2011 05:53
Last Modified: 09 Sep 2011 05:53
URII: http://shdl.mmu.edu.my/id/eprint/2271

Downloads

Downloads per month over past year

View ItemEdit (login required)