arrow
Return

A memetic algorithm for solving rich waste collection problems

delete2023-07-01
delete6
delete
OA
AI
J
J. Ruesch *
D
Dirk Inghels
W
Wout Dullaert
R
Reginald Dewil
DOI:10.1016/j.ejor.2022.11.023delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Inspired by a real-life case in the Brussels Capital Region, Belgium, this paper provides a Memetic Al-gorithm with Sequential Split procedure (MASS) for solving a large variety of waste collection problems with multiple depots, a restricted vehicle fleet at each depot, multiple (intermediate) processing facil-ities, capacity restrictions per processing facility and partial pick-ups. MASS first generates satisfactory initial solutions which are feasible w.r.t. the shift duration and the vehicle capacity using a novel pro-cedure in which (1) a giant tour is split into vehicle routes, (2) intermediate processing facilities are introduced and (3) waste pick-ups can be split further if profitable. Second, MASS improves these solu-tions through local search. New test instances are created, which are used to evaluate the performance of MASS's components. We show that MASS provides high-quality feasible solutions by comparing MASS with an exact approach on a small example. Furthermore, MASS is tested on existing instances for the multiple-depot vehicle routing problem (MDVRP), (multi-depot) vehicle routing problem with intermedi-ate facilities ((MD)VRPIF) and the multi-depot vehicle routing problem with inter-depot routes (MDVRPI). MASS shows competitive results for the MDVRP, the VRPIF and the MDVRPI. For the MDVRPIF, MASS ob-tains better results than those currently found in the literature. To assess its practical value, MASS is used to solve a real-life waste collection problem in the Brussels Capital Region in which alternative scenarios for municipal bio-waste collection and treatment are compared.(c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Routing
Waste collection
Multiple depots
Intermediate facilities
Partial pick-ups
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

V
Vrije Universiteit Amsterdam
Scholars:
4.2W
Papers: 3.7W
Citations: 3.7W
K
KU Leuven
Scholars:
5.7W
Papers: 5.2W
Citations: 8.1W
Cited Papers

Cited Papers

A multiobjective GRASP-VND algorithm to solve the waste collection problem
err2017-09-21
err17
PREAI
errLopez-Sanchez, A. D.; Hernandez-Diaz, A. G.; Gortazar, F.; Hinojosa, M. A.
errShare
errSave
An iterated local search heuristic for the split delivery vehicle routing problem
err2015-01-01
err112
errOAAI
errSilva, Marcos Melo; Subramanian, Anand; Ochi, Luiz Satoru
errShare
errSave
Split delivery routing
err2013-12-10
err0
PREAI
errMoshe Dror; Pierre Trudeau
errShare
errSave
Distinct replicative and cytopathic characteristics of human immunodeficiency virus isolates
err1988-11-01
err0
errOAAI
errE M Fenyö; L Morfeldt-Månson; F Chiodi; B Lind; A von Gegerfelt; J Albert; E Olausson; B Asjö
errShare
errSave
err
IF0
err
err0
PREAI
err
errShare
errSave
errShare
errSave
A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes
err2014-08-01
err50
PREAI
errMuter, Ibrahim; Cordeau, Jean-Francois; Laporte, Gilbert
errShare
errSave
researcher View more