Statistical Approach for Estimation and Optimization of Tours in Networks with Parametric Analysis

Traveling Salesman Problem (TSP) consider as a model optimization problem in mathematics, OR and computer science. TSP is not confined to salesman but attracting many industrial problems in the field of AI, Operations Research, algorithm design and analysis. It aims to find efficient routes or tours through a network to optimize certain objectives, like minimizing travel time, cost, or distance. In this study, applied an iterative approach based on efficient heuristic algorithm for combinatorial optimization and estimation of Travelling salesman problem. Objectives of the present work considered three-fold criteria as efficiency, accuracy and evaluation. Further, a parametric analysis applied to test the feasibility of the approach using numerical problems. The same problem also arises in a number of industrial problems. In some cases, it is desirable to plan a cyclic schedule of production, automatic drill a sheet and pattern design.