A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance

DOI10.1016/j.cor.2022.105831OpenAlexW4224222848MaRDI QIDQ2147130

Carmine Cerrone, Andrea Di Placido, Claudia Archetti

Publication date: 22 June 2022

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

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

zbMATH Keywords

genetic algorithmconic programmingclose-enough TSPsolar panel diagnosis

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

The generalized close enough traveling salesman problem

Cites Work

• 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
• 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
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• 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
• Unnamed Item
• Unnamed Item