Solving the close-enough arc routing problem

DOI10.1002/net.21525zbMath1338.90427OpenAlexW2047226187MaRDI QIDQ2811327

Louis-Martin Rousseau, André Langevin, Nathalie Bostel, Minh Hoàng Hà

Publication date: 10 June 2016

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21525

zbMATH Keywords

branch-and-cut algorithmradio frequency identificationclose-enough traveling salesman problemclose-enough arc routing problemautomated meter Reading

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (15)

Data-driven optimization and statistical modeling to improve meter reading for utility companies ⋮ A Markov decision process model on dynamic routing for target surveillance ⋮ The profitable close-enough arc routing problem ⋮ An improved multi-objective framework for the rich arc routing problem ⋮ A multi‐vehicle covering tour problem with speed optimization ⋮ The generalized arc routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ On approximate data reduction for the Rural Postman Problem: Theory and experiments ⋮ A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem ⋮ Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem ⋮ A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands ⋮ 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

Cites Work

• Lower bounds and heuristics for the windy rural postman problem
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
• A branch-and-cut algorithm for the undirected rural postman problem
• A computational study of several heuristics for the DRPP
• Heuristics for the multi-vehicle covering tour problem
• A comparison of two different formulations for arc routing problems on mixed graphs
• Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
• An algorithm for the Rural Postman problem on a directed graph
• The Covering Tour Problem
• A cutting plane algorithm for the general routing problem

This page was built for publication: Solving the close-enough arc routing problem