Premium
A multiobjective GRASP–VND algorithm to solve the waste collection problem
Author(s) -
LópezSánchez A.D.,
HernándezDíaz A.G.,
Gortázar F.,
Hinojosa M.A.
Publication year - 2018
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12452
Subject(s) - grasp , greedy randomized adaptive search procedure , mathematical optimization , greedy algorithm , computer science , variable (mathematics) , set (abstract data type) , vehicle routing problem , descent (aeronautics) , point (geometry) , perspective (graphical) , algorithm , mathematics , routing (electronic design automation) , artificial intelligence , engineering , mathematical analysis , computer network , geometry , programming language , aerospace engineering
In this paper, the waste collection problem (WCP) of a city in the south of Spain is addressed as a multiobjective routing problem that considers three objectives. From the company's perspective, the minimization of the travel cost is desired as well as that of the total number of vehicles. Additionally, from the employee's point of view, a set of balanced routes is also sought. Four variants of a multiobjective hybrid algorithm are proposed. Specifically, a GRASP (greedy randomized adaptive search procedure) with a VND (variable neighborhood descent) is combined. The best GRASP–VND algorithm found is applied in order to solve the real‐world WCP of a city in the south of Spain.