Abstract
Path optimization is desirable in many problem instances occurring in discrete manufacturing and pick and place technology. The problem may refer to applications ranging from two-dimensional movements such as in milling processes to three-dimensional movements required in many robotic operations. The optimal path can be found using tour construction techniques, sub tour elimination techniques and tour to tour improvement techniques. The limits to which these solution methodologies can be applied are restricted to a certain number of nodes. The optimal path for two- and three-dimensional TSP is determined using a stochastic search procedure based on a tour improvement technique. An optimal solution is presented for 500 node TSP in two dimensions. A procedure for finding optimal path for an even larger number of nodes is outlined. The optimal path in three dimensions is also presented using nodes distributed along the periphery of three-dimensional primitives. [S1087-1357(00)71601-7]
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
