Waste Collection Optimisation: A Path to a Green and Sustainable City of Makkah
<i>Background</i>: Saudi Arabia is a leading country endorsing a sustainable future, from policymaking and investment to infrastructure development. One of the rising concerns in Saudi Arabia's Vision 2030 is solid waste management, especially in Makkah. The Solid Waste Collection P...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-08-01
|
| Series: | Logistics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2305-6290/7/3/54 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | <i>Background</i>: Saudi Arabia is a leading country endorsing a sustainable future, from policymaking and investment to infrastructure development. One of the rising concerns in Saudi Arabia's Vision 2030 is solid waste management, especially in Makkah. The Solid Waste Collection Problem (SWCP) refers to the route optimisation of waste collection trucks visiting containers across various locations. Manually generated routes might contain some mistakes, and constructing and revising designed solutions can take a long time. Thus, there is a need to find optimal and fast solutions to this problem. Solving this problem demands tackling numerous routing constraints while aiming to minimise the operational cost. Since solid waste has a significant impact on the environment, reducing fuel consumption must be an objective. <i>Methods</i>: Thus, a mixed-integer programming model is proposed in this paper while using the time-oriented nearest neighbour heuristic. The goal is to investigate their performance on nine existing instances of SWCP in the city of Makkah. The proposed model is implemented in the Gurobi solver. The time-oriented nearest neighbour heuristic constructs the initial solution and is then re-optimised using Google OR-tools. <i>Results</i>: Using the greedy method to construct a solution for this problem generated better solutions when compared to the results obtained without the greedy method. Computational times are also improved by 55.7% on the problem instances. <i>Conclusions</i>: The findings confirm the competitive performance of the proposed method in terms of computational times and solution quality. |
|---|---|
| ISSN: | 2305-6290 |