scholarly journals Heuristics for Waste Collection Arc Routing Problem

MENDEL ◽  
2019 ◽  
Vol 25 (1) ◽  
pp. 15-22
Author(s):  
Vlastimír Nevrlý ◽  
Radovan Šomplák ◽  
Pavel Popela
Keyword(s):  
Arc Routing ◽  
Waste Collection ◽  
Traffic Light ◽  
Exact Methods ◽  
Routing Problem ◽  
Real Practice ◽  
The Mathematical Model ◽  
Route Scheduling ◽  
Municipal Level

Waste management is still an expanding eld which needs to be constantly enhanced so that waste transportation and treatment is as eective as possible. An important part of this process is a waste collection at the municipal level. Decision-making about daily routing for all vehicles from a heterogenous eet substantially in uences the expenses of technical services. The need of route scheduling comes also from the newly separated fractions. Transportation features include the capacity of vehicles, number and type of containers on the route, traffic light delays and many others. The mathematical model that properly describes the real practice of servicing containers has not been published yet. Moreover, routing problemsare generally not solvable by exact methods, so the appropriate heuristic algorithm has been developed. A case study with obtained results is discussed. This solution serves not only to improve the current operational situation, but also to create new route schedules for increasing number of collected commodities. 

An M/M/C/K queueing system in an inventory routing problem considering congestion and response time for post-disaster humanitarian relief: a case study

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mahdieh Masoumi ◽  
Amir Aghsami ◽  
Mohammad Alipour-Vaezi ◽  
Fariborz Jolai ◽  
Behdad Esmailifar
Keyword(s):  
Sensitivity Analyses ◽  
Inventory Routing ◽  
Humanitarian Relief ◽  
Exact Methods ◽  
Routing Problem ◽  
Content Type ◽  
Inventory Routing Problem ◽  
The People ◽  
Proposed Model

PurposeDue to the randomness and unpredictability of many disasters, it is essential to be prepared to face difficult conditions after a disaster to reduce human casualties and meet the needs of the people. After the disaster, one of the most essential measures is to deliver relief supplies to those affected by the disaster. Therefore, this paper aims to assign demand points to the warehouses as well as routing their related relief vehicles after a disaster considering convergence in the border warehouses.Design/methodology/approachThis research proposes a multi-objective, multi-commodity and multi-period queueing-inventory-routing problem in which a queuing system has been applied to reduce the congestion in the borders of the affected zones. To show the validity of the proposed model, a small-size problem has been solved using exact methods. Moreover, to deal with the complexity of the problem, a metaheuristic algorithm has been utilized to solve the large dimensions of the problem. Finally, various sensitivity analyses have been performed to determine the effects of different parameters on the optimal response.FindingsAccording to the results, the proposed model can optimize the objective functions simultaneously, in which decision-makers can determine their priority according to the condition by using the sensitivity analysis results.Originality/valueThe focus of the research is on delivering relief items to the affected people on time and at the lowest cost, in addition to preventing long queues at the entrances to the affected areas.

scholarly journals Using iterated greedy and randomized iterated greedy algorithms to solve urban area waste collection in Riyadh city

2020 ◽  
Vol 8 (1) ◽  
pp. 21
Author(s):  
Abdulwahab Almutairi
Keyword(s):  
Greedy Algorithms ◽  
Real Life ◽  
Study Data ◽  
Waste Collection ◽  
Kingdom Of Saudi Arabia ◽  
Routing Problem ◽  
Riyadh City ◽  
Iterated Greedy ◽  
Case Study Data

This paper addresses the real-life waste collection vehicle routing problem by applying Iterated Greedy (IG) and Randomized Iterated Greedy (RIG) in order to improve the processes. This kind of problem becomes more complex in developing countries in several aspects such as costs and fuel. Nowadays, the waste collection is considered as one of the interesting areas. There are three types of waste: commer-cial, residential and roll-on-roll-off. In this paper, we mainly consider the residential waste collection problem. The problem can be summa-rized as follows: a vehicle has to satisfy the demand at each customer location while satisfying the capacity of the vehicle for reducing the total cost. We report a case study that is related to waste collection in Riyadh, Kingdom of Saudi Arabia. To solve the case study problem, IG and RIG were employed. Experiments have been done on the case study data and show a better performance when compared IG algo-rithm results with RIG algorithm results.  

