Abstract
Ant colony optimisation algorithms have been applied to solve wide range of difficult combinatorial optimisation problems like routing problems, assigning problems, scheduling problems and revealed remarkable solutions. In this paper we present a novel approach of ant colony optimisation algorithm to solve the electrical cable routing problem. The study focuses on optimising wire lengths, number of bends and angles of bends. We have studied these objectives in cable routing and modified the ant colony system algorithm to get better solutions. Ants are directed to search for the optimal path between the starting and the ending points by avoiding the obstacles. While ants are navigating, they travel the paths with less number of bends and consider angles of the bends towards 90, 180, and 270 degrees. Normal walls are presented as a grid and doors, windows and other obstacles are represented as rectangles. The possible points to follow by ants are designed according to the BS 7671 (IET Wiring Regulations) standards. The results of the simulation prove with comparisons that this method is feasible and effective for optimising the electrical wire routing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
