The Stochastic Close-Enough Arc Routing Problem

DOI10.1002/NET.21729MaRDI QIDQ4565785zbMATH OpenOpenAlexFDO

Authors Alexandre Renaud, Nabil Absi, Dominique Feillet

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

zbMATH Keywords

automated meter readingcutting planesradio frequency identificationStochastic Close-Enough Arc Routing Problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solving the close-enough arc routing problem
• On the distance-constrained close enough arc routing problem
• The min-max close-enough arc routing problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• The profitable close-enough arc routing problem

Cited in

(12)

• 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
• 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
• Solving the 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
• An updated annotated bibliography on arc routing problems
• Energy management for electric vehicles in facility logistics: a survey from an operational research perspective

This page was built for publication: The Stochastic Close-Enough Arc Routing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565785)