Paper Info
Title
A Grid-Based Ant Colony Algorithm For Automatic 3d Hose Routing
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.
Year
DOI
Venue
2006
10.1109/CEC.2006.1688289
2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6
Keywords
Field
DocType
traveling salesman problem,evolutionary computation,quadratic assignment problem,ant colony algorithm
Ant colony optimization algorithms,Mathematical optimization,Extremal optimization,Quadratic assignment problem,Computer science,Algorithm,Combinatorial optimization,Greedy algorithm,Travelling salesman problem,2-opt,Ant colony
Conference
Citations 
PageRank 
References 
0
0.34
4
Authors
3
Name
Order
Citations
PageRank
Gishantha Thantulage100.34
Tatiana Kalganova219515.96
W. A. C. Fernando38610.38