Solving the close-enough arc routing problem

DOI10.1002/NET.21525MaRDI QIDQ2811327zbMATH OpenOpenAlexFDO

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

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

automated meter Readingbranch-and-cut algorithmclose-enough arc routing problemclose-enough traveling salesman problemradio frequency identification

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• On the distance-constrained close enough arc routing problem
• A matheuristic for the distance-constrained close-enough arc routing problem
• The min-max close-enough arc routing problem
• The Stochastic Close-Enough Arc Routing Problem
• Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem

Cites work

• A branch-and-cut algorithm for the undirected rural postman problem
• A comparison of two different formulations for arc routing problems on mixed graphs
• A computational study of several heuristics for the DRPP
• A cutting plane algorithm for the general routing problem
• An algorithm for the Rural Postman problem on a directed graph
• Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
• Heuristics for the multi-vehicle covering tour problem
• 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\}\)
• The Covering Tour Problem

Cited in

(25)

• Nearest route problem
• The generalized arc routing 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
• 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
• A branch-and-bound algorithm for the close-enough traveling salesman problem
• The balanced billing cycle vehicle routing problem
• The close enough traveling salesman problem: a discussion of several heuristics
• Advances in meter Reading: heuristic solution of the close enough traveling salesman problem over a street network
• The Stochastic Close-Enough Arc Routing Problem
• The rescheduling arc routing problem
• An improved multi-objective framework for the rich arc routing problem
• A multi‐vehicle covering tour problem with speed optimization
• Arc routing problems: A review of the past, present, and future
• On approximate data reduction for the Rural Postman Problem: Theory and experiments
• An updated annotated bibliography on arc routing problems
• Exploring roadside management optimisation opportunities: a systematic review on arc routing problems applications and modelling
• On the hierarchical directed capacitated arc routing problem
• Energy management for electric vehicles in facility logistics: a survey from an operational research perspective

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

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