Paper Info
Title
A Multiobjective Grasp-Vnd Algorithm To Solve The Waste Collection Problem
Abstract
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.
Year
DOI
Venue
2018
10.1111/itor.12452
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Keywords
Field
DocType
routing problems, hybrid algorithms, greedy randomized search procedure, variable neighborhood descent, multiobjective optimization problem, waste collection problem
Mathematical optimization,Hybrid algorithm,GRASP,Operations research,Algorithm,Minification,Multiobjective optimization problem,Greedy randomized adaptive search procedure,Waste collection,Mathematics,Operations management
Journal
Volume
Issue
ISSN
25
2
0969-6016
Citations 
PageRank 
References 
3
0.37
15
Authors
4
Name
Order
Citations
PageRank
A. D. LóPez-SáNchez1142.58
Alfredo García Hernández-Díaz2140.89
Francisco Gortázar311312.08
Miguel A. Hinojosa4559.77