{"id":{"repo_id":"uoit","oai_identifier":"oai:ontariotechu.scholaris.ca:10155/1289"},"canonical_url":"https://search.dev.ndltd.org/etd/uoit/oai:ontariotechu.scholaris.ca:10155/1289","repository":{"repo_id":"uoit","name":"Ontario Institute of Technology","base_url":"https://ontariotechu.scholaris.ca/server/oai/request"},"display":{"title":"Application of traveling salesman problem in generating a collision-free tool path in drilling","abstract":"In machining, the tool path is generated according to the workpiece geometry and arrangement of holes. Majority of Computer Aided Manufacturing (CAM) software offer a set of predefined strategies to choose from. These tool paths are mostly far from being the optimum path, specifically for complex geometries with non-flat surfaces. This thesis introduces a new algorithm based on Travelling Salesman Problem (TSP). The proposed local search algorithm generates an optimum collision free tool path in drilling operations. The developed optimization algorithm considers multiple constraints such as location of tool origin and presence of obstacles. Furthermore, a discussion on stopping criteria for the developed algorithm is presented. Obtained results confirm the proposed algorithm is capable of providing optimum collision free path with more than 50% reduction (in given examples) in path length compared to the HSMWorks software.","abstract_html":"In machining, the tool path is generated according to the workpiece geometry and arrangement of holes. Majority of Computer Aided Manufacturing (CAM) software offer a set of predefined strategies to choose from. These tool paths are mostly far from being the optimum path, specifically for complex geometries with non-flat surfaces. This thesis introduces a new algorithm based on Travelling Salesman Problem (TSP). The proposed local search algorithm generates an optimum collision free tool path in drilling operations. The developed optimization algorithm considers multiple constraints such as location of tool origin and presence of obstacles. Furthermore, a discussion on stopping criteria for the developed algorithm is presented. Obtained results confirm the proposed algorithm is capable of providing optimum collision free path with more than 50% reduction (in given examples) in path length compared to the HSMWorks software.","abstract_has_math":false,"creators":["Khodabakhshi, Zahra"],"institution":"University of Ontario Institute of Technology","degree_name":"Master of Applied Science (MASc)","degree_level":null,"degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Hosseini, Sayyed Ali"],"committee_chairs":[],"committee_members":[],"year":2021,"date_issued":"2021-04-01","date_published":"2021-04-01","updated_at":"2026-07-24T05:35:22Z","subjects":["Drilling","Tool path optimization","Collision-free tool path","TSP","Local search method"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10155/1289","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Hosseini, Sayyed Ali"]},{"key":"dc:creator","label":"Author","values":["Khodabakhshi, Zahra"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2021-05-25T18:59:18Z","2022-03-29T16:46:35Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2021-05-25T18:59:18Z","2022-03-29T16:46:35Z"]},{"key":"dc:date.issued","label":"Date","values":["2021-04-01"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Applied Science (MASc)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Ontario Institute of Technology"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Drilling","Tool path optimization","Collision-free tool path","TSP","Local search method"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10155/1289"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In machining, the tool path is generated according to the workpiece geometry and arrangement of holes. Majority of Computer Aided Manufacturing (CAM) software offer a set of predefined strategies to choose from. These tool paths are mostly far from being the optimum path, specifically for complex geometries with non-flat surfaces. This thesis introduces a new algorithm based on Travelling Salesman Problem (TSP). The proposed local search algorithm generates an optimum collision free tool path in drilling operations. The developed optimization algorithm considers multiple constraints such as location of tool origin and presence of obstacles. Furthermore, a discussion on stopping criteria for the developed algorithm is presented. Obtained results confirm the proposed algorithm is capable of providing optimum collision free path with more than 50% reduction (in given examples) in path length compared to the HSMWorks software."]},{"key":"dc:title","label":"Title","values":["Application of traveling salesman problem in generating a collision-free tool path in drilling"]}]}],"canonical_facts":{"dc:contributor.advisor":["Hosseini, Sayyed Ali"],"dc:creator":["Khodabakhshi, Zahra"],"dc:date.accessioned":["2021-05-25T18:59:18Z","2022-03-29T16:46:35Z"],"dc:date.available":["2021-05-25T18:59:18Z","2022-03-29T16:46:35Z"],"dc:date.issued":["2021-04-01"],"dc:description.abstract":["In machining, the tool path is generated according to the workpiece geometry and arrangement of holes. Majority of Computer Aided Manufacturing (CAM) software offer a set of predefined strategies to choose from. These tool paths are mostly far from being the optimum path, specifically for complex geometries with non-flat surfaces. This thesis introduces a new algorithm based on Travelling Salesman Problem (TSP). The proposed local search algorithm generates an optimum collision free tool path in drilling operations. The developed optimization algorithm considers multiple constraints such as location of tool origin and presence of obstacles. Furthermore, a discussion on stopping criteria for the developed algorithm is presented. Obtained results confirm the proposed algorithm is capable of providing optimum collision free path with more than 50% reduction (in given examples) in path length compared to the HSMWorks software."],"dc:identifier.uri":["https://hdl.handle.net/10155/1289"],"dc:language.iso":["en"],"dc:subject":["Drilling","Tool path optimization","Collision-free tool path","TSP","Local search method"],"dc:title":["Application of traveling salesman problem in generating a collision-free tool path in drilling"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_name":["Master of Applied Science (MASc)"],"thesis:institution_name":["University of Ontario Institute of Technology"]},"updated_at":"2026-07-24T05:35:22Z"}