Heuristic methods for the sectoring arc routing problem
From MaRDI portal
Publication:1041923
DOI10.1016/j.ejor.2008.04.025zbMath1176.90074OpenAlexW2002616150MaRDI QIDQ1041923
Maria Cândida Mourão, Christian Prins, Ana Catarina Nunes
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.04.025
Related Items
New large-scale data instances for CARP and new variations of CARP, Towards a stochastic programming modeling framework for districting, Visual attractiveness in routing problems: a review, The mixed capacitated arc routing problem with non-overlapping routes, 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, Metaheuristics with disposal facility positioning for the waste collection VRP with time windows, Districting for Arc Routing, Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems, Dynamic community partitioning for e-commerce last mile delivery with time window constraints, Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery, Approximation schemes for districting problems with probabilistic constraints, A hybrid hypercube - genetic algorithm approach for deploying many emergency response mobile units in an urban network, A districting-based heuristic for the coordinated capacitated arc routing problem, Recent results on Arc Routing Problems: An annotated bibliography, A novel model for arc territory design: promoting Eulerian districts, The aircraft maintenance base location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive memetic algorithms for arc routing problems
- The arc partitioning problem
- The fleet size and mix problem for capacitated arc routing
- Optimal political districting
- Routing, districting and location for arc traversal problems. (Abstract of thesis).
- A tabu search heuristic and adaptive memory procedure for political districting
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- The sector design and assignment problem for snow disposal operations
- Lower and upper bounds for the mixed capacitated arc routing problem
- Sales Territory Alignment: A Review and Model
- Fast Approximation Methods for Sales Force Deployment
- Capacitated arc routing problems
- District design for arc-routing applications
- Networks and vehicle routing for municipal waste collection
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Municipal Solid Waste Collection: An Effective Data Structure For Solving The Sectorization Problem With Local Search Methods
