ROUTE OPTIMIZATION OF A REFUSE COLLECTION SYSTEM

Abstract

Due to rapid urbanization and industrialisation, it has become imperative for every country, to evolve an efficient solid waste management system. Out of the total expenditure. on solid waste management 50 to 60 percent is attributed to transportation alone. Optimization Of this activity results in large savings. The present work is designed. to optimize a refuse Collection system using linear programming, algorithm.' The objective in this cafe is to minimize the total distance travelled by the collection vehicle. The constraint of this problem is that each collection point should be visited atleast , once. The traditional formulation described as travelling sales-man problem results in multiple closed loops which are not • acceptable as refuse collection routes. Modification have been made to reduce the multiple loop formation and arrive at an acceptable least cost route.' As a case study the least cost collec.tion route of Roorkee University campus. has been arrived at.