文章基本信息

标题：Solving practical waste collection with time windows in an urban area
本地全文：下载
作者：Abdulwahab Almutairi
期刊名称：International Journal of Advanced Statistics and Probability
电子版ISSN：2307-9045
出版年度：2021
卷号：9
期号：1
页码：1-5
DOI：10.14419/ijasp.v9i1.31188
语种：English
出版社：Journal of Advanced Computer Science & Technology
摘要：In logistics, several algorithms can be implemented in order to solve the problems of the vehicle routing with variants in order to find near-optimal solutions. Waste Collection can be considered as an essential logistic activity within any area or city. This kind of paper is aimed to implement Iterated greedy (IG) and Adaptive Large Neighborhood Search (ALNS) to solve waste collection vehicle routing problem with time windows on a real-case study. The idea is to generate an efficient way to collect waste problems in an area located in Riyadh, Saudi Arabia. Moreover, generating a route plays a significant role in terms of serving all customers’ demands who have own different time windows of receiving goods. Also, the performance of the proposed algorithms according to all instances is examined and minimizing the total costs and meeting all constraints that related to capacity, time windows, and others. To evaluate the execution of the presented algorithms, the computational results showed essential improvements, and also ALNS algorithm generates reasonable solutions in terms of total costs and a reasonable amount of time, when compared to other algorithms.
关键词：ALNS;Iterated Greedy;Time Window;Waste Collection