On the expected number of optimal and ne
β
Selim G. Akl
π
Article
π
1981
π
Elsevier Science
π
English
β 138 KB
An algorithm for empirically calculating the expected number of optimal and near-optimal solutions in a random Euclidean travelling salesman problem is presented. The algorithm is based on well known geometric properties of the optimal tour. For problems involving up to 15 points uniformily distribu