Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
From MaRDI portal
Publication:3439977
DOI10.1007/978-0-387-48793-9_10zbMath1278.90335OpenAlexW33566489MaRDI QIDQ3439977
Ming Chen, Ning Yang, Jing Dong
Publication date: 21 May 2007
Published in: Operations Research/Computer Science Interfaces Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-48793-9_10
Related Items (14)
A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem ⋮ Data-driven optimization and statistical modeling to improve meter reading for utility companies ⋮ A novel discretization scheme for the close enough traveling salesman problem ⋮ The profitable close-enough arc routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ Results for the close-enough traveling salesman problem with a branch-and-bound algorithm ⋮ A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem ⋮ An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem ⋮ Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network ⋮ A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands ⋮ The travelling salesman problem with neighbourhoods: MINLP solution ⋮ On the distance-constrained close enough arc routing problem ⋮ Solving the close-enough arc routing problem ⋮ Spatial coverage in routing and path planning problems
Uses Software
This page was built for publication: Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
