ON THE USE OF LYTLE’S ALGORITHM FOR SOLVING TRAVELING SALESMAN PROBLEM AT DEVELOPING SUBURBAN ROUTE

Abstract

Lytle’s algorithm is described as proposed for an accurate solution of the salesman Problem. Statistical characteristics of solution duration with lytle’s algorithm of some problems and of their modifications are specified. On the basis of the results obtained the limits for the algorithm practical specification in the preparation of the route network are given.

Keywords

• Salesman
• Distance
• Algorithm
• Matrix
• Boundaries
• Experiment
• Route network