A graph-theoretic-based meta-heuristic algorithm for solving cooperative dynamic facility layout problems
Amir Saman Kheirkhah and
Masume Messi Bidgoli
International Journal of Process Management and Benchmarking, 2018, vol. 8, issue 3, 340-366
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.
Keywords: dynamic facility layout design; material handling system design; graph theory; multi-criteria shortest path; simulated annealing. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.inderscience.com/link.php?id=92892 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijpmbe:v:8:y:2018:i:3:p:340-366
Access Statistics for this article
More articles in International Journal of Process Management and Benchmarking from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().