Abstract
This paper solves the problem of computing the shortest Euclidean path touring n disjoint circles in 2D which is a generalization of the Travelling Salesman Problem (TSP) in Euclidean 2D plane and is not purely combinatorial. Based on the author’s previous work and the philosophy of Branch-andBound (B&B), this work presents a new exact algorithm to solve the problem. The empirical results have shown the correctness and the performance of the proposed algorithm dealing with a small number of circles. The proposed algorithm can be conducted in layered manufacturing of rapid prototyping, displacement of wireless sensor networks, or other related computer-aided design and manufacturing applications.
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 callMore From: International Journal of Advancements in Computing Technology
Disclaimer: 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.
