Automatic Planning of Multiple Itineraries: A Niching Genetic Evolution Approach
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Huang, Ting | - |
dc.contributor.author | Gong, Yue-Jiao | - |
dc.contributor.author | Zhang, Yu-Hui | - |
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | ZHANG, Jun | - |
dc.date.accessioned | 2023-11-14T01:30:51Z | - |
dc.date.available | 2023-11-14T01:30:51Z | - |
dc.date.issued | 2020-10 | - |
dc.identifier.issn | 1524-9050 | - |
dc.identifier.issn | 1558-0016 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115410 | - |
dc.description.abstract | Automatic itinerary planning is a crucial and challenging issue in tourism. This paper proposes a novel automatic planning method to suggest multiple itineraries that satisfy the specific demands of tourists. First, a multiple-itinerary planning model is developed, which provides three customized goals for a tourist to choose and supports generating multiple $D$-day trips. The model makes fewer assumptions than the literature works did, while it provides more flexibility to the tourists. Then, based on the multiple-itinerary planning model, we design a niching genetic evolution approach to accomplish the automatic itinerary planning task. The genetic evolution approach guarantees a high search efficiency, while the niching strategy facilitates maintaining the population diversity. Consequently, the resultant algorithm can finally provide a number of diverse and superior solutions. Experimental results on real-world datasets show that our proposed algorithm not only outperforms state-of-the-art methods in considering different user-specified goals, but it is also capable of generating a set of diverse itineraries for the tourist to select. Additional experiments further verify the scalability of the proposed algorithm in terms of the problem size and the optimization objective. © 2000-2011 IEEE. | - |
dc.format.extent | 16 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.title | Automatic Planning of Multiple Itineraries: A Niching Genetic Evolution Approach | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TITS.2019.2939224 | - |
dc.identifier.scopusid | 2-s2.0-85092591591 | - |
dc.identifier.wosid | 000576271400016 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Intelligent Transportation Systems, v.21, no.10, pp 4225 - 4240 | - |
dc.citation.title | IEEE Transactions on Intelligent Transportation Systems | - |
dc.citation.volume | 21 | - |
dc.citation.number | 10 | - |
dc.citation.startPage | 4225 | - |
dc.citation.endPage | 4240 | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Transportation | - |
dc.relation.journalWebOfScienceCategory | Engineering, Civil | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Transportation Science & Technology | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | SYSTEM | - |
dc.subject.keywordPlus | TRANSPORTATION | - |
dc.subject.keywordPlus | ROUTE | - |
dc.subject.keywordAuthor | D-day itinerary | - |
dc.subject.keywordAuthor | genetic algorithm | - |
dc.subject.keywordAuthor | itinerary planning | - |
dc.subject.keywordAuthor | multiple itineraries | - |
dc.subject.keywordAuthor | niching strategy | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/8842624?arnumber=8842624&SID=EBSCO:edseee | - |
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.