On the exact number of possibilities for cutting and reconnecting the tour of a traveling salesman with Lin-k-Opts
Guenther Stattenberger, Markus Dankesreiter, Florian Baumgartner, Johannes J. Schneider
Abstract
When trying to find approximate solutions for the Traveling Salesman Problem with heuristic optimization algorithms, small moves called Lin-k-Opts are often used. In our paper, we provide exact formulas for the numbers of possible tours into which a randomly chosen tour can be changed with a Lin-k-Opt.
Create a lesson
Related papers
Self-Adaptive Model-Order Reduction for Shock-Dominated Problems
Ali Mohaghegh, Cheng Huang
A quantum algorithm for meshless lattice Boltzmann method with unitary interpolation
Chi Zhang, Hefeng Wang, Hua Xiang
FDTD Model of Noise Pollution from an AI Data Center
Gavin Buxton
Physical-state supervision for design-only Gaussian process surrogates of implosion simulations
Chang Liu, Hao Shen, Chuanying Li
Energy-dependent trapping of backscattered helium during magnetron sputtering growth: A molecular dynamics study
Pascal Brault, Anne-Lise Thomann, Alejandro Borroto
Alter-excitons in Altermagnets: Symmetry, Splitting and Dispersion
Yuanfan Xiong, Liangyu Wang, Xuan Wu et al.