6533b855fe1ef96bd12b15fc

RESEARCH PRODUCT

An Investigation of the Robustness in the Travelling Salesman Problem Routes Using Special Structured Matrices

Azmin Azliza AzizMohsen Mousavi AbdehgahMadjid TavanaSeyed Taghi Akhavan Niaki

subject

Travelling salesman problemlineaarinen optimointiKalmansonrobustnessspecial structured matricescombinatorialMathematicsofComputing_DISCRETEMATHEMATICS

description

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. peerReviewed

yearjournalcountryeditionlanguage
2020-01-01
http://urn.fi/URN:NBN:fi:jyu-202005143208