An Efficient Tour Construction Heuristic for Generating the Candidate Set of the Traveling Salesman Problem with Large Sizes

An Efficient Tour Construction Heuristic for Generating the Candidate Set of the Traveling Salesman Problem with Large Sizes

In this paper, we address the challenge of creating candidate sets for large-scale Traveling Salesman Problem (TSP) instances, where choosing a subset of edges is crucial for efficiency. Traditional methods for improving tours, such as local searches and heuristics, depend greatly on the quality of...

Full description

Bibliographic Details
Main Authors: Boldizsár Tüű-Szabó, Péter Földesi, László T. Kóczy
Format: Article
Language:English
Published: MDPI AG 2024-09-01
Series:Mathematics
Subjects:
fuzzy clustering
candidate set
TSP
heuristic
Online Access:https://www.mdpi.com/2227-7390/12/19/2960

Similar Items

Similar Items