CHINESE POSTMAN ALGORITHM IN WASTE COLLECTION VEHICLE ROUTING

Proceedings of the Institute for System Programming of the RAS, 2018

In this article, the routing problems are described. It is shown, that almost all routing problem can be transformed into each other. An example of the Mixed Chinese Postman problem is discussed. The article gives an overview of various variants of Chinese Postman Problem. For all problems the mathematical formulation is given. Moreover, the useful reallife application is presented, too. Then, the article provides a table of possible Chinese Postman problems and identifies parameters that can be varied for obtaining new problems. Five parameters have been identified, such as: presence of set of edges; presence of set of arcs; presence of edges with cost, depending on traversing; the presence of set of required edges; the presence of set of required arcs. It was shown that by varying these parameters one can obtain tasks that were not described earlier but can be used in real life. Four new tasks were identified. Then it is shown that the Chinese Postman problem can be solved as another routing tasks through graph transformations. The method for transforming Chinese Postman problem into the Generalized Travelling Salesman problem is given. Then the results of solving the above problem are presented by simple algorithms, and their effectiveness is shown. The research is not over yet. The testing of other algorithms is planned.

Garbage transportation system in Palembang usually been done in many phases. Garbage collected from homes usually been collected to the nearest temporary garbage collection place (TPS). This garbage will be delivered to final garbage collection place (TPA). This system divides into working area (WK). The garbage truck, in this case, does not go back to the depot (TPA) after accomplishing its job. The driver usually takes the truck with him. This happens since it is more efficient to bring the truck home and the route will be simpler. In this problem, we deal with open capacitated vehicle routing problem (OCVRP). In this paper, all OCVRPs obtain its initial integer solution so we cannot apply branch and cut algorithm. But for symmetric capacitated vehicle routing problem (SCVRP) the optimal solution yields non integer solution so we have to apply branch and cut algorithm. In Kecamatan Seberang Ulu I, all of initial optimal solution yield integer solution, but this solution is not valid so we have to add new constraints (adding constraints) to obtain valid optimal solution.

Computers & Operations Research, 1988

Scope and Purpose-The Chinese Postman Problem (CPP) is to find a least cost way to traverse each arc of a network at least once and to return to the origin. Since its first appearance in Chinese Mathematics 1, 273-277 (1962), the CPP has been the focus of much research attention and found an abundance of applications, especially in municipal problems, such as the routing of street sweepers, household refuse collection vehicles, postmen, the spraying of roads, etc. This paper presents an algorithm for the "directed" Chinese Postman Problem, which, compared with the existing algorithms, is easier to be implemented and has a better computational complexity.

Turkish Journal of Science and Technology, 2020

Many studies have been conducted in recent years to solve the Shortest Route Problem, and the solutions produced as a result of these studies are used in all aspects of everyday life. Package distribution of cargo companies, school services leaving students home, bank branches collecting money and forwarding it to the central bank, municipalities collecting wastes, and bread companies distributing bread to bakery markets, and similar transportation services in which vehicle routing is needed make use of these solutions. Some algorithms related to the Shortest Route Problem were examined in this article, and among these, the Dijkstra Algorithm was applied to a real example problem. In this example, 75. Yıl Neighborhood of Yunus Emre District of Manisa Province was modeled with the Graph Data Model, and the best road destination for solid waste collection vehicles was determined. Based on the results obtained, it was determined that the Dijkstra Algorithm identified the shortest route successfully.

2013

Garbage is produced daily in Surabaya. This work aims to find the effective garbagecollecting route in order to free Surabaya from garbage pile. Several factors needed to be examined are existing garbage colleting system and transportation time by traffic condition. Using this information, a model of Vehicle Routing Problem is developed. The model is called Time-dependent Vehicle Routing Problem with Multiple Trips and Intermediate Facility (TDVRPMTIF). Routes are applied to 70 trucks for 97 Temporary Dumping Site (TDS) in Surabaya, which consists of 19 locations in Central Surabaya, 15 locations in West Surabaya, 15 locations in North Surabaya, 36 locations in East Surabaya, and 12 locations in South Surabaya. The completion of garbage collection route TDVRPMTIF is using sequential insertion algorithm in 3 variants working time, 8-hours, 9-hours and 10-hours. These 3 variants working time do not produce less total routes assigned to the truck. This indicates Surabaya's garbage collection have insufficient quantity of trucks to complete the problem. Several alternatives are proposed to solve the problem. First alternative is maintaining 8-hours working time and adding 11 trucks to complete the task. Second choice is adjusting the working time to 9 hours with the addition of 7 trucks. The third one is optimizing the existing 70 trucks with 10-hours working time.

