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: | Ammar W. Mohemmed, Nirod Chandra Sahoo |
---|---|
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!
|
Similar Items
-
Optimization of data allocation in hierarchical memory for blocked shortest paths algorithms
by: A. A. Prihozhy
Published: (2021-10-01) -
Algorithms for Searching the Shortest Path and Its Modification
by: N. I. Listopad, et al.
Published: (2016-06-01) -
Shortest-Path Optimization of Ship Diesel Engine Disassembly and Assembly Based on AND/OR Network
by: Deng-Zhi Chen, et al.
Published: (2020-01-01) -
Unveiling the Potential of Metaheuristics in Transportation: A Path Towards Efficiency, Optimization, and Intelligent Management
by: Álvaro Bueno-Ferrer, et al.
Published: (2024-12-01) -
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
by: Xiaoge Zhang, et al.
Published: (2014-01-01)