A novel two-stage approach for solving a bi-objective facility layout problem
by Arash Mohamadi; Sadoullah Ebrahimnejad; Reza Tavakkoli-Moghaddam
International Journal of Operational Research (IJOR), Vol. 31, No. 1, 2018

Abstract: This paper presents a new heuristic algorithm for a facility layout problem in order to determine the entry order of departments and arrange them adjacent to each other. Additionally, another algorithm is developed to optimise the facility layout that minimises bi-objectives including the total material handling cost and dead space simultaneously. The optimised facility layout is determined by the use of three meta-heuristic algorithms, namely genetic algorithm (GA), particle swarm optimisation (PSO) and parallel simulated annealing (SA). This can be considered as a novel two-stage approach. The arrangement of facilities obtained by this approach is compared with the results of two other methods proposed in the literature. The comparison of the results shows the superiority of the proposed algorithms as compared to previous work. Furthermore, among the three algorithms, PSO and SA resulted in better overall performance with respect to cost and running time.

Online publication date: Tue, 12-Dec-2017

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 Operational Research (IJOR):
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