Efficient Computation of Shortest Paths in Networks Using Particle Swarm Optimization and Noising Metaheuristics
This paper presents a novel hybrid algorithm based on particle swarm optimization (PSO) and noising metaheuristics for solving the single-source shortest-path problem (SPP) commonly encountered in graph theory. This hybrid search process combines PSO for iteratively finding a population of...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2007-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2007/27383 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|