%0 Journal Article
%T Application of Ant Colony Optimization for the Solution of 3 Dimensional Cuboid Structures
%A H¨ıseyin Eldem
%A Erkan ¨ılker
%J Journal of Computer and Communications
%P 99-107
%@ 2327-5227
%D 2014
%I Scientific Research Publishing
%R 10.4236/jcc.2014.24014
%X <p class=\"MsoNormal\">
	<span lang=\"EN-US\">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.</span>
</p>
%K Euclidean TSP
%K Ant Colony Optimization
%K Metaheuristic
%K Path-Relinking
%K Path Planning
%K Cuboid
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=43866