考虑集装箱装卸量的城市垃圾车路径算法

IF 0.5 Q4 TRANSPORTATION SCIENCE & TECHNOLOGY

Transport Problems Pub Date : 2023-03-01 DOI:10.20858/tp.2023.18.1.07

M. Oliskevych, Victor Danchuk

{"title":"考虑集装箱装卸量的城市垃圾车路径算法","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":"{\"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}","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

摘要

提出了一种优化大都市城市固体废物收集和清除车辆路线的算法。该算法消除了启发式方法应用于多智能体优化的NP非确定性多项式时间困难问题。该算法的应用导致了有保证的精确解。通过对车辆承载能力的限制，可以将表示交通网络的输入矩阵的大小减小到适当的大小。此过程使用有关容器垃圾箱填充水平的统计信息。该算法应用于两个特大城市的实例。为路线上不同数量的点（从12到72）构建最短路线。研究了总里程与相关车辆数量的相关性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Transport Problems TRANSPORTATION SCIENCE & TECHNOLOGY-

CiteScore

1.90

自引率

14.30%

发文量

审稿时长

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.