scholarly journals Waste Collection Vehicle Routing Problem: Literature Review

2015 ◽  
Vol 27 (4) ◽  
pp. 345-358 ◽  
Author(s):  
Hui Han ◽  
Eva Ponce Cueto
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Research Literature ◽  
Arc Routing ◽  
Waste Collection ◽  
Logistics System ◽  
Routing Problems ◽  
Routing Problem ◽  
Node Routing

Waste generation is an issue which has caused wide public concern in modern societies, not only for the quantitative rise of the amount of waste generated, but also for the increasing complexity of some products and components. Waste collection is a highly relevant activity in the reverse logistics system and how to collect waste in an efficient way is an area that needs to be improved. This paper analyzes the major contribution about Waste Collection Vehicle Routing Problem (WCVRP) in literature. Based on a classification of waste collection (residential, commercial and industrial), firstly the key findings for these three types of waste collection are presented. Therefore, according to the model (Node Routing Problems and Arc Routing problems) used to represent WCVRP, different methods and techniques are analyzed in this paper to solve WCVRP. This paper attempts to serve as a roadmap of research literature produced in the field of WCVRP.

scholarly journals Developing an applied algorithm for multi-trip vehicle routing problem with time windows in urban waste collection: A case study

2019 ◽  
Vol 37 (1_suppl) ◽  
pp. 4-13 ◽  
Author(s):  
Erfan Babaee Tirkolaee ◽  
Parvin Abbasian ◽  
Mehdi Soltani ◽  
Seyed Ali Ghaffarian
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Computational Time ◽  
Waste Collection ◽  
Urban Waste ◽  
Routing Problem ◽  
Great Performance ◽  
Hard Problems

This paper studies a multi-trip vehicle routing problem with time windows specifically related to urban waste collection. Urban waste collection is one of the municipal activities with large costs and has many practical difficulties. In other words, waste collection and disposal is a costly task due to high operating expenses (fuel, maintenance, recycling, manpower, etc.) and small improvements in this field can result in tremendous savings on municipal expenditure. In the raised problem, the goal is to minimize total cost including traversing cost, vehicle employment cost, and exit penalty from permissible time windows. In this problem, the waste is deposited at the points indicating the demand nodes, in which each demand shows the volume of generated waste. Considering multiple trips for vehicles and time windows are the most critical features of the problem, so that the priorities of serving some specific places such as hospitals can be observed. Since vehicle routing problems (VRP) belongs to NP-hard problems, an efficient simulated annealing (SA) is proposed to solve the problem. The computational results show that our proposed algorithm has a great performance in a short computational time in comparison with the CPLEX solver. Finally, in order to demonstrate the applicability of the model, a case study is analyzed in Iran, and the optimal policies are presented.

scholarly journals Solving practical waste collection with time windows in an urban area

2020 ◽  
Vol 9 (1) ◽  
pp. 1 ◽  
Author(s):  
Abdulwahab Almutairi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Neighborhood Search ◽  
Large Neighborhood Search ◽  
Optimal Solutions ◽  
Waste Collection ◽  
Routing Problem ◽  
Iterated Greedy

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.  

scholarly journals Design of a computer tool for the optimization of solid waste collection circuits

2020 ◽  
Vol 150 ◽  
pp. 02016
Author(s):  
Nezha Haddoun ◽  
Driss Khomsi
Keyword(s):  
Solid Waste ◽  
Arc Routing ◽  
Waste Collection ◽  
Computer Tool ◽  
Solid Waste Collection ◽  
Routing Problem ◽  
Computer Optimization

The optimization of solid waste collection circuits is one of the applications of the Capacited Arc Routing Problem. This article addresses this topic, summarizes and compares the different research and methods that have been used to solve this famous problem. And concluded with an effective method on which will be based the design of a computer optimization tool.

Sign in / Sign up

Export Citation Format

Share Document