Application of Ant Colony Optimization for the Solution of 3 Dimensional Cuboid Structures  

作　　者：Hüseyin Eldem Erkan Ulker 

机构地区：[1]Computer Technologies Department,Karamanoglu Mehmetbey University,Karaman,Turkey [2]Computer Engineering Department,Selcuk University,Konya,Turkey

出　　处：《Journal of Computer and Communications》2014年第4期99-107,共9页电脑和通信（英文）

摘　　要：Traveling Salesman Problem (TSP) is one of the most widely studied real world problems of finding the shortest (minimum cost) possible route that visits each node in a given set of nodes (cities) once and then returns to origin city. The optimization of cuboid areas has potential samples that can be adapted to real world. Cuboid surfaces of buildings, rooms, furniture etc. can be given as examples. Many optimization algorithms have been used in solution of optimization problems at present. Among them, meta-heuristic algorithms come first. In this study, ant colony optimization, one of meta-heuristic methods, is applied to solve Euclidian TSP consisting of nine different sized sets of nodes randomly placed on a cuboid surface. The performance of this method is shown in tests.Traveling Salesman Problem (TSP) is one of the most widely studied real world problems of finding the shortest (minimum cost) possible route that visits each node in a given set of nodes (cities) once and then returns to origin city. The optimization of cuboid areas has potential samples that can be adapted to real world. Cuboid surfaces of buildings, rooms, furniture etc. can be given as examples. Many optimization algorithms have been used in solution of optimization problems at present. Among them, meta-heuristic algorithms come first. In this study, ant colony optimization, one of meta-heuristic methods, is applied to solve Euclidian TSP consisting of nine different sized sets of nodes randomly placed on a cuboid surface. The performance of this method is shown in tests.

关 键 词：Euclidean TSP Ant Colony Optimization METAHEURISTIC PATH-RELINKING Path Planning CUBOID 

分 类 号：O1[理学—数学]