𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Identification of non-optimal arcs for the travelling salesman problem

✍ Scribed by Roy Jonker; Ton Volgenant

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
358 KB
Volume
1
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A diagonal completion and 2-optimal proc
A diagonal completion and 2-optimal procedure for the travelling salesman problem
✍ J.R. King; X.Y. Zhang; G.H. Jin πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 934 KB

A fast diagonal completion algorithm is developed for constructing a good initial feasible solution for travelling salesman problems. The algorithm can be combined with any tour improvement approach but is specifically considered here in conjunction with the 2-optimal method which is shown to give g

On the expected number of optimal and ne
On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem
✍ 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