Multi objective ant colony algorithm for electrical wire routing
by W.P.J. Pemarathne; T.G.I. Fernando
International Journal of Swarm Intelligence (IJSI), Vol. 5, No. 1, 2020

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.

Online publication date: Mon, 06-Apr-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Swarm Intelligence (IJSI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com