Fragment-Based Knowledge Transfer for Multi-Task Capacitated Vehicle Routing
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Xiao-Fang | - |
dc.contributor.author | Dai, Yang-Tao | - |
dc.contributor.author | Fang, Yongchun | - |
dc.contributor.author | Yu, Xue | - |
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2025-05-26T02:00:20Z | - |
dc.date.available | 2025-05-26T02:00:20Z | - |
dc.date.issued | 2025-05 | - |
dc.identifier.issn | 1524-9050 | - |
dc.identifier.issn | 1558-0016 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/125336 | - |
dc.description.abstract | In a capacitated vehicle routing problem (CVRP), multiple vehicles are planned to travel for serving customers so as to reduce transportation costs in logistics. Taking each CVRP as a task, multiple CVRPs can form a multi-task optimization problem. Based on the similarity between tasks, knowledge transfer methods are developed to improve optimization performance by utilizing the search experience of related tasks. However, existing methods tend to use one task only for knowledge transfer. Indeed, in a target task, the different parts of customer distributions are similar to that of multiple related tasks. The information of multiple source tasks can be fused to assist the optimization of target tasks. Thus, this paper proposes a genetic algorithm with fragment-based knowledge transfer (FKT-GA), which fuses route fragments from multiple related tasks to assist the optimization of target tasks. In FKT-GA, multiple source tasks are selected for each target task based on distribution features that are invariant to rotation, shift, and scaling. Solutions of source tasks are aligned to target spaces for sampling route fragments, which are integrated to construct high-quality solutions for target tasks. In addition, mutation and crossover operators are developed to enhance solution diversity. Experimental results on fifteen 6-task instances show that FKT-GA outperforms state-of-the-art algorithms in terms of solution optimality. The proposed FKT can improve algorithm performance. © 2000-2011 IEEE. | - |
dc.format.extent | 15 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Fragment-Based Knowledge Transfer for Multi-Task Capacitated Vehicle Routing | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TITS.2025.3563961 | - |
dc.identifier.scopusid | 2-s2.0-105004601201 | - |
dc.identifier.wosid | 001484772600001 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Intelligent Transportation Systems, pp 1 - 15 | - |
dc.citation.title | IEEE Transactions on Intelligent Transportation Systems | - |
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 | SEARCH | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | PRICE | - |
dc.subject.keywordAuthor | Capacitated vehicle routing problem | - |
dc.subject.keywordAuthor | evolutionary computation | - |
dc.subject.keywordAuthor | knowledge fragment | - |
dc.subject.keywordAuthor | knowledge transfer | - |
dc.subject.keywordAuthor | multi-task optimization | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/10988723 | - |
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.