带时间窗的多目标车辆路径问题的进化多任务初探

M. Cheng, Yiqiao Cai, Shunkai Fu
{"title":"带时间窗的多目标车辆路径问题的进化多任务初探","authors":"M. Cheng, Yiqiao Cai, Shunkai Fu","doi":"10.1109/ICCIA52886.2021.00058","DOIUrl":null,"url":null,"abstract":"Currently, most researches on multiobjective optimization (MOO) focus on solving only a single problem from the scratch during the search process, without the effective use of valuable knowledge from other related problems. It may lead to inefficient and repeated searches on similar problems. In recent years, with the rapid development of the cloud computing industry, evolutionary multitasking optimization (EMO) has attracted lots of attention and has shown its superior performance in solving multiple related problems simultaneously. Based on these considerations, we propose a novel EMO algorithm to solve multiple multiobjective vehicle routing problems with time windows (MOVRPTW) concurrently by combining the EMO framework with an off-the-shelf multiobjective optimization algorithm. The proposed algorithm is termed MMOVRPTW. In the proposed algorithm, a cooperation mechanism is designed to adaptively switch the search between the knowledge transfer process and the local search process. To evaluate the efficacy of the proposed algorithm, the preliminary study on the multitasking MOVRPTW benchmark problems by pairing the 45 real-world instances is carried out to compare MMOVRPTW with its single-task counterpart. The experimental results have demonstrated the advantages of the proposed algorithm for solving multiple MOVRPTW simultaneously.","PeriodicalId":269269,"journal":{"name":"2021 6th International Conference on Computational Intelligence and Applications (ICCIA)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Preliminary Study of Evolutionary Multitasking for Multiobjective Vehicle Routing Problem With Time Windows\",\"authors\":\"M. Cheng, Yiqiao Cai, Shunkai Fu\",\"doi\":\"10.1109/ICCIA52886.2021.00058\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Currently, most researches on multiobjective optimization (MOO) focus on solving only a single problem from the scratch during the search process, without the effective use of valuable knowledge from other related problems. It may lead to inefficient and repeated searches on similar problems. In recent years, with the rapid development of the cloud computing industry, evolutionary multitasking optimization (EMO) has attracted lots of attention and has shown its superior performance in solving multiple related problems simultaneously. Based on these considerations, we propose a novel EMO algorithm to solve multiple multiobjective vehicle routing problems with time windows (MOVRPTW) concurrently by combining the EMO framework with an off-the-shelf multiobjective optimization algorithm. The proposed algorithm is termed MMOVRPTW. In the proposed algorithm, a cooperation mechanism is designed to adaptively switch the search between the knowledge transfer process and the local search process. To evaluate the efficacy of the proposed algorithm, the preliminary study on the multitasking MOVRPTW benchmark problems by pairing the 45 real-world instances is carried out to compare MMOVRPTW with its single-task counterpart. The experimental results have demonstrated the advantages of the proposed algorithm for solving multiple MOVRPTW simultaneously.\",\"PeriodicalId\":269269,\"journal\":{\"name\":\"2021 6th International Conference on Computational Intelligence and Applications (ICCIA)\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 6th International Conference on Computational Intelligence and Applications (ICCIA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIA52886.2021.00058\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 6th International Conference on Computational Intelligence and Applications (ICCIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIA52886.2021.00058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

目前,多目标优化(MOO)的研究大多集中于在搜索过程中从头开始解决单个问题,而没有有效利用其他相关问题的宝贵知识。它可能导致对类似问题的低效和重复搜索。近年来,随着云计算产业的快速发展,进化多任务优化(EMO)在同时解决多个相关问题方面表现出了优越的性能,受到了广泛的关注。基于这些考虑,我们提出了一种新的EMO算法,将EMO框架与现有的多目标优化算法相结合,同时解决带时间窗的多目标车辆路径问题(MOVRPTW)。该算法被称为MMOVRPTW。该算法设计了一种协作机制,在知识转移过程和局部搜索过程之间自适应切换搜索。为了评估该算法的有效性,通过配对45个实际实例,对多任务的MOVRPTW基准问题进行了初步研究,将MMOVRPTW与单任务的MMOVRPTW进行了比较。实验结果证明了该算法在同时求解多个MOVRPTW时的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Preliminary Study of Evolutionary Multitasking for Multiobjective Vehicle Routing Problem With Time Windows
Currently, most researches on multiobjective optimization (MOO) focus on solving only a single problem from the scratch during the search process, without the effective use of valuable knowledge from other related problems. It may lead to inefficient and repeated searches on similar problems. In recent years, with the rapid development of the cloud computing industry, evolutionary multitasking optimization (EMO) has attracted lots of attention and has shown its superior performance in solving multiple related problems simultaneously. Based on these considerations, we propose a novel EMO algorithm to solve multiple multiobjective vehicle routing problems with time windows (MOVRPTW) concurrently by combining the EMO framework with an off-the-shelf multiobjective optimization algorithm. The proposed algorithm is termed MMOVRPTW. In the proposed algorithm, a cooperation mechanism is designed to adaptively switch the search between the knowledge transfer process and the local search process. To evaluate the efficacy of the proposed algorithm, the preliminary study on the multitasking MOVRPTW benchmark problems by pairing the 45 real-world instances is carried out to compare MMOVRPTW with its single-task counterpart. The experimental results have demonstrated the advantages of the proposed algorithm for solving multiple MOVRPTW simultaneously.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信