Cart (Loading....) | Create Account
Close category search window
 

Particle swarm optimization with noising metaheuristics for solving network shortest path 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 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.

Published in:

Telecommunications and Malaysia International Conference on Communications, 2007. ICT-MICC 2007. IEEE International Conference on

Date of Conference:

14-17 May 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.