Heuristic methods for the sectoring arc routing problem
From MaRDI portal
Recommendations
- Local search heuristics for sectoring routing in a household waste collection context
- Districting for arc routing
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study
- An improved heuristic for the capacitated arc routing problem
- scientific article; zbMATH DE number 956790
Cites work
- scientific article; zbMATH DE number 1703887 (Why is no real title available?)
- scientific article; zbMATH DE number 3918092 (Why is no real title available?)
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- scientific article; zbMATH DE number 956790 (Why is no real title available?)
- A tabu search heuristic and adaptive memory procedure for political districting
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Capacitated arc routing problems
- Competitive memetic algorithms for arc routing problems
- District design for arc-routing applications
- Fast Approximation Methods for Sales Force Deployment
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Introduction to algorithms
- Lower and upper bounds for the mixed capacitated arc routing problem
- Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
- Networks and vehicle routing for municipal waste collection
- Optimal political districting
- Routing, districting and location for arc traversal problems. (Abstract of thesis).
- Sales Territory Alignment: A Review and Model
- The arc partitioning problem
- The fleet size and mix problem for capacitated arc routing
- The sector design and assignment problem for snow disposal operations
Cited in
(19)- Visual attractiveness in routing problems: a review
- Districting for arc routing
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Dynamic community partitioning for e-commerce last mile delivery with time window constraints
- Towards a stochastic programming modeling framework for districting
- A novel model for arc territory design: promoting Eulerian districts
- A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network
- Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
- A districting-based heuristic for the coordinated capacitated arc routing problem
- The aircraft maintenance base location problem
- Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery
- Approximation schemes for districting problems with probabilistic constraints
- New large-scale data instances for CARP and new variations of CARP
- Recent results on arc routing problems: an annotated bibliography
- The mixed capacitated arc routing problem with non-overlapping routes
- Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
- Local search heuristics for sectoring routing in a household waste collection context
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
This page was built for publication: Heuristic methods for the sectoring arc routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041923)
