面向解评价的多目标差分进化算法

Ying Hou, Yilin Wu, Hong-gui Han
{"title":"面向解评价的多目标差分进化算法","authors":"Ying Hou, Yilin Wu, Hong-gui Han","doi":"10.1109/ICCSS53909.2021.9721956","DOIUrl":null,"url":null,"abstract":"Multi-objective vehicle routing problem with time windows (MOVRPTW) is a canonical logistics problem widely existing in supply chain. It is challenging to obtain the feasible solutions with fast convergence and well diversity due to the constraint of time windows. To address this issue, a solution evaluation-oriented multi-objective differential evolution (SE-MODE) algorithm is presented in this paper. First, a solution evaluation mechanism based on constraint dominance principle is developed to evaluate the dominance degree of feasible solutions and infeasible solutions quantitatively. Second, infeasible solutions with less dominance degree are utilized to generate solutions in the early stage of evolution adopting a memetic algorithm framework. Third, a feasible solution-oriented differential mutation strategy is developed to increase the probability of generating feasible solutions and improve the convergence of the population. Finally, the proposed SE-MODE algorithm is evaluated on the RC instances from Solomon, experimental results show that SE-MODE algorithm is promising in solving MOVRPTW.","PeriodicalId":435816,"journal":{"name":"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solution Evaluation-Oriented Multi-objective Differential Evolution Algorithm for MOVRPTW\",\"authors\":\"Ying Hou, Yilin Wu, Hong-gui Han\",\"doi\":\"10.1109/ICCSS53909.2021.9721956\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi-objective vehicle routing problem with time windows (MOVRPTW) is a canonical logistics problem widely existing in supply chain. It is challenging to obtain the feasible solutions with fast convergence and well diversity due to the constraint of time windows. To address this issue, a solution evaluation-oriented multi-objective differential evolution (SE-MODE) algorithm is presented in this paper. First, a solution evaluation mechanism based on constraint dominance principle is developed to evaluate the dominance degree of feasible solutions and infeasible solutions quantitatively. Second, infeasible solutions with less dominance degree are utilized to generate solutions in the early stage of evolution adopting a memetic algorithm framework. Third, a feasible solution-oriented differential mutation strategy is developed to increase the probability of generating feasible solutions and improve the convergence of the population. Finally, the proposed SE-MODE algorithm is evaluated on the RC instances from Solomon, experimental results show that SE-MODE algorithm is promising in solving MOVRPTW.\",\"PeriodicalId\":435816,\"journal\":{\"name\":\"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)\",\"volume\":\"127 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSS53909.2021.9721956\",\"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 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSS53909.2021.9721956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

带时间窗的多目标车辆路径问题(MOVRPTW)是供应链中广泛存在的典型物流问题。由于时间窗的限制,很难得到收敛速度快、多样性好的可行解。为了解决这一问题,本文提出了一种基于解评估的多目标差分进化算法。首先,建立了基于约束优势原则的方案评价机制,定量评价可行方案和不可行方案的优势程度;其次,采用模因算法框架,利用优势度较小的不可行解生成进化早期的解。第三,提出了一种以可行解为导向的差分突变策略,提高了产生可行解的概率,提高了种群的收敛性。最后,在Solomon的RC实例上对SE-MODE算法进行了评价,实验结果表明SE-MODE算法在解决MOVRPTW问题上是有希望的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Solution Evaluation-Oriented Multi-objective Differential Evolution Algorithm for MOVRPTW
Multi-objective vehicle routing problem with time windows (MOVRPTW) is a canonical logistics problem widely existing in supply chain. It is challenging to obtain the feasible solutions with fast convergence and well diversity due to the constraint of time windows. To address this issue, a solution evaluation-oriented multi-objective differential evolution (SE-MODE) algorithm is presented in this paper. First, a solution evaluation mechanism based on constraint dominance principle is developed to evaluate the dominance degree of feasible solutions and infeasible solutions quantitatively. Second, infeasible solutions with less dominance degree are utilized to generate solutions in the early stage of evolution adopting a memetic algorithm framework. Third, a feasible solution-oriented differential mutation strategy is developed to increase the probability of generating feasible solutions and improve the convergence of the population. Finally, the proposed SE-MODE algorithm is evaluated on the RC instances from Solomon, experimental results show that SE-MODE algorithm is promising in solving MOVRPTW.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信