A memetic algorithm for solving rich waste collection problems
From MaRDI portal
Cites work
- 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
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- 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
(5)- A memetic algorithm with bucket elimination for the still life problem
- Solving an urban waste collection problem using ants heuristics
- Waste collection routing: a survey on problems and methods
- A harmony search-based memetic algorithm for vehicle routing problem with order release dates and flexible time windows
- The two-echelon multi-commodity capacitated arc routing problem
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)
