IntraClusTSP—An Incremental Intra-Cluster Refinement Heuristic Algorithm for Symmetric Travelling Salesman Problem

IntraClusTSP—An Incremental Intra-Cluster Refinement Heuristic Algorithm for Symmetric Travelling Salesman Problem

The Symmetric Traveling Salesman Problem (sTSP) is an intensively studied NP-hard problem. It has many important real-life applications such as logistics, planning, manufacturing of microchips and DNA sequencing. In this paper we propose a cluster level incremental tour construction method called In...

Full description

Bibliographic Details
Main Authors: László Kovács, László Barna Iantovics, Dimitris K. Iakovidis
Format: Article
Language:English
Published: MDPI AG 2018-11-01
Series:Symmetry
Subjects:
Symmetric Traveling Salesman Problem
symmetry
symmetric distance matrix
Nearest Neighbour method
Chained Lin-Kernighan refinement algorithm
Intra-cluster Refinement
clustering
optimal number of clusters
similar elements
Online Access:https://www.mdpi.com/2073-8994/10/12/663

Similar Items

Similar Items