By Topic

A new particle swarm optimization based algorithm for solving shortest-paths tree problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mohemmed, A.W. ; Multimedia Univ., Melaka ; Sahoo, N.C. ; Tan Kim Geok

This paper presents an efficient particle swarm optimization (PSO) based search algorithm for solving the single source all destination shortest paths or what is called the shortest-paths tree (SPT), commonly encountered in graph theory. A new particle encoding/decoding scheme has been devised for particle-representation of the SPT parameters. This encoding/decoding exploits the sub-optimality feature of the shortest path. In the proposed algorithm, the solution, the shortest path tree, is not represented by one particle, but it is the solution that is contributed by the complete swarm population. Numerical computation results on several networks with random topologies illustrate the efficiency of the proposed PSO method for computation of shortest paths in networks.

Published in:

Evolutionary Computation, 2007. CEC 2007. IEEE Congress on

Date of Conference:

25-28 Sept. 2007