𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A diagonal completion and 2-optimal procedure for the travelling salesman problem

✍ Scribed by J.R. King; X.Y. Zhang; G.H. Jin

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
934 KB
Volume
13
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

✦ Synopsis

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 good results without excessive demands on computer time. Computational experience with a variety of problems from small to large size is reported.

πŸ“œ SIMILAR VOLUMES

A branch-and-cut algorithm for the undir
A branch-and-cut algorithm for the undirected selective traveling salesman problem
✍ Gendreau, Michel; Laporte, Gilbert; Semet, FrοΏ½dοΏ½ric πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 120 KB πŸ‘ 2 views

The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits are associated with vertices and costs are associated with edges. Some vertices are compulsory. The aim is to construct a tour of maximal profit including all compulsory vertices and whose cost does not exceed a p