Tour Multi-Route Planning With Matrix-Based Differential Evolution
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sun, Pei-Fa | - |
dc.contributor.author | Li, Jian-Yu | - |
dc.contributor.author | Li, Ming-Yu | - |
dc.contributor.author | Gao, Zhan-Yang | - |
dc.contributor.author | Jin, Hu | - |
dc.contributor.author | Jeon, Sang-Woon | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2024-05-02T00:00:28Z | - |
dc.date.available | 2024-05-02T00:00:28Z | - |
dc.date.issued | 2024-04 | - |
dc.identifier.issn | 1524-9050 | - |
dc.identifier.issn | 1558-0016 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/118910 | - |
dc.description.abstract | Tourism is an important industry sector that requires tour companies to plan multiple routes for different tour groups, which is called tour multi-route planning. This paper focuses on tour multi-route planning, which can improve the economic benefit and allocation efficiency of tour resources. The main contributions of this paper are threefold. First, we propose a novel multiple routes planning model that captures the real-world tourism scenario and practical constraints. We also define four typical constraints for tourism planning and classify them into soft and hard constraints. Second, we develop a matrix-based differential evolution algorithm to jointly optimize multiple routes that can efficiently handle the high-dimensional optimization under various constraints. Third, we collect real-world data to construct problem instances and compare the performance of our algorithm with the conventional differential evolution algorithms in terms of runtimes. The experimental results show that our algorithm can effectively solve tour multi-route planning problems and achieve excellent runtimes performance, suitable for large-scale transportation network optimization. | - |
dc.format.extent | 15 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers | - |
dc.title | Tour Multi-Route Planning With Matrix-Based Differential Evolution | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TITS.2024.3381344 | - |
dc.identifier.scopusid | 2-s2.0-85189804837 | - |
dc.identifier.wosid | 001201886800001 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Intelligent Transportation Systems, v.25, no.9, pp 1 - 15 | - |
dc.citation.title | IEEE Transactions on Intelligent Transportation Systems | - |
dc.citation.volume | 25 | - |
dc.citation.number | 9 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 15 | - |
dc.type.docType | Article; Early Access | - |
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 | OPTIMIZATION | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordAuthor | Tour multiple routes planning | - |
dc.subject.keywordAuthor | evolutionary computation | - |
dc.subject.keywordAuthor | differential evolution | - |
dc.subject.keywordAuthor | matrix-based evolutionary computation | - |
dc.subject.keywordAuthor | matrix-based differential evolution | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/10492693 | - |
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.