Discrete Particle Swarm Optimization for Multiple Destination Routing Problems

Authors:
Zhi-Hui Zhan;Jun Zhang
Affiliations:
Department of Computer Science, Sun Yat-sen university, China 510275;Department of Computer Science, Sun Yat-sen university, China 510275
Venue:
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Year:
2009

Citing 4
Cited 3

Algorithm 97: Shortest path

Communications of the ACM
Population structure and particle swarm performance

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Population structure and particle swarm performance

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
A genetic algorithm for the multiple destination routing problems

IEEE Transactions on Evolutionary Computation

Two-stage EDA-based approach for all optical WDM mesh network survivability under SRLG constraints

Applied Soft Computing
Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm

International Journal of Bio-Inspired Computation
Multi-robot navigation based QoS routing in self-organizing networks

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the traditional heuristics (e.g., the SPH, DNH and ADH) are inefficient in solving it. The particle swarm optimization (PSO) is an efficient global search algorithm and is promising in dealing with complex problems. This paper extends the PSO to a discrete PSO and uses the DPSO to solve the MDR problem. The global search ability and fast convergence ability of the DPSO make it efficient to the problem. Experiments based on the benchmarks from the OR-library show that the DPSO obtains better results when compared with traditional heuristic algorithms, and also outperforms the GA-based algorithm with faster convergence speed.