Particle Swarm Optimization Combined with Local Search and Velocity Re-Initialization for Shortest Path Computation in Networks

Author

Mohemmed, Ammar W. ; Sahoo, Nirod Chandra

Author_Institution

Fac. of Eng. & Technol., Multimedia Univ., Melaka

fYear

2007

fDate

1-5 April 2007

Firstpage

266

Lastpage

272

Abstract

This paper presents the application of particle swarm optimization (PSO) based search algorithm for solving the single source shortest path problem (SPP) commonly encountered in graph theory. A new particle encoding/decoding scheme has been devised for representing the SPP parameters as a particle. In order to enhance the search capability of PSO, a selective local search mechanism and periodic velocity re-initialization of particles have been incorporated. Simulation results on several networks with random topologies are used to illustrate the efficiency of the proposed hybrid PSO algorithm for computation of shortest paths in networks

Keywords

graph theory; network theory (graphs); particle swarm optimisation; search problems; graph theory; networks; particle decoding; particle encoding; particle swarm optimization; random topologies; search algorithm; shortest path computation; velocity reinitialization; Computer networks; Costs; Decoding; Graph theory; Heuristic algorithms; Joining processes; Network topology; Particle swarm optimization; Sequences; Shortest path problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Swarm Intelligence Symposium, 2007. SIS 2007. IEEE

Conference_Location

Honolulu, HI

Print_ISBN

1-4244-0708-7

Type

conf

DOI

10.1109/SIS.2007.367947

Filename

4223184