An efficient genetic algorithm for the traveling salesman problem with precedence constraints
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Moon, CChiung | - |
dc.contributor.author | Kim,Jongsoo | - |
dc.contributor.author | Choi, Gyunghyun | - |
dc.contributor.author | Seo, Yoonho | - |
dc.date.accessioned | 2021-06-24T01:02:20Z | - |
dc.date.available | 2021-06-24T01:02:20Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2002-08 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/46798 | - |
dc.description.abstract | The traveling salesman problem with precedence constraints (TSPPC) is one of the most difficult combinatorial optimization problems. In this paper, an efficient genetic algorithm (GA) to solve the TSPPC is presented. The key concept of the proposed GA is a topological sort (TS), which is defined as an ordering of vertices in a directed graph, Also, a new crossover operation is developed for the proposed GA. The results of numerical experiments show that the proposed GA produces an optimal solution and shows superior performance compared to the traditional algorithms. (C) 2002 Elsevier Science B.V. All rights reserved. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | An efficient genetic algorithm for the traveling salesman problem with precedence constraints | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim,Jongsoo | - |
dc.identifier.doi | 10.1016/S0377-2217(01)00227-2 | - |
dc.identifier.scopusid | 2-s2.0-0036680981 | - |
dc.identifier.wosid | 000176022300007 | - |
dc.identifier.bibliographicCitation | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.140, no.3, pp.606 - 617 | - |
dc.relation.isPartOf | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.title | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.volume | 140 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 606 | - |
dc.citation.endPage | 617 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Business & Economics | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Management | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | PICKUP | - |
dc.subject.keywordAuthor | traveling salesman problem with precedence constraints | - |
dc.subject.keywordAuthor | genetic algorithm | - |
dc.subject.keywordAuthor | topological sort | - |
dc.subject.keywordAuthor | optimization | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0377221701002272?via%3Dihub | - |
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.