A Grid-based Ant Colony Algorithm for Automatic 3D Hose Routing

Author

Thantulage, G. ; Kalganova, T. ; Fernando, W.A.C.

Author_Institution

Bio Inspired Intelligent System Group (BIIS), School of Engineering and Design, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK (gishantha@ieee.org)

fYear

0

fDate

0-0 0

Firstpage

48

Lastpage

55

Abstract

Ant colony algorithms applied to difficult combinatorial optimization problems such as the traveling salesman problem (TSP) and the quadratic assignment problem. In this paper we propose a grid-based ant colony algorithm for automatic 3D hose routing. Algorithm uses the tessellated format of the obstacles and the generated hoses in order to detect collisions. The representation of obstacles and hoses in the tessellated format greatly helps the algorithm towards handling free-form objects and speed up the computations. The performance of the algorithm has been tested on a number of 3D models.

Keywords

assembling; evolutionary computation; travelling salesman problems; TSP; automatic 3D hose routine; collision detection; combinatorial optimization problems; grid-based ant colony algorithm; quadratic assignment problem; tessellated obstacles format; traveling salesman problem; Ant colony optimization; Application software; Assembly; Circuit testing; Hoses; Military computing; Routing; Telecommunication traffic; Traffic control; Traveling salesman problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2006. CEC 2006. IEEE Congress on

Conference_Location

Vancouver, BC

Print_ISBN

0-7803-9487-9

Type

conf

DOI

10.1109/CEC.2006.1688289

Filename

1688289