The generalized close enough traveling salesman problem

DOI10.1016/j.ejor.2023.04.010MaRDI QIDQ6113445

Carmine Cerrone, Claudia Archetti, Andrea Di Placido, Bruce L. Golden

Publication date: 11 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

metaheuristicsgenetic algorithmsconic programmingclose enough traveling salesman problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Facility location problems on graphs with non-convex neighborhoods

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the Geometric Covering Salesman Problem
• 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
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
• A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
• 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
• An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: The generalized close enough traveling salesman problem