A Comparative Study on Crossover Operators of Genetic Algorithm for Traveling Salesman Problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dou,Xin-Ai | - |
dc.contributor.author | Yang,Qiang . | - |
dc.contributor.author | Gao,Xu-Dong | - |
dc.contributor.author | Lu, Zhen-Yu | - |
dc.contributor.author | Zhang,Jun | - |
dc.date.accessioned | 2024-05-02T00:00:45Z | - |
dc.date.available | 2024-05-02T00:00:45Z | - |
dc.date.issued | 2023-05 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/118916 | - |
dc.description.abstract | Genetic algorithm (GA) has been successfully employed to solve the traveling salesman problem (TSP). In GA, the crossover operator makes crucial influence on its optimization effectiveness and efficiency in solving TSP. Therefore, many kinds of crossover operators have been proposed successively in the literature, but a systematic investigation of these operators has not ever been conducted. To fill this gap, this paper systematically compares 10 widely used crossover operators. By conducting extensive experiments on different TSP instances of different sizes, we investigate the optimization effectiveness of the 10 crossover operators in helping GA solve TSP. Experimental results demonstrate that the sequential constructive crossover (SCX) and the zoning crossover (ZX) are the two best crossover operators for GA to solve TSP. Hopefully, this comparative study could provide a guideline for readers and facilitate them to choose a suitable crossover operator for GA to solve TSP effectively. © 2023 IEEE. | - |
dc.format.extent | 8 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | A Comparative Study on Crossover Operators of Genetic Algorithm for Traveling Salesman Problem | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/ICACI58115.2023.10146181 | - |
dc.identifier.scopusid | 2-s2.0-85163375752 | - |
dc.identifier.wosid | 001017834300054 | - |
dc.identifier.bibliographicCitation | 2023 15th International Conference on Advanced Computational Intelligence, ICACI 2023, pp 1 - 8 | - |
dc.citation.title | 2023 15th International Conference on Advanced Computational Intelligence, ICACI 2023 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 8 | - |
dc.type.docType | Conference Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordAuthor | Combinatorial Optimization | - |
dc.subject.keywordAuthor | Crossover Operator | - |
dc.subject.keywordAuthor | Genetic Algorithm | - |
dc.subject.keywordAuthor | Travelling Salesman Problem | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/10146181 | - |
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.