Arc routing with trip-balancing and attractiveness measures -- a waste collection case study
From MaRDI portal
Publication:2676339
Recommendations
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Heuristic methods for the sectoring arc routing problem
- Local search heuristics for sectoring routing in a household waste collection context
- scientific article; zbMATH DE number 1975105
Cites work
- A survey on matheuristics for routing problems
- Arc Routing
- Capacitated arc routing problems
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- scientific article; zbMATH DE number 1749229 (Why is no real title available?)
- scientific article; zbMATH DE number 1749230 (Why is no real title available?)
- scientific article; zbMATH DE number 6741972 (Why is no real title available?)
- Lower bounds for the mixed capacitated arc routing problem
- New large-scale data instances for CARP and new variations of CARP
- Recent results on arc routing problems: an annotated bibliography
- The commodity-split multi-compartment capacitated arc routing problem
- The mixed capacitated arc routing problem with non-overlapping routes
- The periodic capacitated arc routing problem with irregular services
- Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles
Cited in
(6)- Heuristic methods for the sectoring arc routing problem
- ARC: A computerized system for urban garbage collection
- Local search heuristics for sectoring routing in a household waste collection context
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Exploring roadside management optimisation opportunities: a systematic review on arc routing problems applications and modelling
- Graph partitioning-based matheuristic for residential waste collection problem with visual attractiveness and turn penalty
This page was built for publication: Arc routing with trip-balancing and attractiveness measures -- a waste collection case study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676339)