Districting for arc routing
From MaRDI portal
Publication:2940070
Recommendations
Cites work
- scientific article; zbMATH DE number 2040751 (Why is no real title available?)
- scientific article; zbMATH DE number 3231691 (Why is no real title available?)
- A reactive GRASP for a commercial territory design problem with multiple balancing requirements
- A redistricting problem applied to meter reading in power distribution networks
- A simulated annealing approach to police district design
- A simulated annealing genetic algorithm for the electrical power districting problem
- 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
- A tabu search heuristic and adaptive memory procedure for political districting
- An optimization based heuristic for political districting
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- District design for arc-routing applications
- Districting for salt spreading operations
- Fast Approximation Methods for Sales Force Deployment
- Heuristic methods for the sectoring arc routing problem
- Large-scale pickup and delivery work area design
- New models for commercial territory design
- Solving a home-care districting problem in an urban setting
- Solving a large scale districting problem: A case report
- The arc partitioning problem
- Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
- Weighted Voronoi region algorithms for political districting
Cited in
(26)- Visual attractiveness in routing problems: a review
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm
- Approximating the length of Chinese postman tours
- A hybrid heuristic for the maximum dispersion problem
- Routing, districting and location for arc traversal problems. (Abstract of thesis).
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization
- A novel model for arc territory design: promoting Eulerian districts
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application
- A districting-based heuristic for the coordinated capacitated arc routing problem
- A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment
- Multi-depot rural postman problems
- An updated annotated bibliography on arc routing problems
- Heuristic methods for the sectoring arc routing problem
- Approximation schemes for districting problems with probabilistic constraints
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem
- A concise guide to existing and emerging vehicle routing problem variants
- Solving a home-care districting problem in an urban setting
- Integrating territory design and routing problems
- A redistricting problem applied to meter reading in power distribution networks
- Exact solution of the soft-clustered vehicle-routing problem
- Districting for salt spreading operations
- District design for arc-routing applications
- The Capacitated and Economic Districting Problem
This page was built for publication: Districting for arc routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940070)
