Comparison of two modified meta-heuristic soft algorithms for solving a bi-objective facility layout problem
by Amir Abbas Shojaie; Seyed Esmail Seyedi Bariran
International Journal of Mathematics in Operational Research (IJMOR), Vol. 16, No. 3, 2020

Abstract: Facility layout problem (FLP) is one of the most important location analysis problems in operation research and computational geometry. This paper presents a novel optimisation model-based two meta-heuristics of particle swarm optimisation (PSO) and parallel simulated annealing (SA). Then, the problem is solved using the modified algorithms to determine the total material handling cost and dead space. The results obtained from the two proposed models are then compared and analysed by referring to two well-known previous approaches to find the optimal solution for the problem. The obtained results show that the modified PSO and SA algorithms outperform the previous two methods and therefore can be effectively as an optimal solution for certain bi-objective facility layout problems.

Online publication date: Mon, 27-Apr-2020

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 Mathematics in Operational Research (IJMOR):
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