Waste Collection Vehicle Routing Problem on HPC Infrastructure

2018 ◽  
pp. 266-278 ◽  
Author(s):  
Ekaterina Grakova ◽  
Kateřina Slaninová ◽  
Jan Martinovič ◽  
Jan Křenek ◽  
Jiří Hanzelka ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Waste Collection ◽  
Routing Problem

scholarly journals A Heuristic Solution Method for Multi-Depot Vehicle Routing-Based Waste Collection Problems

2020 ◽  
Vol 10 (7) ◽  
pp. 2403
Author(s):  
Yanjun Shi ◽  
Lingling Lv ◽  
Fanyi Hu ◽  
Qiaomei Han
Keyword(s):  
Vehicle Routing ◽  
Waste Disposal ◽  
Vehicle Routing Problem ◽  
Solution Method ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Waste Collection ◽  
Heuristic Solution ◽  
Routing Problem ◽  
Combination Optimization

This paper addresses waste collection problems in which urban household and solid waste are brought from waste collection points to waste disposal plants. The collection of waste from the collection points herein is modeled as a multi-depot vehicle routing problem (MDVRP), aiming at minimizing the total transportation distance. In this study, we propose a heuristic solution method to address this problem. In this method, we firstly assign waste collection points to waste disposal plants according to the nearest distance, then each plant solves the single-vehicle routing problem (VRP) respectively, assigning customers to vehicles and planning the order in which customers are visited by vehicles. In the latter step, we propose the sector combination optimization (SCO) algorithm to generate multiple initial solutions, and then these initial solutions are improved using the merge-head and drop-tail (MHDT) strategy. After a certain number of iterations, the optimal solution in the last generation is reported. Computational experiments on benchmark instances showed that the initial solutions obtained by the sector combination optimization algorithm were more abundant and better than other iterative algorithms using only one solution for initialization, and the solutions with distance gap were obtained using the merge-head and drop-tail strategy in a lower CPU time compared to the Tabu search algorithm.

Solving an Eco-efficient Vehicle Routing Problem for Waste Collection with GRASP

2018 ◽  
pp. 215-224
Author(s):  
Airam Expósito-Márquez ◽  
Christopher Expósito-Izquierdo ◽  
Julio Brito-Santana ◽  
José A. Moreno-Pérez
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Waste Collection ◽  
Routing Problem

scholarly journals Waste Collection Vehicle Routing Problem: Literature Review

2015 ◽  
Vol 27 (4) ◽  
pp. 345-358 ◽  
Author(s):  
Hui Han ◽  
Eva Ponce Cueto
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Research Literature ◽  
Arc Routing ◽  
Waste Collection ◽  
Logistics System ◽  
Routing Problems ◽  
Routing Problem ◽  
Node Routing

Waste generation is an issue which has caused wide public concern in 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.

scholarly journals METAHEURISTICS FOR THE WASTE COLLECTION VEHICLE ROUTING PROBLEM IN URBAN AREAS

2020 ◽  
pp. 001
Author(s):  
Aleksandar Stanković ◽  
Danijel Marković ◽  
Goran Petrović ◽  
Žarko Čojbašić
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Urban Areas ◽  
Heuristic Algorithms ◽  
Municipal Waste ◽  
Waste Collection ◽  
Swarm Optimization ◽  
Urban Waste ◽  
Routing Problem ◽  
Capacitated Vehicle

This paper presents a methodology for solving the municipal waste collection problem in urban areas. The problem is treated as a distance-constrained capacitated vehicle routing problem for municipal waste collection (DCCVRP-MWC). To solve this problem, four meta-heuristic algorithms were used: Genetic algorithm (GA), Simulated annealing (SA), Particle swarm optimization (PSO) and Ant colony optimization (ACO). Vehicle guidance plays a huge role in large transportation companies, and with this test, we propose one of several algorithms for solving urban waste collection problems.

scholarly journals Aplikasi Model Optimasi untuk Meningkatkan Efisiensi Pengangkutan Sampah di Kota Cilegon

2015 ◽  
Vol 16 (1) ◽  
pp. 59-80
Author(s):  
Danang Triwibowo ◽  
Alin Halimatussadiah
Keyword(s):  
Developing Countries ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Budget Allocation ◽  
Capital Cost ◽  
Waste Collection ◽  
Routing Problem ◽  
The City

AbstractMost 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. Keywords: Inefficiency; Optimization; Waste Collection; Vehicle Routing Problem AbstrakSebagian besar kota di negara berkembang menghadapi permasalahan inefisiensi pengangkutan sampah yang dikelola pemerintah. Tujuan penelitian ini adalah mengestimasi inefisiensi pengangkutan sampah di Kota Cilegon. Inefisiensi dihitung dengan membandingkan biaya saat ini dengan biaya hasil optimasi rute dengan model vehicle routing problem. Penelitian ini juga mengestimasi kebutuhan biaya modal jika rasio pengangkutan sampah mencapai 100% pada tahun 2019. Hasil penelitian menunjukkan bahwa inefisiensi sebesar 37,48%, yaitu porsi komponen tenaga kerja sebesar 94,48 dari total inefisiensi. Terkait kebutuhan modal, diperlukan kenaikan anggaran Rp33,884 miliar untuk meningkatkan rasio pengangkutan sampah menjadi 100% pada tahun 2019.

Sign in / Sign up

Export Citation Format

Share Document