On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices

Authors:
Vladimir G. Deĭneko;Dvir Shabtay;George Steiner
Affiliations:
Warwick Business School, The University of Warwick, Coventry, UK CV4 7AL;Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Operations Management Area, Michael G. DeGroote School of Business, McMaster University, Hamilton, Canada
Venue:
Journal of Heuristics
Year:
2011

Citing 6
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
The product matrix traveling salesman problem: an application and solution heuristic

Operations Research
Perspectives of Monge properties in optimization

Discrete Applied Mathematics
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

SIAM Review
Scheduling of parts and robot activities in a two machine robotic cell

Computers and Operations Research - Special issue on the traveling salesman problem
Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine the performance of different subtour-patching heuristics for solving the strongly $\mathcal{NP}$ -hard traveling salesman problem (TSP) on permuted Monge matrices. We prove that a well-known heuristic is asymptotically optimal for the TSP on product matrices and k-root cost matrices. We also show that the heuristic is provably asymptotically optimal for general permuted Monge matrices under some mild conditions. Our theoretical results are strongly supported by the findings of a large-scale experimental study on randomly generated numerical examples, which show that the heuristic is not only asymptotically optimal, but also finds optimal TSP tours with high probability that increases with the problem size. Thus the heuristic represents a practical tool to solve large instances of the problem.