A novel discretization scheme for the close enough traveling salesman problem

DOI10.1016/J.COR.2016.09.003zbMath1391.90506OpenAlexW2519109668MaRDI QIDQ1652067

Francesco Carrabs, Raffaele Cerulli, Manlio Gaudioso, Carmine Cerrone

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.09.003

zbMATH Keywords

discretization schemeclose-enough traveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (15)

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 ⋮ The profitable close-enough arc routing problem ⋮ A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ On hub location problems in geographically flexible networks ⋮ 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 ⋮ An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem ⋮ Same-day delivery with pickup stations and autonomous vehicles ⋮ On the distance-constrained close enough arc routing problem ⋮ A biased random-key genetic algorithm for the set orienteering problem ⋮ Using tornado-related weather data to route unmanned aerial vehicles to locate damage and victims ⋮ Spatial coverage in routing and path planning problems

Cites Work

• Approximation algorithms for the Geometric Covering Salesman Problem
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
• Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
• Approximation algorithms for TSP with neighborhoods in the plane
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A novel discretization scheme for the close enough traveling salesman problem