Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/2574
Title: A grid-based ant colony algorithm for automatic 3D hose routing
Authors: Thantulage, G
Kalganova, T
Fernando, WAC
Issue Date: 2006
Publisher: IEEE
Citation: IEEE Congress on Evolutionary Computation, CEC 2006. Vancouver, Canada, July 2006. pp. 48 – 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.
URI: http://bura.brunel.ac.uk/handle/2438/2574
DOI: http://dx.doi.org/10.1109/CEC.2006.1688289
ISBN: 0-7803-9487-9
Appears in Collections:Electronic and Computer Engineering
Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
PID226286-1 - Gishantha.pdf490.63 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.