A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
DOI10.1111/J.1475-3995.2006.00539.XzbMATH Open1127.90391DBLPjournals/itor/PiaF06OpenAlexW2011649314WikidataQ57568148 ScholiaQ57568148MaRDI QIDQ5488252FDOQ5488252
Authors: Alberto Del Pia, Carlo Filippi 
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
Recommendations
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- New large-scale data instances for CARP and new variations of CARP
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- scientific article; zbMATH DE number 1975105
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Cites Work
- The periodic vehicle routing problem with intermediate facilities
- A guided local search heuristic for the capacitated arc routing problem
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- The capacitated arc routing problem with intermediate facilities
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
- Competitive memetic algorithms for arc routing problems
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
- Eulerian location problems
Cited In (26)
- Waste collection routing: a survey on problems and methods
- A multi-level capacitated arc routing problem with intermediate facilities in waste collection
- The linehaul-feeder vehicle routing problem with virtual depots and time windows
- New large-scale data instances for CARP and new variations of CARP
- A survey of recent research on location-routing problems
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
- Daily aircraft routing for amphibious ready groups
- Variable neighbourhood search: Methods and applications
- Variable neighbourhood search: methods and applications
- Location-arc routing problem: heuristic approaches and test instances
- A decade of capacitated arc routing
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- Arc routing problems: A review of the past, present, and future
- A matheuristic for the truck and trailer routing problem
- A data‐driven optimization approach to plan smart waste collection operations
- Linear formulations for the vehicle routing problem with synchronization constraints
- The synchronized arc and node routing problem: application to road marking
- Lower bounds for the mixed capacitated arc routing problem
- A progressive filtering heuristic for the location-routing problem and variants
- Recent results on arc routing problems: an annotated bibliography
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Location arc routing problem with inventory constraints
- A mixed truck and robot delivery approach for the daily supply of customers
- Crossover iterated local search for SDCARP
- Clustered vehicle routing problem for waste collection with smart operational management approaches
- A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method
Uses Software
This page was built for publication: A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488252)
