A new heuristic approach for solving facility layout problem
by Rajesh Matai; Surya Prakash Singh; Murari Lal Mittal
International Journal of Advanced Operations Management (IJAOM), Vol. 5, No. 2, 2013

Abstract: This paper proposes a new heuristic approach for solving facility layout problem (FLP) which is traditionally formulated as quadratic assignment problem (QAP). In this paper, FLP is formulated as linear assignment problem (LAP) consisting of facility pair and location pair. Being linear in nature LAP can be solved efficiently. Solution of LAP provides lower bound on corresponding QAP formulation of FLP. Heuristic procedure is applied to solve FLP from sets of LAP solution. Proposed heuristic is tested on benchmark instances taken from literature and compared with other heuristics available in literature. Computational results show that proposed heuristic provides a good quality approximate solution. This solution can be taken as initial solution for any improvement heuristic to get optimal/near optimal solution for FLP.

Online publication date: Mon, 28-Apr-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 Advanced Operations Management (IJAOM):
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