AN ALGORITHM FOR GARBAGE TRUCK ROUTING IN CITIES WITH A FIXATION ON CONTAINER FILLING LEVEL

IF 0.5 Q4 TRANSPORTATION SCIENCE & TECHNOLOGY
M. Oliskevych, Victor Danchuk
{"title":"AN ALGORITHM FOR GARBAGE TRUCK ROUTING IN CITIES WITH A FIXATION ON CONTAINER FILLING LEVEL","authors":"M. Oliskevych, Victor Danchuk","doi":"10.20858/tp.2023.18.1.07","DOIUrl":null,"url":null,"abstract":"An algorithm for optimizing the routes of a set of vehicles used for the collection and removal of municipal solid waste in a metropolis is proposed. The algorithm eliminates the problem of applying heuristic methods for multi-agent optimization, which is NP non-deterministic polynomial-time-hard. The application of the algorithm leads to a guaranteed exact solution. Through the application of restrictions on the carrying capacity of vehicles, the size of the input matrix representing the transport network can be reduced to an adequate size. This process uses statistical information about the filling levels of container waste bins. The algorithm is applied to an example of two megacities. The shortest routes are built for different numbers of points (from 12 to 72) on the route. The dependence of the total mileage on the number of involved vehicles is studied.","PeriodicalId":45193,"journal":{"name":"Transport Problems","volume":" ","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transport Problems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20858/tp.2023.18.1.07","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"TRANSPORTATION SCIENCE & TECHNOLOGY","Score":null,"Total":0}
引用次数: 0

Abstract

An algorithm for optimizing the routes of a set of vehicles used for the collection and removal of municipal solid waste in a metropolis is proposed. The algorithm eliminates the problem of applying heuristic methods for multi-agent optimization, which is NP non-deterministic polynomial-time-hard. The application of the algorithm leads to a guaranteed exact solution. Through the application of restrictions on the carrying capacity of vehicles, the size of the input matrix representing the transport network can be reduced to an adequate size. This process uses statistical information about the filling levels of container waste bins. The algorithm is applied to an example of two megacities. The shortest routes are built for different numbers of points (from 12 to 72) on the route. The dependence of the total mileage on the number of involved vehicles is studied.
考虑集装箱装卸量的城市垃圾车路径算法
提出了一种优化大都市城市固体废物收集和清除车辆路线的算法。该算法消除了启发式方法应用于多智能体优化的NP非确定性多项式时间困难问题。该算法的应用导致了有保证的精确解。通过对车辆承载能力的限制,可以将表示交通网络的输入矩阵的大小减小到适当的大小。此过程使用有关容器垃圾箱填充水平的统计信息。该算法应用于两个特大城市的实例。为路线上不同数量的点(从12到72)构建最短路线。研究了总里程与相关车辆数量的相关性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Transport Problems
Transport Problems TRANSPORTATION SCIENCE & TECHNOLOGY-
CiteScore
1.90
自引率
14.30%
发文量
55
审稿时长
48 weeks
期刊介绍: Journal Transport Problems is a peer-reviewed open-access scientific journal, owned by Silesian University of Technology and has more than 10 years of experience. The editorial staff includes mainly employees of the Faculty of Transport. Editorial Board performs the functions of current work related to the publication of the next issues of the journal. The International Programming Council coordinates the long-term editorial policy the journal. The Council consists of leading scientists of the world, who deal with the problems of transport. This Journal is a source of information and research results in the transportation and communications science: transport research, transport technology, transport economics, transport logistics, transport law.
×
引用
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学术官方微信