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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
