Enhanced Vehicle Routing Problem with Time Windows a Real Case of Solid Waste Collection in Tafo Pankrono, Kumasi, Ghana

2016 ◽  
Vol 29 (2) ◽  
pp. 87-95
Author(s):  
D Otoo ◽  
◽  
S. K. Amponsah ◽  
J. D Ankamah
Keyword(s):  
Solid Waste ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Real Case ◽  
Waste Collection ◽  
Solid Waste Collection ◽  
Routing Problem

A bi-objective vehicle routing problem with time windows: A real case in Tenerife

2014 ◽  
Vol 17 ◽  
pp. 140-152 ◽  
Author(s):  
Belén Melián-Batista ◽  
Alondra De Santiago ◽  
Francisco AngelBello ◽  
Ada Alvarez
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Real Case ◽  
Routing Problem

scholarly journals Vehicle-Routing Optimization for Municipal Solid Waste Collection Using Genetic Algorithm: The Case of Southern Nablus City

2017 ◽  
Vol 26 (3) ◽  
pp. 43-57 ◽  
Author(s):  
Ramiz Assaf ◽  
Yahya Saleh
Keyword(s):  
Genetic Algorithm ◽  
Solid Waste ◽  
Vehicle Routing ◽  
Service Level ◽  
Current Situation ◽  
Waste Collection ◽  
Solid Waste Collection ◽  
Routing Problem ◽  
Routing Optimization ◽  
Vehicle Routing Optimization

Abstract Municipalities are responsible for solid waste collectiont for environmental, social and economic purposes. Practices of municipalities should be effective and efficient, with the objectives of reducing the total incurred costs in the solid waste collection network concurrently achieving the highest service level. This study aims at finding the best routes of solid waste collection network in Nablus city-Palestine. More specifically, the study seeks the optimal route that minimizes the total travelled distance by the trucks and hence the resulted costs. The current situation is evaluated and the problem is modelled as a Vehicle Routing Problem (VRP). The VRP is then optimized via a genetic algorithm. Specifically, compared to the current situation, the trucks total travelled distance was reduced by 66%, whereas the collection time was reduced from 7 hours per truck-trip to 2.3 hours. The findings of this study is useful for all municipality policy makers that are responsible for solid waste collection.

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.

Sign in / Sign up

Export Citation Format

Share Document