Investigating the performance of bees algorithm in solving quadratic assignment problems Online publication date: Thu, 30-Sep-2010
by Chew Wei Fon, Kuan Yew Wong
International Journal of Operational Research (IJOR), Vol. 9, No. 3, 2010
Abstract: One of the issues in the manufacturing industry is designing an arrangement of facilities where the layout can minimise the material-handling cost. This issue is known as a facility layout problem (FLP). To date, bees algorithm has evolved as a new meta-heuristic which was inspired by the food foraging behaviour of honey bees. This paper describes the first application of bees algorithm in solving FLP which has been modelled as quadratic assignment problem (QAP). A new bees algorithm is proposed and formulated, and it is tested using numerous problems taken from QAPLIB – an international renowned database that provides QAP cases. The performance of the proposed algorithm is evaluated in terms of its solution quality and computational time. Furthermore, the solutions generated by the algorithm are compared with the existing best known solutions published in the literature. The experimental results show that the algorithm is very successful in solving small problem instances which have up to 20 facilities.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Operational Research (IJOR):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook