Non-greedy systematic neighbourhood search heuristic for multi-objective facility layout problem

Rajesh Matai, Surya Prakash Singh and Murari Lal Mittal

International Journal of Services and Operations Management, 2012, vol. 12, issue 1, 118-138

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.

Keywords: neighbourhood search; quadratic assignment problem; QAP; heuristic; multi-objective facility layout problem; MOFLP; facilities layout. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=46677 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:12:y:2012:i:1:p:118-138

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().