.png){kind=icon}
.png){kind=icon}
Return
A multiobjective GRASP-VND algorithm to solve the waste collection problem
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.12452.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
routing problems
hybrid algorithms
greedy randomized search procedure
variable neighborhood descent
multiobjective optimization problem
waste collection problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K