A memetic algorithm for solving rich waste collection problems

DOI10.1016/J.EJOR.2022.11.023MaRDI QIDQ6167528zbMATH OpenFDO

Authors Carolien Lavigne, Dirk Inghels, Wout Dullaert, R. 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

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• 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 new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Introduction to algorithms
• Metaheuristics -- the metaphor exposed
• Recyclable waste collection planning -- a case study
• The multi-depot vehicle routing problem with inter-depot routes
• Using experimental design to find effective parameter settings for heuristics
• Vehicle routing problems with split deliveries
• Waste collection vehicle routing problem with time windows

Cited in

(3)

• Waste collection routing: a survey on problems and methods
• A memetic algorithm with bucket elimination for the still life problem
• Solving an urban waste collection problem using ants heuristics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167528)