The project aims to reduce the total distance travelled by the fleet of vehicles for collection of municipal solid waste by planning new collection routes using Vehicle Routing Problem Solver (part of Network Analyst extension) in ArcGIS.
Route optimization for collection of municipal solid waste in Katpadi, Vellore
1. ROUTE OPTIMIZATION FOR COLLECTION
OF MUNICIPAL SOLID WASTE
CASE EXAMPLE : KATPADI
GUIDE:- DR. AMIT MAHINDRAKAR
MATALIA YASH YOGESHBHAI 13BCL0035
HARSHIT VIKRAM SHAHI 13BCL0025
MANU SHARMA 13BCL0254
2. INTRODUCTION
• Katpadi is located in Vellore district 140 kilometres west of
Chennai in Tamil Nadu.
• The area is divided into 15 wards for ease of administration.
• The sanitation fleet consists of 9 vehicles, serving 29,280
customers six days a week.
• Studies have shown up to 75% of a sanitation department’s
budget goes directly to solid waste collection and transport. This
is clearly an area for studies to evaluate for cost saving measures.
• Hence, this project tries to reduce the distance travelled by the
fleet which would reflect as cost savings in fuel consumption.
3. OBJECTIVES
• Reduce the overall distance driven to collect and
transport municipal waste from container bins.
• Reduce the overall vehicle drive time to collect and
transport municipal waste from container bins.
4. LITERATURE REVIEW
• ArcGIS Network Analyst was employed to calculate the shortest solid waste
collection route, with the goal to reduce overall fuel costs, for City of Kragujevac,
Serbia, which has approximately 4,000 waste bins at 2,000 locations within 12 city
collection districts. There was 28.1% decrease in overall kilometres travelled[Jovicic,et
al. ,2011].
• Ghose et al. [6] who developed a GIS model for calculating optimal route in the state
of West Bengal, India, and have shown that its application would allow colossal
savings over a period of 15 years.
• Karadimas, et. Al., (2007) used ESRI’s Network Analyst to create an optimized route
to collect 15 bulk items from different locations within Attica, Greece
• 30% decrease in the number of communal bins needed within the city was reported
by Karadimas, et al. (2008) in Athens, Greece using network analyst. Reducing the
quantity from 162 to 112 waste bins produced a substantial savings in energy used
for waste collection.
5. LITERATURE REVIEW
• Routing algorithms are based on comparing different path length using
many algorithms like Annealing, Tabu Search, Genetic Algorithm, Ant
Colony Optimization, and Dijkstra’s algorithm [Karadimas, et al.,2007].
• Dijkstra’s algorithm divides the network dataset into a traversable or non-
traversable piece of the network. In addition, each network has associated
attributes which decides the travel process in a segment of road. Costs are
calculated using two different criteria. The distance is calculated based on
total edge length, and the time is evaluated using measures edge length
and time to traverse a segment [Karadimas, et al.,2008].
• The VRP solver is a new feature with very few work done with it in solid
waste management. The VRP solver is a significant element to consider
whenever developing a waste collection route optimization plan [Jovicic,et
al. ,2011].
6. METHODLOGY
• Current waste generation and collection data, details of the vehicles’ such as
fuel consumption and capacities were required for the planning of routes
which were made available from the municipal corporation.
• There are several inputs to the ArcGIS Network Analyst VRP solver to
calculate optimal routes for solid waste collection such as collection points
(bins), renewal points (depots), parking locations (start & stop points) which
were obtained by field visits and from officials of the municipal corporation.
• A network dataset of Katpadi roads was obtained and updated.
• Coordinates of all point locations (existing bins, segregation yards) were
tabulated in excel and added to ArcGIS.
8. METHODLOGY
• Road Network was updated to add some missing segments of
roads and planarized to form a continuous network without any
connectivity issues.
• Attributes such as length & travel time of different sections of the
road network were calculated.
• Relocated bins layer was created manually on the existing map.
• Layer properties were defined according to need for executing
optimisation analysis.
• A new network dataset was created using the road network polyline
layer as the source.
• Network analyst extension was enabled and a new vehicle routing
problem was started.
9. METHODLOGY
• Location of dustbins were loaded as orders to be picked and
location of segregation site were loaded as depots in the vehicle
routing problem.
• Fleet of vehicle used by municipality were added as routes and
properties of each vehicle(route) such as capacity, service time, start
time/end time, start/end depots, curb approach etc. were defined.
• In order to satisfy capacity of routes and to optimise distance, travel
time, depots were selected as route renewal points.
• Route seed points were also added in some cases.
• Properties of all network analysis layer were defined and analysis
was done by pressing solve button.
• Output of various routes were analysed.
10. RESULTS AND
DISCUSSION
• Figure shows relocated
bins to be Serviced
• Total Capacity: 57.5 MT
• Total Waste Collected:
46 MT (80 % utilization
of bin capacity)
15. RESULTS AND DISCUSSION
• The optimized collection routes for existing bins
returned a distance reduction of 24% which translates
to 24% reduction in fuel costs. The total time for
collection & transportation was also reduced by 8.3%.
• The optimized collection routes for relocated bins
returned a distance reduction of 27% which translates
to 27% reduction in fuel costs. The total time for
collection & transportation was also reduced by
13.7%.
16. RESULTS AND DISCUSSION
• Similar Methodology can be used for optimization of
waste collection routes in other cities/towns but
would require accurate data.
• Further, This project could be used as a guideline for
configuring route optimization for any services that
travel within the city to perform a pickup or delivery.
This could be school bus, public transportation
routes, street sweeping, scheduled utility asset
management and maintenance, or any other city
service that has multiple stops along the network.
17.
18. REFERENCES
1. http://www.thehindu.com/news/national/tamil-nadu/Vellore-makes-it-to-smart-citieslist/article14991598.ece
2. Karadimas, N. V., Kolokathi, M., Defteraiou, G., & Loumas, V., “Municipal Waste Collection of Large Items Optimized
with Arc GIS Network Analyst” 21st European Conference on Modelling and Simulation, 2007
3. Karadimas, N. V., Doukas, N., Kolokathi, M., & Defteraiou, G., “Routing Optimization Heuristics Algorithms for Urban
Solid Waste Transportation Management” WSEAS Transactions on Computers, 7(12), 2008
4. Jovicic, N. M., Boskovic, G. B., Vujic, G. V., Jovicic, G. R., Despotovoc, M. Z., Milovanovic, D. M., et al. (2011). Route
Optimization to Increase Energy Efficiency and Reduce Fuel Consumption of Communal Vehicles. Thermal Science, 14,
S67-S78
5. C. Chalkias and K. Lasaridi, “A GIS based model for the optimisation of municipal solid waste collection: the case study
of Nikea,Athens,Greece,”WSEAS Transactions on Environment and Development, vol. 5, no. 10, pp. 640–650, 2009
6. M. K. Ghose, A. K. Dikshit, and S. K. Sharma, “A GIS based transportation model for solid waste disposal—a case study
on Asansol municipality,” Waste Management, vol. 26, no. 11, pp.1287–1293, 2006
7. Amjad Kallel, M.M. Serbaji, Moncef Zairi, “Using GIS-Based Tools for the Optimization of Solid Waste Collection and
Transportation: Case Study of Sfax City, Tunisia” Journal of Engineering, Vol. 2016, 2016
8. Nemade P.D., Bansode S.S., Deshmukh P.S., Lawand V.B., Kulal S.S., Pawar S.M, “Solid Waste Management and Route
Optimization by using GIS - a case study of Indapur city” IJRITCC Vol. 3 Issue 5, 2015
9. Meena Deswal, J. S. Laura, “Application of GIS in MSW Management in India” IJERD, Vol 10 Issue 10, 2014