Paper/Poster/Presentation Title

Development and Application of Disjktra's Shortest Path Algorithm for Solid Waste Route Optimization

Keywords

solid waste, route optimization, GIS algorithm, Disjktra's Algorithm

Start Date

24-6-2018 12:00 AM

End Date

24-6-2018 12:00 AM

Abstract

Solid waste management is a challenge for the cities in developing countries due to variety of reasons. Literature suggests that technical factors influencing the system are related to lack of technical skills among personnel within municipalities and government authorities, deficient infrastructure, poor roads and vehicles, insufficient technologies and reliable data. Nonetheless in the last few decades, efforts have been made to minimize the travel time incurred on transportation of solid waste to the disposal point by using shortest path tools. Disjktra’s algorithm is an algorithm aimed at finding the shortest path in route optimization problem. It would therefore be worthwhile to model the solid waste route optimization using Disjktra’s algorithm, a shortest path algorithm.

In this study, the Disjktra’s algorithm has been used to find the shortest route and intermediate node in the network. The code was written in “C” language. Once the code for shortest path was written, another code for finding the intermediate nodes which is route to the shortest path was written. The number of nodes and distances amongst various collection and disposal points were the input. The developed model was applied to an 8-node network in Kanpur representing the collection points and disposal points. These are: Kanpur city namely, the Panki, Nala Road, Vijay Nagar, Naramau, Vishnupuri, Vishnoi Park, Kalyanpur, Bajaria. The actual Distance between collection and disposal points varied from 4-29 kms. It is suggested that such models should be applied to other congested cities to have efficient solid waste management systems.

Stream and Session

A3

This document is currently not available here.

Share

COinS
 
Jun 24th, 12:00 AM Jun 24th, 12:00 AM

Development and Application of Disjktra's Shortest Path Algorithm for Solid Waste Route Optimization

Solid waste management is a challenge for the cities in developing countries due to variety of reasons. Literature suggests that technical factors influencing the system are related to lack of technical skills among personnel within municipalities and government authorities, deficient infrastructure, poor roads and vehicles, insufficient technologies and reliable data. Nonetheless in the last few decades, efforts have been made to minimize the travel time incurred on transportation of solid waste to the disposal point by using shortest path tools. Disjktra’s algorithm is an algorithm aimed at finding the shortest path in route optimization problem. It would therefore be worthwhile to model the solid waste route optimization using Disjktra’s algorithm, a shortest path algorithm.

In this study, the Disjktra’s algorithm has been used to find the shortest route and intermediate node in the network. The code was written in “C” language. Once the code for shortest path was written, another code for finding the intermediate nodes which is route to the shortest path was written. The number of nodes and distances amongst various collection and disposal points were the input. The developed model was applied to an 8-node network in Kanpur representing the collection points and disposal points. These are: Kanpur city namely, the Panki, Nala Road, Vijay Nagar, Naramau, Vishnupuri, Vishnoi Park, Kalyanpur, Bajaria. The actual Distance between collection and disposal points varied from 4-29 kms. It is suggested that such models should be applied to other congested cities to have efficient solid waste management systems.