A memetic algorithm for solving rich waste collection problems

DOI10.1016/J.EJOR.2022.11.023MaRDI QIDQ6167528FDOQ6167528

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

• Title not available (Why is that?)
• Introduction to algorithms
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Using experimental design to find effective parameter settings for heuristics
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• Vehicle routing problems with split deliveries
• Recyclable waste collection planning -- a case study
• Waste collection vehicle routing problem with time windows
• Metaheuristics -- the metaphor exposed
• A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
• The multi-depot vehicle routing problem with inter-depot routes
• A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes
• A multiobjective GRASP-VND algorithm to solve the waste collection problem

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)