Machine learning algorithms for the problem of optimizing the distribution of parcels in time-dependent networks: the case study

Q2 Engineering Archives of Transport Pub Date : 2022-03-31 DOI:10.5604/01.3001.0015.8269
Z. Tarapata, Wojciech Kulas, R. Antkiewicz
{"title":"Machine learning algorithms for the problem of optimizing the distribution of parcels in time-dependent networks: the case study","authors":"Z. Tarapata, Wojciech Kulas, R. Antkiewicz","doi":"10.5604/01.3001.0015.8269","DOIUrl":null,"url":null,"abstract":"In the paper we present machine learning algorithms for the problem of optimizing the distribution of parcels in sto-chastic time-dependent networks, which have been built as a part of some Distribution Optimization System. The prob-lem solved was a modified VRPTW (Vehicle Routing Problem with Time Windows) with many warehouses, a heteroge-neous fleet, travel times depending on the time of departure (stochastic time-dependent network) and an extensive cost function as an optimization criterion. To solve the problem a modified simulated annealing (SATM) algorithm has been proposed. The paper presents the results of the algorithm learning process: the calibration of input parameters and the study of the impact of parameters on the quality of the solution (calculation time, transport cost function value) de-pending on the type of input data. The idea is to divide the input data into classes according to a proposed classifica-tion rule and to propose several strategies for selecting the optimal set of calibration parameters. These strategies consist in solving some multi-criteria optimization tasks in which four criterion functions are used: the length of the designated routes, the computation time, the number of epochs used in the algorithm, the number of designated routes. The subproblem was building a network model of travel times that is used in constructed SATM algorithm to determine the travel time between recipients, depending on the time of departure from the start location. An attempt has been made to verify the research hypothesis that the time between two points can be estimated with sufficient accuracy depending on their geographical location and the time of departure (without reference to the micro-scale, i.e. the detailed structure of the road network). The research was conducted on two types of data for Warsaw: from transport companies and one of the Internet traffic data providers. Learning the network model of travel times has produced very promising results, which will be described in the paper.\n\n","PeriodicalId":53541,"journal":{"name":"Archives of Transport","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archives of Transport","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5604/01.3001.0015.8269","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 1

Abstract

In the paper we present machine learning algorithms for the problem of optimizing the distribution of parcels in sto-chastic time-dependent networks, which have been built as a part of some Distribution Optimization System. The prob-lem solved was a modified VRPTW (Vehicle Routing Problem with Time Windows) with many warehouses, a heteroge-neous fleet, travel times depending on the time of departure (stochastic time-dependent network) and an extensive cost function as an optimization criterion. To solve the problem a modified simulated annealing (SATM) algorithm has been proposed. The paper presents the results of the algorithm learning process: the calibration of input parameters and the study of the impact of parameters on the quality of the solution (calculation time, transport cost function value) de-pending on the type of input data. The idea is to divide the input data into classes according to a proposed classifica-tion rule and to propose several strategies for selecting the optimal set of calibration parameters. These strategies consist in solving some multi-criteria optimization tasks in which four criterion functions are used: the length of the designated routes, the computation time, the number of epochs used in the algorithm, the number of designated routes. The subproblem was building a network model of travel times that is used in constructed SATM algorithm to determine the travel time between recipients, depending on the time of departure from the start location. An attempt has been made to verify the research hypothesis that the time between two points can be estimated with sufficient accuracy depending on their geographical location and the time of departure (without reference to the micro-scale, i.e. the detailed structure of the road network). The research was conducted on two types of data for Warsaw: from transport companies and one of the Internet traffic data providers. Learning the network model of travel times has produced very promising results, which will be described in the paper.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在时间依赖网络中优化包裹分配问题的机器学习算法:案例研究
在本文中,我们提出了机器学习算法来优化随机时变网络中的包裹分配问题,该网络已被构建为某个分配优化系统的一部分。所解决的问题是一个改进的VRPTW(带时间窗口的车辆路径问题),该问题具有多个仓库,一个异构的车队,行程时间取决于出发时间(随机时间相关网络),并以广泛的成本函数作为优化准则。为了解决这一问题,提出了一种改进的模拟退火(SATM)算法。本文介绍了算法学习过程的结果:输入参数的校准和参数对求解质量的影响(计算时间,运输成本函数值)的研究,这取决于输入数据的类型。其思想是根据提出的分类规则对输入数据进行分类,并提出几种选择最优校准参数集的策略。这些策略包括解决一些多准则优化任务,其中使用了四个准则函数:指定路由的长度、计算时间、算法使用的迭代次数、指定路由的数量。子问题是建立一个旅行时间的网络模型,该模型用于构造的SATM算法,根据从起始位置出发的时间确定接收者之间的旅行时间。试图验证研究假设,即两点之间的时间可以根据其地理位置和出发时间(不参考微观尺度,即路网的详细结构)以足够的精度估计。该研究对华沙的两种数据进行了研究:来自运输公司和一家互联网流量数据提供商。学习旅行时间的网络模型已经产生了非常有希望的结果,这将在本文中描述。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Archives of Transport
Archives of Transport Engineering-Automotive Engineering
CiteScore
2.50
自引率
0.00%
发文量
26
审稿时长
24 weeks
期刊最新文献
Proactive safety assessment of urban through-roads based on GPS data The Multidimensional Threats of Unmanned Aerial Systems: Exploring Biomechanical, Technical, Operational, and Legal Solutions for Ensuring Safety and Security Predicting severe wildlife vehicle crashes (WVCs) on New Hampshire roads using a hybrid generalized additive model Research on port AGV trajectory tracking control based on improved fuzzy sliding mode control Suitable law-based location selection of high-power electric vehicles charging stations on the TEN-T core network for sustainability: a case of Poland
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1