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

Authors:
J. R. King;X. Y. Zhang;G. H. Jin
Affiliations:
The Management School, Imperial College of Science and Technology, London SW7 2P6, England;Department of Economic Information Management, Shanghai University of Finance and Economics, China;Department of Industrial Management, Shanghai Building Material Industrial College, China
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1990

Citing 5
Cited 0

Perspectives on vehicle routing: Exciting new developments

Operations Research
Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
Vehicle routing with time windows

Operations Research
A man-machine approach toward solving the traveling salesman problem

Communications of the ACM
Approximate algorithms for the traveling salesperson problem

SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)

Quantified Score

Hi-index	0.98

Visualization

Abstract

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.