A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Grid Based And Random Based Ant Colony Algorithms For Automatic Hose Routing In 3D Space
2008
Zenodo
Ant Colony Algorithms have been applied to difficult combinatorial optimization problems such as the travelling salesman problem and the quadratic assignment problem. In this paper gridbased and random-based ant colony algorithms are proposed for automatic 3D hose routing and their pros and cons are discussed. The algorithm uses the tessellated format for the obstacles and the generated hoses in order to detect collisions. The representation of obstacles and hoses in the tessellated format
doi:10.5281/zenodo.1329449
fatcat:uaqqmdrk7bbwfhwle5tghtq5ra