An Application of Heuristic Algorithms for the Large Scale Traveling Salesman Problem in Printed Circuit Board Production

회로기판 생산에서의 대형 외판원문제를 위한 경험적 해법의 응용

This study describes the important information for establishing Human Computer Interface System for solving the large scale Traveling Saleman Problem in Printed Circuit Board production. Appropriate types and sizes of partitioning of large scale problems are discussed. Optimal tours for the special patterns appeared in PCB's are given. The comparision of optimal solutions of non-Euclidean problems and Euclidean problems shows the possibilities of using human interface in solving the Chebyshev TSP. Algorithm for the large scale problem using described information and coputational result of the practical problem are given.