Discrete particle swarm optimization for multiple destination routing problems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2024-01-20T09:01:48Z | - |
dc.date.available | 2024-01-20T09:01:48Z | - |
dc.date.issued | 2009-04 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/117808 | - |
dc.description.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. | - |
dc.format.extent | 6 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Verlag | - |
dc.title | Discrete particle swarm optimization for multiple destination routing problems | - |
dc.type | Article | - |
dc.publisher.location | 독일 | - |
dc.identifier.doi | 10.1007/978-3-642-01129-0_15 | - |
dc.identifier.scopusid | 2-s2.0-67650685261 | - |
dc.identifier.wosid | 000265786800015 | - |
dc.identifier.bibliographicCitation | 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 | - |
dc.citation.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 | - |
dc.citation.volume | 5484 | - |
dc.citation.startPage | 117 | - |
dc.citation.endPage | 122 | - |
dc.type.docType | Conference paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordAuthor | Multiple destination routing problems | - |
dc.subject.keywordAuthor | Particle swarm optimization (PSO) | - |
dc.subject.keywordAuthor | Steiner tree problem. | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/978-3-642-01129-0_15 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.