A memetic algorithm for solving rich waste collection problems

DOI10.1016/j.ejor.2022.11.023MaRDI QIDQ6167528

Carolien Lavigne, Dirk Inghels, Wout E. H. Dullaert, Reginald Dewil

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1871.1/7ae35f83-a806-444e-b03a-c8195bbd136f

zbMATH Keywords

routingwaste collectionintermediate facilitiesmultiple depotspartial Pick-ups

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Recyclable waste collection planning -- a case study
• The multi-depot vehicle routing problem with inter-depot routes
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
• Waste collection vehicle routing problem with time windows
• A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities
• A multiobjective GRASP–VND algorithm to solve the waste collection problem
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• Vehicle routing problems with split deliveries
• Metaheuristics—the metaphor exposed
• Using experimental design to find effective parameter settings for heuristics

This page was built for publication: A memetic algorithm for solving rich waste collection problems