A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
From MaRDI portal
Publication:5488252
DOI10.1111/j.1475-3995.2006.00539.xzbMath1127.90391OpenAlexW2011649314WikidataQ57568148 ScholiaQ57568148MaRDI QIDQ5488252
Carlo Filippi, Alberto Del Pia
Publication date: 14 September 2006
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2006.00539.x
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items (22)
New large-scale data instances for CARP and new variations of CARP ⋮ A survey of recent research on location-routing problems ⋮ Daily aircraft routing for amphibious ready groups ⋮ The synchronized arc and node routing problem: application to road marking ⋮ Location-arc routing problem: heuristic approaches and test instances ⋮ Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities ⋮ Location arc routing problem with inventory constraints ⋮ A progressive filtering heuristic for the location-routing problem and variants ⋮ A mixed truck and robot delivery approach for the daily supply of customers ⋮ Arc routing problems: A review of the past, present, and future ⋮ The linehaul-feeder vehicle routing problem with virtual depots and time windows ⋮ A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method ⋮ A data‐driven optimization approach to plan smart waste collection operations ⋮ Crossover iterated local search for SDCARP ⋮ A Decade of Capacitated Arc Routing ⋮ Variable neighbourhood search: methods and applications ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Linear formulations for the vehicle routing problem with synchronization constraints ⋮ Variable neighbourhood search: Methods and applications ⋮ A variable neighborhood descent algorithm for a real waste collection problem with mobile depots ⋮ Lower bounds for the mixed capacitated arc routing problem ⋮ A matheuristic for the truck and trailer routing problem
Uses Software
Cites Work
- Competitive memetic algorithms for arc routing problems
- The periodic vehicle routing problem with intermediate facilities
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
- A guided local search heuristic for the capacitated arc routing problem
- The capacitated arc routing problem with intermediate facilities
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Eulerian location problems
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
This page was built for publication: A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
