Open AccessMETAHEURISTICS FOR THE WASTE COLLECTION VEHICLE ROUTING PROBLEM IN URBAN AREAS
Author(s) -
Aleksandra Stanković,
Danijel Marković,
Goran Petrović,
Žarko Ćojbašić
Publication year - 2020
Publication title -
facta universitatis. series: working and living environmental protection/facta universitatis. series: working and living environmental protection
Language(s) - English
Resource type - Journals
eISSN - 2406-0534
pISSN - 0354-804X
DOI - 10.22190/fuwlep2001001s
Subject(s) - simulated annealing , vehicle routing problem , ant colony optimization algorithms , metaheuristic , particle swarm optimization , waste collection , computer science , genetic algorithm , heuristic , routing (electronic design automation) , mathematical optimization , operations research , transport engineering , municipal solid waste , engineering , artificial intelligence , waste management , computer network , mathematics , algorithm , machine learning
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.