An improved heuristic for the capacitated arc routing problem
From MaRDI portal
Recommendations
Cites work
- A cutting plane algorithm for the capacitated arc routing problem
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- Approximate solutions for the capacitated arc routing problem
- Capacitated arc routing problems
- Competitive memetic algorithms for arc routing problems
- Geometric Approaches to Solving the Traveling Salesman Problem
- scientific article; zbMATH DE number 558539 (Why is no real title available?)
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- scientific article; zbMATH DE number 764424 (Why is no real title available?)
- scientific article; zbMATH DE number 232390 (Why is no real title available?)
- scientific article; zbMATH DE number 956790 (Why is no real title available?)
- Lower and upper bounds for the mixed capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- The Capacitated Arc Routing Problem: Lower bounds
Cited in
(30)- Heuristic methods for the sectoring arc routing problem
- Approximate solutions for the capacitated arc routing problem
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Capacitated arc routing problem with deadheading demands
- Constant-factor approximations for capacitated arc routing without triangle inequality
- A guided local search heuristic for the capacitated arc routing problem
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Arc routing for parking enforcement officers: exact and heuristic solutions
- Augment-insert algorithms for the capacitated arc routing problem
- A scatter search for the periodic capacitated arc routing problem
- The capacitated arc routing problem with refill points
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Improved bounds for large scale capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- A heuristic method for the capacitated arc routing problem with refill points and multiple loads
- Solution for complicated CARP of route planning of sprinklers
- Modeling and solving the mixed capacitated general routing problem
- Crossover iterated local search for SDCARP
- The capacitated arc routing problem: heuristics
- The capacitated arc routing problem. A heuristic algorithm
- Improving robustness of solutions to arc routing problems
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
- Effects of update frequencies in a dynamic capacitated arc routing problem
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- A parameterized lower bounding method for the open capacitated arc routing problem
- The open capacitated arc routing problem
- A parallel insert method for the capacitated arc routing problem
This page was built for publication: An improved heuristic for the capacitated arc routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010273)
