Improving robustness of solutions to arc routing problems
From MaRDI portal
Recommendations
- Approximate solutions for the capacitated arc routing problem
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
- An improved heuristic for the capacitated arc routing problem
- Augment-insert algorithms for the capacitated arc routing problem
- scientific article; zbMATH DE number 1703887
Cited in
(12)- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
- Evolutionary algorithms for periodic arc routing problems
- A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds
- Improving the robustness of EPS to solve the TSP
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
- Arc routing under uncertainty: introduction and literature review
- Recent results on arc routing problems: an annotated bibliography
- A decade of capacitated arc routing
- scientific article; zbMATH DE number 2156293 (Why is no real title available?)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
This page was built for publication: Improving robustness of solutions to arc routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464426)