An investigation of the robustness in the travelling salesman problem routes using special structured matrices
Document Type
Article
Publication Date
1-1-2020
Abstract
In this study, the robustness of the Travelling Salesman Problem (TSP) routes is investigated by recognising the special combinatorial structures of Kalmanson matrices. A recognition algorithm encompassing three procedures based on combinatorial and linear programming (LP) is developed and executed on several randomly generated instances. These procedures produce three lower bounds which provide guarantees on the optimality of the solutions. Computational experiments show that the proposed LP-based procedure performs efficiently well across all problem dimensions and provides the best lower bounds to the TSP. This is supported by an average deviation of less than 7% between the TSP tour lengths and the lower bounds of the Kalmanson matrices.
Keywords
Travelling salesman problem, Robustness, Special structured matrices, Combinatorial, Linear programming, Kalmanson
Divisions
Faculty_of_Business_and_Accountancy
Funders
None
Publication Title
International Journal of Systems Science: Operations & Logistics
Volume
7
Issue
2
Publisher
Taylor & Francis
Publisher Location
2-4 PARK SQUARE, MILTON PARK, ABINGDON OR14 4RN, OXON, ENGLAND