Discrete particle swarm optimization for multiple destination routing problems
- Authors
- Zhan, Zhi-Hui; Zhang, Jun
- Issue Date
- Apr-2009
- Publisher
- Springer Verlag
- Keywords
- Multiple destination routing problems; Particle swarm optimization (PSO); Steiner tree problem.
- Citation
- Applications of Evolutionary Computing EvoWorkshops 2009: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG,Tübingen, Germany, April 15-17, 2009, Proceedings, v.5484 , pp 117 - 122
- Pages
- 6
- Indexed
- SCI
SCOPUS
- Journal Title
- Applications of Evolutionary Computing EvoWorkshops 2009: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG,Tübingen, Germany, April 15-17, 2009, Proceedings
- Volume
- 5484
- Start Page
- 117
- End Page
- 122
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/117808
- DOI
- 10.1007/978-3-642-01129-0_15
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.