Non-greedy systematic neighbourhood search heuristic for multi-objective facility layout problem
by Rajesh Matai; Surya Prakash Singh; Murari Lal Mittal
International Journal of Services and Operations Management (IJSOM), Vol. 12, No. 1, 2012

Abstract: In this paper a non-greedy systematic neighbourhood search heuristic is presented for solving multi-objective facility layout problem. It can incorporate more than two objectives that may be qualitative or quantitative in nature. Computational results show superiority of our proposed heuristic algorithm than other algorithms available in literature. Finally, comparison was also made with best solution qualities for the 15 single objective test problems of Nugxx series taken from QAPLIB and this comparison also shows efficiency and effectiveness of proposed heuristic algorithm.

Online publication date: Sat, 23-Aug-2014

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 Services and Operations Management (IJSOM):
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