A graph-theoretic-based meta-heuristic algorithm for solving cooperative dynamic facility layout problems Online publication date: Mon, 02-Jul-2018
by Amir Saman Kheirkhah; Masume Messi Bidgoli
International Journal of Process Management and Benchmarking (IJPMB), Vol. 8, No. 3, 2018
Abstract: The dynamic facility layout problem (DFLP) is related to location of all facilities of a plant in a dynamic environment. Most of the existing models for this problem ignore competitive or cooperative reactions to one's action. In a recent work, the assumption of independency between parameters of material handling cost function has been relaxed and a game model has been presented. Two main shortcomings exist in this work. In one side, cooperation between decision makers is ignored. This matter could result to remove some better solutions that are not Nash equilibrium. On the other hand, computing Nash equilibrium takes much time. Then, Nash equilibrium maybe results in expensive solutions in cooperative conditions. In this paper, this real assumption is considered and by modelling the problem as a multi-criteria shortest path problem, a Pareto optimal solution is obtained. The numerical experiments confirm the effectiveness of the proposed model and solution method.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Process Management and Benchmarking (IJPMB):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook