Study on optimization of vehicle distribution path with time window constraint based on column generation algorithm

Fang Xin, Cao Yi meng, Xu Ying
{"title":"Study on optimization of vehicle distribution path with time window constraint based on column generation algorithm","authors":"Fang Xin, Cao Yi meng, Xu Ying","doi":"10.1109/CTMCD53128.2021.00072","DOIUrl":null,"url":null,"abstract":"Vehicle path problem (VRP) is a famous research direction in optimization research. Its variants Rich-VRP combine multiple constraints to solve practical problems, which is of great significance to the logistics industry. In this paper, 50 and 100 orders are randomly set. A selection column generation algorithm is used to solve the large-scale VRP problem with a hard time window constraint. Meanwhile, 100 customers’ satisfaction with distribution service was summarized by statistical method, and the normal distribution of customer satisfaction was found. Finally, according to the results, the advantages and disadvantages of the column generation algorithm and its application value are analyzed.","PeriodicalId":298084,"journal":{"name":"2021 International Conference on Computer Technology and Media Convergence Design (CTMCD)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computer Technology and Media Convergence Design (CTMCD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CTMCD53128.2021.00072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Vehicle path problem (VRP) is a famous research direction in optimization research. Its variants Rich-VRP combine multiple constraints to solve practical problems, which is of great significance to the logistics industry. In this paper, 50 and 100 orders are randomly set. A selection column generation algorithm is used to solve the large-scale VRP problem with a hard time window constraint. Meanwhile, 100 customers’ satisfaction with distribution service was summarized by statistical method, and the normal distribution of customer satisfaction was found. Finally, according to the results, the advantages and disadvantages of the column generation algorithm and its application value are analyzed.
基于列生成算法的时间窗约束下车辆分配路径优化研究
车辆路径问题(VRP)是优化研究中一个著名的研究方向。其变体Rich-VRP结合多种约束来解决实际问题,对物流业具有重要意义。在本文中,随机设置了50和100个订单。采用一种选择列生成算法来解决具有硬时间窗约束的大规模VRP问题。同时,对100名顾客对配送服务的满意度进行统计,得出顾客满意度的正态分布。最后,根据结果分析了列生成算法的优缺点及其应用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信