The stochastic close-enough arc routing problem
From MaRDI portal
Publication:4565785
DOI10.1002/net.21729zbMath1390.90083OpenAlexW2577139755MaRDI QIDQ4565785
Nabil Absi, Dominique Feillet, Alexandre Renaud
Publication date: 13 June 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21729
cutting planesradio frequency identificationautomated meter readingStochastic Close-Enough Arc Routing Problem
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
Data-driven optimization and statistical modeling to improve meter reading for utility companies ⋮ Arc routing under uncertainty: introduction and literature review ⋮ The profitable close-enough arc routing problem ⋮ An improved multi-objective framework for the rich arc routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ A matheuristic for the distance-constrained close-enough arc routing problem ⋮ On the distance-constrained close enough arc routing problem ⋮ Spatial coverage in routing and path planning problems ⋮ The min-max close-enough arc routing problem
This page was built for publication: The stochastic close-enough arc routing problem
