New upper bounds for the multi-depot capacitated arc routing problem
From MaRDI portal
(Redirected from Publication:537994)
Recommendations
- Lower and upper bounds for the mixed capacitated arc routing problem
- New lower bounds for the Capacitated Arc Routing Problem
- New lower bound for the capacitated arc routing problem
- Improved bounds for large scale capacitated arc routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- The Capacitated Arc Routing Problem: Lower bounds
- An approach to the asymmetric multi-depot capacitated arc routing problem
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- Lower bounds for the mixed capacitated arc routing problem
- The capacitated arc routing problem: Valid inequalities and facets
Cited in
(9)- On games arising from multi-depot Chinese postman problems
- Implicit depot assignments and rotations in vehicle routing heuristics
- An improved multi-objective framework for the rich arc routing problem
- An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
- An approach to the asymmetric multi-depot capacitated arc routing problem
- Crossover iterated local search for SDCARP
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
- New max min ant colony optimization for the periodic arc routing problem
This page was built for publication: New upper bounds for the multi-depot capacitated arc routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537994)
