Determination of minimum cutting tool paths in the presence of barriers

Abstract A software package is described that finds a minimum path tour for traveling salesman problems with barriers or obstructions blocking straight line travel. The package contains modules to (1) determine whether or not nodes (destinations) can be connected by straight lines, (2) find the shortest path between pairs of nodes if barriers are present, and (3) compute the minimum tour to visit all nodes and avoid barriers. The user may choose a tour that minimizes distance or minimizes time of travel. The latter assumes constant accelerations and declerations, and steady state tool velocity. Illustrations and sample calculations are presented. The set of algorithms in the software package is a heuristic although some aspects such as the shortest path calculations are optimal.

[1]  Shu-Park Chan,et al.  A graph-theoretic approach to the IC layout resizing problem , 1980 .

[2]  T. C. Raymond.  Heuristic algorithm for the traveling-salesman problem , 1969 .

[3]  Stephen M. Pollock,et al.  MINIMUM-TRAJECTORY PIPE ROUTING , 1974 .

[4]  Bruce L. Golden,et al.  A statistical approach to the tsp , 1977, Networks.

[5]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[6]  Maurice Pollack,et al.  SOLUTIONS OF THE SHORTEST-ROUTE PROBLEM-A REVIEW , 1960 .

[7]  J. F. Woodward.  Introduction to Quantitative Methods , 1975 .

[8]  B. Golden.  Shortest-Path Algorithms: A Comparison , 1975 .

[9]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .

[10]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[11]  T. A. J. Nicholson,et al.  Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..

[12]  J. A. Hillier,et al.  A Method for Finding the Shortest Route Through a Road Network , 1960 .

[13]  Michael Ian Shamos,et al.  Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[14]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[15]  Victor O. K. Li,et al.  Finding minimum rectilinear distance paths in the presence of barriers , 1981, Networks.

[16]  Bruce L. Golden,et al.  Technical Note - Shortest-Path Algorithms: A Comparison , 1976, Oper. Res..

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  Leon Steinberg,et al.  Routing past unions of disjoint linear barriers , 1983, Networks.

[19]  Lawrence Bodin,et al.  Approximate Traveling Salesman Algorithms , 1980, Oper. Res..

[20]  G. Dantzig.  On the Shortest Route Through a Network , 1960 .