Local search heuristics for sectoring routing in a household waste collection context
DOI10.1016/J.EJOR.2016.04.013zbMATH Open1346.90092OpenAlexW2340891570MaRDI QIDQ323486FDOQ323486
Ana Catarina Nunes, Maria João Cortinhal, Maria Cândida Mourão
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.04.013
Recommendations
- Heuristic methods for the sectoring arc routing problem
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study
- A heuristic for the solution of vehicle routing problems with time windows and multiple dumping sites in waste collection
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- Solving an urban waste collection problem using ants heuristics
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- A tabu search heuristic and adaptive memory procedure for political districting
- A Decade of Capacitated Arc Routing
- The effect of ignoring routes when locating depots
- An evolutionary algorithm for the vehicle routing problem with route balancing
- The vehicle routing problem. Latest advances and new challenges.
- Designing delivery districts for the vehicle routing problem with stochastic demands
- Recent results on Arc Routing Problems: An annotated bibliography
- Capacitated arc routing problems
- Recyclable waste collection planning -- a case study
- Lower bounds for the mixed capacitated arc routing problem
- Heuristic methods for the sectoring arc routing problem
- Multiobjective scatter search for a commercial territory design problem
- The sector design and assignment problem for snow disposal operations
- Lower and upper bounds for the mixed capacitated arc routing problem
- Waste collection vehicle routing problem with time windows
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- Vehicle Routing
- The mixed capacitated arc routing problem with non-overlapping routes
- A redistricting problem applied to meter reading in power distribution networks
- Large-scale pickup and delivery work area design
- District design for arc-routing applications
- Arc Routing
- Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- A survey of models and algorithms for winter road maintenance. I: System design for spreading and plowing
- A survey of models and algorithms for winter road maintenance. II: System design for snow disposal
- Title not available (Why is that?)
- Hierarchical Planning for Probabilistic Distribution Systems in Euclidean Spaces
- Title not available (Why is that?)
- Competitive memetic algorithms for arc routing problems
Cited In (3)
Uses Software
This page was built for publication: Local search heuristics for sectoring routing in a household waste collection context
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323486)
