A grid-based ant colony algorithm for automatic 3D hose routing

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2574

Full metadata record

DC Field	Value	Language
dc.contributor.author	Thantulage, G	-
dc.contributor.author	Kalganova, T	-
dc.contributor.author	Fernando, WAC	-
dc.coverage.spatial	8	en
dc.date.accessioned	2008-08-07T12:56:58Z	-
dc.date.available	2008-08-07T12:56:58Z	-
dc.date.issued	2006	-
dc.identifier.citation	IEEE Congress on Evolutionary Computation, CEC 2006. Vancouver, Canada, July 2006. pp. 48 – 55.	en
dc.identifier.isbn	0-7803-9487-9	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/2574	-
dc.description.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.	en
dc.format.extent	502406 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	IEEE	en
dc.title	A grid-based ant colony algorithm for automatic 3D hose routing	en
dc.type	Conference Paper	en
dc.identifier.doi	http://dx.doi.org/10.1109/CEC.2006.1688289	-
Appears in Collections:	Electronic and Computer Engineering Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:

File	Description	Size	Format
PID226286-1 - Gishantha.pdf		490.63 kB	Adobe PDF	View/Open