{"title":"利用蚁群优化算法确定旅行商问题路线","authors":"B. P. Silalahi, Nur Fathiah, Prapto Tri Supriyo","doi":"10.15642/mantik.2019.5.2.100-111","DOIUrl":null,"url":null,"abstract":"Ant Colony Optimization is one of the meta-heuristic methods used to solve combinatorial optimization problems that are quite difficult. Ant Colony Optimization algorithm is inspired by ant behavior in the real world to build the shortest path between food sources and their nests. Traveling Salesman Problem is a problem in optimization. Traveling Salesman Problem is a problem to find the minimum distance from the initial node to the whole node with each node must be visited exactly once and must return to the initial node. Traveling Salesman Problem is a non-deterministic polynomial-time complete problem. This research discusses the solution of the Traveling Salesman Problem using the Ant Colony Optimization algorithm and also using the exact algorithm. The results showed that the greater the size of the Traveling Salesman Problem case, the longer the execution time required. The results also showed that the execution times of the Ant Colony Optimization are much faster than the execution time of the exact method.","PeriodicalId":32704,"journal":{"name":"Mantik Jurnal Matematika","volume":"82 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes\",\"authors\":\"B. P. Silalahi, Nur Fathiah, Prapto Tri Supriyo\",\"doi\":\"10.15642/mantik.2019.5.2.100-111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ant Colony Optimization is one of the meta-heuristic methods used to solve combinatorial optimization problems that are quite difficult. Ant Colony Optimization algorithm is inspired by ant behavior in the real world to build the shortest path between food sources and their nests. Traveling Salesman Problem is a problem in optimization. Traveling Salesman Problem is a problem to find the minimum distance from the initial node to the whole node with each node must be visited exactly once and must return to the initial node. Traveling Salesman Problem is a non-deterministic polynomial-time complete problem. This research discusses the solution of the Traveling Salesman Problem using the Ant Colony Optimization algorithm and also using the exact algorithm. The results showed that the greater the size of the Traveling Salesman Problem case, the longer the execution time required. The results also showed that the execution times of the Ant Colony Optimization are much faster than the execution time of the exact method.\",\"PeriodicalId\":32704,\"journal\":{\"name\":\"Mantik Jurnal Matematika\",\"volume\":\"82 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mantik Jurnal Matematika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15642/mantik.2019.5.2.100-111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mantik Jurnal Matematika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15642/mantik.2019.5.2.100-111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
Ant Colony Optimization is one of the meta-heuristic methods used to solve combinatorial optimization problems that are quite difficult. Ant Colony Optimization algorithm is inspired by ant behavior in the real world to build the shortest path between food sources and their nests. Traveling Salesman Problem is a problem in optimization. Traveling Salesman Problem is a problem to find the minimum distance from the initial node to the whole node with each node must be visited exactly once and must return to the initial node. Traveling Salesman Problem is a non-deterministic polynomial-time complete problem. This research discusses the solution of the Traveling Salesman Problem using the Ant Colony Optimization algorithm and also using the exact algorithm. The results showed that the greater the size of the Traveling Salesman Problem case, the longer the execution time required. The results also showed that the execution times of the Ant Colony Optimization are much faster than the execution time of the exact method.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
