Optimization of urban freight transportation based on evolutionary modelling

E. Gladchenko, O. Saprykin, A. Tikhonov
{"title":"Optimization of urban freight transportation based on evolutionary modelling","authors":"E. Gladchenko, O. Saprykin, A. Tikhonov","doi":"10.18287/1613-0073-2019-2416-95-103","DOIUrl":null,"url":null,"abstract":"Logistics problems require special attention, because every year they become more complicated and multivariable. On the one hand, a supply chain management includes incessant monitoring of such issues as requests elaboration, paths determination, routing of shipments, multimodal choice, set up of transhipments, fleet choice and maintenance, warehousing, packaging and others. On the other hand, dozens of people are involved in the logistics process. All these moments complicate the decision-making that is why data driven decisions are required nowadays. As well as shipment problems are NP-hard, the heuristic methods should be applied to resolve them. In this article we propose a genetic algorithm to solve the complex problem that consists of the Travelling Salesman Problem combined with the Knapsack Problem. We have developed an urban freight transportation model which is focused on the minimization of the underway time as well as on the maximization of the truck’s loading. A significant contribution in our method is the census of traffic frequency by using traffic zoning. The developed approach has been implemented using the Python programming language in the Zeppelin environment. The first version of the system has been approved in the city of Samara (Russia) with test demand dataset.","PeriodicalId":10486,"journal":{"name":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Collection of selected papers of the III International Conference on Information Technology and Nanotechnology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18287/1613-0073-2019-2416-95-103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Logistics problems require special attention, because every year they become more complicated and multivariable. On the one hand, a supply chain management includes incessant monitoring of such issues as requests elaboration, paths determination, routing of shipments, multimodal choice, set up of transhipments, fleet choice and maintenance, warehousing, packaging and others. On the other hand, dozens of people are involved in the logistics process. All these moments complicate the decision-making that is why data driven decisions are required nowadays. As well as shipment problems are NP-hard, the heuristic methods should be applied to resolve them. In this article we propose a genetic algorithm to solve the complex problem that consists of the Travelling Salesman Problem combined with the Knapsack Problem. We have developed an urban freight transportation model which is focused on the minimization of the underway time as well as on the maximization of the truck’s loading. A significant contribution in our method is the census of traffic frequency by using traffic zoning. The developed approach has been implemented using the Python programming language in the Zeppelin environment. The first version of the system has been approved in the city of Samara (Russia) with test demand dataset.
基于演化模型的城市货运优化
物流问题需要特别关注,因为它们每年都变得更加复杂和多变量。一方面,供应链管理包括不间断的监控,如要求的阐述、路径的确定、运输路线、多式联运的选择、转运的建立、车队的选择和维护、仓储、包装等。另一方面,数十人参与物流过程。所有这些时刻都使决策复杂化,这就是为什么现在需要数据驱动的决策。由于装运问题是np困难的,因此应采用启发式方法来解决这些问题。在本文中,我们提出了一种遗传算法来解决由旅行商问题和背包问题组成的复杂问题。我们开发了一个城市货运模型,该模型的重点是最小化航行时间和最大化卡车装载。该方法的一个重要贡献是使用交通区划对交通频率进行普查。所开发的方法已经在齐柏林飞艇环境中使用Python编程语言实现。该系统的第一个版本已在萨马拉市(俄罗斯)获得批准,并带有测试需求数据集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信