The use of dijkstra's algorithm in waste management problem

Abstract

Waste disposal facilities, commonly called landfill sites, were originally located on the outskirts of centers of population, due to the lack of large scale transport to carry the waste away. The development of any landfill is expensive and the only return being on how much waste can be stored in the landfill void. The most economical landfill requires that the void is filled to its maximum capacity. Starting from the idea that a GIS can be used to keep a record of filling and transportation parameters, in this paper we present a particular approaching algorithm based on a Dijkstra minimum cost method. In the final a specific application for the city case of Galaţi is dealt with.