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

Authors: Rajesh Matai; Surya Prakash Singh; Murari Lal Mittal

Addresses: 1201-G, Management Department, FD-I, Birla Institute of Technology and Science Pilani, Pilani (Rajasthan), 333031, India. ' Department of Management Studies, Vishwakarma Bhawan, Indian Institute of Technology Delhi, New Delhi, 110016, India. ' Department of Mechanical Engineering, Malaviya National Institute of Technology Jaipur, J.L.N. Marg Jaipur, 302017, India

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.

DOI: 10.1504/IJSOM.2012.046677

International Journal of Services and Operations Management, 2012 Vol.12 No.1, pp.118 - 138

Published online: 23 Aug 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article