Improving robustness of solutions to arc routing problems

DOI10.1057/palgrave.jors.2601822zbMath1095.90013OpenAlexW2030667781MaRDI QIDQ5464426

No author found.

Publication date: 17 August 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601822

zbMATH Keywords

robustnesssensitivity analysisgenetic algorithmsoptimisationvehicle routeingstochastic capacitated arc routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ Arc routing under uncertainty: introduction and literature review ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ A Decade of Capacitated Arc Routing ⋮ A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands ⋮ Evolutionary algorithms for periodic arc routing problems ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands

This page was built for publication: Improving robustness of solutions to arc routing problems