城市快运车辆路径优化的多目标进化算法

Bingyi Li, L. Tan
{"title":"城市快运车辆路径优化的多目标进化算法","authors":"Bingyi Li, L. Tan","doi":"10.12783/DTCSE/CCNT2020/35401","DOIUrl":null,"url":null,"abstract":"In view of the actual situation of delivering express delivery in the city. Put forward five objectives: the number of vehicles, total distance, maximum working time, early delivery time, delayed delivery time. Also designed three-stage multi-objective genetic algorithm. A large number of solutions were randomly generated in the first stage of the algorithm, and the approximate Pareto front was quickly found from the solution set with the extreme solution and elite strategy, while the local optimization algorithm is used to optimize the extreme solution. The second stage is divided into multi-objective problems according to the importance of the target, and the path of the unified distribution station is optimized by local optimization algorithm to obtain the relative optimal solution. The third stage corrects the obtained solution with mixed neighborhood, which makes the final solution meet the requirements of express delivery, and solves the occasional local optimal solution problem. Experiments show that this algorithm is superior to the two commonly used algorithms in multi-objective express delivery scenarios.","PeriodicalId":11066,"journal":{"name":"DEStech Transactions on Computer Science and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-Objective Evolutionary Algorithm for Path Optimization of Urban Express Vehicles\",\"authors\":\"Bingyi Li, L. Tan\",\"doi\":\"10.12783/DTCSE/CCNT2020/35401\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In view of the actual situation of delivering express delivery in the city. Put forward five objectives: the number of vehicles, total distance, maximum working time, early delivery time, delayed delivery time. Also designed three-stage multi-objective genetic algorithm. A large number of solutions were randomly generated in the first stage of the algorithm, and the approximate Pareto front was quickly found from the solution set with the extreme solution and elite strategy, while the local optimization algorithm is used to optimize the extreme solution. The second stage is divided into multi-objective problems according to the importance of the target, and the path of the unified distribution station is optimized by local optimization algorithm to obtain the relative optimal solution. The third stage corrects the obtained solution with mixed neighborhood, which makes the final solution meet the requirements of express delivery, and solves the occasional local optimal solution problem. Experiments show that this algorithm is superior to the two commonly used algorithms in multi-objective express delivery scenarios.\",\"PeriodicalId\":11066,\"journal\":{\"name\":\"DEStech Transactions on Computer Science and Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DEStech Transactions on Computer Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12783/DTCSE/CCNT2020/35401\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DEStech Transactions on Computer Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12783/DTCSE/CCNT2020/35401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对本市快递投递的实际情况。提出了五个目标:车辆数量、总距离、最大工作时间、提前交货时间、延迟交货时间。设计了三阶段多目标遗传算法。算法第一阶段随机生成大量解,利用极值解和精英策略从解集中快速找到近似Pareto前沿,并采用局部优化算法对极值解进行优化。第二阶段根据目标的重要性划分为多目标问题,采用局部优化算法对统一配电站路径进行优化,得到相对最优解;第三阶段用混合邻域对得到的解进行校正,使最终解满足快递需求,并解决了偶发的局部最优解问题。实验表明,该算法在多目标快递场景下优于常用的两种算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-Objective Evolutionary Algorithm for Path Optimization of Urban Express Vehicles
In view of the actual situation of delivering express delivery in the city. Put forward five objectives: the number of vehicles, total distance, maximum working time, early delivery time, delayed delivery time. Also designed three-stage multi-objective genetic algorithm. A large number of solutions were randomly generated in the first stage of the algorithm, and the approximate Pareto front was quickly found from the solution set with the extreme solution and elite strategy, while the local optimization algorithm is used to optimize the extreme solution. The second stage is divided into multi-objective problems according to the importance of the target, and the path of the unified distribution station is optimized by local optimization algorithm to obtain the relative optimal solution. The third stage corrects the obtained solution with mixed neighborhood, which makes the final solution meet the requirements of express delivery, and solves the occasional local optimal solution problem. Experiments show that this algorithm is superior to the two commonly used algorithms in multi-objective express delivery scenarios.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信