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

zbMATH Keywords

heuristicsvariable neighborhood searcharc routingwaste collection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)

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

Cites work

• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• 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
• Competitive memetic algorithms for arc routing problems
• Eulerian location problems
• On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
• The capacitated arc routing problem with intermediate facilities
• The periodic vehicle routing problem with intermediate facilities

Cited in

(31)

• A progressive filtering heuristic for the location-routing problem and variants
• Variable neighbourhood search: Methods and applications
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem
• A simheuristic algorithm for time-dependent waste collection management with stochastic travel times
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
• Location arc routing problem with inventory constraints
• Waste collection routing: a survey on problems and methods
• Variable neighbourhood search: methods and applications
• Clustered vehicle routing problem for waste collection with smart operational management approaches
• Location-arc routing problem: heuristic approaches and test instances
• A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method
• A survey of recent research on location-routing problems
• Daily aircraft routing for amphibious ready groups
• A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
• The linehaul-feeder vehicle routing problem with virtual depots and time windows
• A districting-based heuristic for the coordinated capacitated arc routing problem
• A multiobjective GRASP-VND algorithm to solve the waste collection problem
• Crossover iterated local search for SDCARP
• A matheuristic for the truck and trailer routing problem
• Lower bounds for the mixed capacitated arc routing problem
• A decade of capacitated arc routing
• A data‐driven optimization approach to plan smart waste collection operations
• New large-scale data instances for CARP and new variations of CARP
• Recent results on arc routing problems: an annotated bibliography
• Local search heuristics for sectoring routing in a household waste collection context
• Arc routing problems: A review of the past, present, and future
• A multi-level capacitated arc routing problem with intermediate facilities in waste collection
• A mixed truck and robot delivery approach for the daily supply of customers
• Linear formulations for the vehicle routing problem with synchronization constraints
• The synchronized arc and node routing problem: application to road marking

Describes a project that uses

Uses Software

• TSPTW

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)