Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
From MaRDI portal
(Redirected from Publication:1887872)
Recommendations
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- A heuristic method for the capacitated arc routing problem with refill points and multiple loads
- The capacitated arc routing problem. A heuristic algorithm
- The capacitated arc routing problem: heuristics
- An improved heuristic for the capacitated arc routing problem
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Algorithms for Large Directed Capacitated Arc Routing Problem Instances
- 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
- A hybrid metaheuristic approach for the capacitated arc routing problem
Cites work
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- scientific article; zbMATH DE number 956790 (Why is no real title available?)
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Augment-insert algorithms for the capacitated arc routing problem
- Capacitated arc routing problems
- Heuristics for the mixed rural postman problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Networks and vehicle routing for municipal waste collection
- Routeing winter gritting vehicles
- The Rural Postman Problem on mixed graphs with turn penalties
- The capacitated arc routing problem with intermediate facilities
- The capacitated arc routing problem. A heuristic algorithm
- The fleet size and mix problem for capacitated arc routing
Cited in
(19)- A multi-level capacitated arc routing problem with intermediate facilities in waste collection
- New large-scale data instances for CARP and new variations of CARP
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- Algorithms for Large Directed Capacitated Arc Routing Problem Instances
- 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
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- A decade of capacitated arc routing
- The mixed capacitated arc routing problem with non-overlapping routes
- A districting-based heuristic for the coordinated capacitated arc routing problem
- Lower bounds for the mixed capacitated arc routing problem
- Heuristic methods for the sectoring arc routing problem
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Recent results on arc routing problems: an annotated bibliography
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem
- Municipal street-sweeping area generation with route optimization
- Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Approximation algorithms for solving the k-Chinese postman problem under interdiction budget constraints
This page was built for publication: Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887872)
