GIS Oriented Service Optimization Tool For Fecal Sludge Collection

In developing countries most of the urban dwellers don’t have access to sewer system. People are mostly using “onsite” systems such as septic tanks or pit latrines that need to be emptied periodically, as the densely built urban environment won’t allow new pits to be dug every time they fill up. In the conventional fecal sludge collection systems, authorities are collecting the sludge from house to house and dump on the plant. Fecal sludge collection system is different from traditional vehicle routing and even from solid waste collection system in terms of dynamic collection points, urgency of getting the service and diversity of demand. Due to those vibrant factors authorities are facing proper networking and management problems. This research describes algorithms that can accommodate constraints and prioritized customers who need immediate service. The GPS log data of the fecal sludge collection truck that maintained by Nonthaburi Municipality, Thailand has been considered as the base data during the development of this application. Spatial analysis has been done using Geographic Information Systems (GIS).Tabu Search has been implemented in order to optimize. Basically two algorithms were produced for assisting fecal sludge collection systems. First algorithm was able to produce multiple trip for each vehicle if required considering all the customers having equal priority, time window. The second one was able to perform optimization that can accommodate priority along with the first one. Input for the algorithms were very simple; distance matrix having distance between each customers and plant, customer order with latitude, longitude, order unit, time window, priority and vehicles with capacity. Algorithms were able to produce better result than the actual operation or even from shortest path algorithm in term of distance. After optimization, efficiency of the algorithms were tested with the actual travelling distance. Travelling distance were reduced to half compare to actual cost and it ensured maximum utilization of vehicle capacity by allocating maximum number of customers in each route

Aplikasi Model Optimasi Untuk Meningkatkan Efisiensi Pengangkutan Sampah Di Kota Cilegon

Most cities in developing countries face inefficiency problem of waste collection service run by government. The purpose of this study is to estimate the efficiency of waste collection service and the capital cost requirement in 2019 to cover 100% waste collection service in Cilegon City. The efficiency is calculated by comparing the current costs with the optimization costs by the model of vehicle routing problem. The result shows that the obtained inefficiency reaches 37,48% which largely comes from the labor component. To cover all of resident in Cilegon City, the city needs to increase their budget allocation as much as IDR 33,884 billion in 2019

Route Planning: Winter Applications

Multiple professions require the proficiency of accurately calculated routes. The use of efficient snow plow routes is essential for clearing the streets in a cold-climate metropolis. For this case study of snow plow routing for the city of Washington, D.C., man-made geographic boundaries were analyzed to determine their influential role in generating resourceful routes. Complex variables, such as turning impedances, multiple passes and many more, were input into a geographic information system (GIS) in order to test the software’s capabilities. The GIS software created reliable results for adequately clearing the streets of Washington, D.C

Waste collection in urban areas: a case study

The Optimization for Networked Data in Environmental Urban Waste Collection (ONDE-UWC) project is, to our knowledge, the first attempt to apply the Internet of Things (IoT) paradigm to the waste collection field. Sensors installed on dumpsters and garbage trucks share data, such as the number of user accesses and weight measures. In this study, we schedule the weekly waste collection activities of all the types of waste without imposing periodic routes. An important characteristic of this project considers the network presence of heterogeneous stakeholders with different background knowledge. In this context, we apply the GUEST OR methodology, highlighting how it can support the decision-making process in order to reduce this gap. This will bring positive consequences in terms of reduced time for solution implementation, followed by operational efficiency and economical savings

Road-based goods transportation : a survey of real-world logistics applications from 2000 to 2015

The vehicle routing problem has been widely studied from a technical point of view for more than 50 years. Many of its variants are rooted in practical settings. This paper provides a survey of the main real-life applications of road-based goods transportation over the past 15 years. It reviews papers in the areas of oil, gas and fuel transportation, retail, waste collection and management, mail and package delivery and food distribution. Some perspectives on future research and applications are discussed

The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows

This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW). Small and large vehicles deliver services to customers within time constraints; small vehicles en route may reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched

Waste collection routing-limited multiple landfills and heterogeneous fleet

This article deals with a real-life waste collection routing problem. To efficiently plan waste collection, large municipalities may be partitioned into convenient sectors and only then can routing problems be solved in each sector. Three diverse situations are described, resulting in three different new models. In the first situation, there is a single point of waste disposal from where the vehicles depart and to where they return. The vehicle fleet comprises three types of collection vehicles. In the second, the garage does not match any of the points of disposal. The vehicle is unique and the points of disposal (landfills or transfer stations) may have limitations in terms of the number of visits per day. In the third situation, disposal points are multiple (they do not coincide with the garage), they are limited in the number of visits, and the fleet is composed of two types of vehicles. Computational results based not only on instances adapted from the literature but also on real cases are presented and analyzed. In particular, the results also show the effectiveness of combining sectorization and routing to solve waste collection problems