An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem

DOI10.1287/ijoc.2020.0962OpenAlexW3084898662MaRDI QIDQ5148188

Bruce L. Golden, Carmine Cerrone, Francesco Carrabs, Raffaele Cerulli

Publication date: 1 February 2021

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

Full work available at URL: https://doi.org/10.1287/ijoc.2020.0962

zbMATH Keywords

traveling salesman problemdronesneighborhoodscarousel greedyclose-enough

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items

A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance, Results for the close-enough traveling salesman problem with a branch-and-bound algorithm, The generalized close enough traveling salesman problem, A biased random-key genetic algorithm for the set orienteering problem, Spatial coverage in routing and path planning problems

Cites Work

• Unnamed Item
• Approximation algorithms for the Geometric Covering Salesman Problem
• On implementing a primal-dual interior-point method for conic quadratic optimization
• A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem
• A novel discretization scheme for the close enough traveling salesman problem
• Carousel greedy: a generalized greedy algorithm with applications in optimization
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
• Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• The Covering Tour Problem
• Approximation algorithms for TSP with neighborhoods in the plane
• The vehicle routing problem with drones: Extended models and connections
• The Covering Salesman Problem