Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
From MaRDI portal
Publication:3564373
DOI10.1007/978-0-387-77778-8_22zbMath1190.90169OpenAlexW164042131MaRDI QIDQ3564373
Bruce L. Golden, Edward A. Wasil, Susan A. Smith, Robert Shuttleworth
Publication date: 2 June 2010
Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_22
traveling salesman problemradio frequency identificationmeter readingclose enough traveling salesman problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance, Data-driven optimization and statistical modeling to improve meter reading for utility companies, A novel discretization scheme for the close enough traveling salesman problem, An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem, A Markov decision process model on dynamic routing for target surveillance, The profitable close-enough arc routing problem, A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods, 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, The generalized close enough traveling salesman problem, 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, An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem, A matheuristic for the distance-constrained close-enough arc routing problem, Mixed integer formulations for a routing problem with information collection in wireless networks, On the distance-constrained close enough arc routing problem, Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem, Spatial coverage in routing and path planning problems, The min-max close-enough arc routing problem
Cites Work
- Unnamed Item
- A tiling and routing heuristic for the screening of cytological samples
- Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
- The Covering Tour Problem
- Approximation algorithms for TSP with neighborhoods in the plane
- Fast heuristics for large scale covering-location problems