IOP conference series, 2018

Indonesia still adopts the concept of collect-haul-dispose for municipal solid waste handling and it leads to the queue of the waste trucks at final disposal site (TPA). The study aims to minimize the total distance of waste transportation system by applying a Transshipment model. In this case, analogous of transshipment point is a compaction facility (SPA). Small capacity of trucks collects the waste from waste temporary collection points (TPS) to the compaction facility which located near the waste generator. After compacted, the waste is transported using big capacity of trucks to the final disposal site which is located far away from city. Problem related with the waste transportation can be solved using Vehicle Routing Problem (VRP). In this study, the shortest distance of route from truck pool to TPS, TPS to SPA, and SPA to TPA was determined by using meta-heuristic methods, namely Tabu Search 2 Phases. TPS studied is the container type with total 43 units throughout the West Jakarta City with 38 units of Armroll truck with capacity of 10 m 3 each. The result determines the assignment of each truck from the pool to the selected TPS, SPA and TPA with the total minimum distance of 2,675.3 KM. The minimum distance causing the total cost for waste transportation to be spent by the government also becomes minimal.

Built Environment Studies

Solid waste management has become a major challenge due to strong urban population growth in many developing countries. As one of Indonesia's highest-density population cities, Tangerang City faces the disorganization of the solid waste management system handled by the government. This study aims to create an alternative solid waste disposal transportation by modelling the route and the number of trips. The initial step in reducing the unnecessary distance is redesigning the landfill area's vehicle pool. The vehicles should start and end the activity at the landfill. The calculation of OD pair distance uses Google API in the specific departure time by inputting coordinate data such as longitude and latitude. The application simultaneously applied the documentation of distance and time to 338 waste collection points. The data result is compiled in the distance matrix to find the closest destination between the collection point. The combination of collection points must meet t...

Waste generation is an issuewhich has caused wide public concernin modern societies, not only for the quantitative rise of the amount of waste generated, but also for the increasing complexity of some products and components. Waste collection is a highly relevant activity in the reverse logistics system and how to collect waste in an efficient way is an area that needs to be improved. This paper analyzes the major contribution about Waste Collection Vehicle Routing Problem (WCVRP) in literature. Based on a classification of waste collection (residential, commercial and industrial), firstly the key findings for these three types of waste collection are presented. Therefore, according to the model (Node Routing Problems and Arc Routing problems) used to represent WCVRP, different methods and techniques are analyzed in this paper to solve WCVRP. This paper attempts to serve as a roadmap of research literature produced in the field of WCVRP.

This research paper presents a case study of a Vehicle Routing Problem (VRP). The objective is to minimize the total lengths taken by trucks of the Waste Management Department of Sekondi-Takoradi Metropolitan Assembly in transporting solid waste from the Metropolis to the Dump Site. The problem was formulated as an Integer Programming Model and the Ant Colony Meta-heuristic for the Travelling Salesman Problem was used to obtain the optimal solution. Data on distances between potential garbage picking points were obtained, and the Cartesian coordinates of the various garbage collection points were collected and used as a distance matrix table for each zone. The optimal solutions were obtained with the help of a Matlab implementation codes. The results revealed an outstanding performance of the Ant Colony Optimization Algorithm in terms of efficiency. The study revealed a reduction of the total cost by GH$56000.35 which represents 35% of the total cost.

Engineering Journal, 2020

Waste Collection Vehicle Routing Problem (WCVRP) is one of the developments of a Vehicle Routing Problem, which can solve the route determination of transporting waste. This study aims to develop a model from WCVRP by adding characteristics such as split delivery, multiple trips, time windows, heterogeneous fleet, and intermediate facilities alongside an objective function to minimize costs and travel distance. Our model determines the route for transporting waste especially in Cakung District, East Jakarta. The additional characteristics are obtained by analyzing the characteristics of waste transportation in the area. The models are tested using dummy data to analyze the required computational time and route suitability. The models contribute to determining the route of transporting waste afterward. The WCVRP model has been successfully developed, conducted the numerical testing, and implemented with the actual characteristics such as split delivery, multiple trips, time windows, ...