Solving the multi-trip vehicle routing problem with time windows in urban waste management using grey wolf optimization algorithm
One of the most important issues of concern to human societies in recent years is urban waste management that is one of the main requirements of each city, and without any notice of it, it can be problematic for it and even residents of the surrounding villages. Urban areas generate the highest amou...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Semnan University
2019-06-01
|
| Series: | مجله مدل سازی در مهندسی |
| Subjects: | |
| Online Access: | https://modelling.semnan.ac.ir/article_3912_c58c5b906f83788323230503d2009de4.pdf |
| Summary: | One of the most important issues of concern to human societies in recent years is urban waste management that is one of the main requirements of each city, and without any notice of it, it can be problematic for it and even residents of the surrounding villages. Urban areas generate the highest amount of waste and consequently, they need an efficient system for collecting and disposing of waste where its determination and stabilization is very difficult and costly. In this regard, this paper examines the multi-trip vehicle routing problem with time windows specific to the urban waste collection, with the goal is to minimize the total cost including routing costs, the earliness and lateness penalty cost for violating the service time windows and the usage costs of vehicles. To solve the problem in practical dimensions, grey wolf optimization (GWO) algorithm is developed where its performance is tested compared to CPLEX solver of GAMS and simulated annealing (SA) algorithm. The obtained results demonstrate that the proposed GWO have an acceptable performance to generate high-quality solutions. Finally, to study the behavior of the objective function versus the real-world demand parameter changes, a sensitivity analysis is performed on this parameter and the optimal management policy is analyzed.ed. |
|---|---|
| ISSN: | 2008-4854 2783-2538 |