An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem

DOI10.1287/ijoc.2013.0574zbMath1304.90142OpenAlexW2018702978MaRDI QIDQ2940530

J. Cole Smith, Behnam Behdani

Publication date: 27 January 2015

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a0190c1560d7d6f8ed9cf35f4112c0e623603c73

zbMATH Keywords

discretizationcomputational geometrymixed-integer programmingclose-enough traveling salesman problemgeometric routing problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem ⋮ 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 ⋮ 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 ⋮ 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 ⋮ The generalized close enough traveling salesman problem ⋮ 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 ⋮ On the distance-constrained close enough arc routing problem ⋮ Spatial coverage in routing and path planning problems

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• The bi-objective covering tour problem
• Approximation algorithms for the Geometric Covering Salesman Problem
• Approximation algorithms for lawn mowing and milling
• The Polygon Exploration Problem
• Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• The prize collecting traveling salesman problem
• The Covering Tour Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Approximation algorithms for TSP with neighborhoods in the plane
• The Covering Salesman Problem
• Optimal Covering Tours with Turn Costs

This page was built for publication: An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem