RT Journal Article
T1 A multiobjective GRASP–VND algorithm to solve the waste collection problem
A1 López Sánchez, Ana Dolores
A1 Hernández-Díaz, Alfredo G.
A1 Cortázar, F.
A1 Hinojosa, Miguel
K1 Routing problems
K1 Hybrid algorithms
K1 Greedy randomized search procedure
K1 Variable neighborhood descent
K1 Multiobjective optimization problem
K1 Waste collection problem
AB In this paper, the waste collection problem (WCP) of a city in the south of Spain is addressed as a multi-objective 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 multi-objective 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-worldWCP of a city in the south of Spain.
PB Wiley
YR 2018
FD 2018
LK https://hdl.handle.net/10433/19749
UL https://hdl.handle.net/10433/19749
LA en
NO A.D. López-Sánchez et al. (2018); A multiobjective GRASP–VND algorithm to solve the waste collection problem; Intl. Trans. in Op. Res., 25: 545–567
NO This work was supported by a research project from the Spanish Ministry of Science and Innovation through Project ECO2013-47129-C4-1-R.
NO Departamento de Economía, Métodos Cuantitativos e Historia Económica
DS RIO
RD May 23, 2026