Solving stochastic dynamic facility layout problems using proposed hybrid AC-CS-SA meta-heuristic algorithm Online publication date: Tue, 12-Dec-2017
by Ghorbanali Moslemipour; T.S. Lee; Y.T. Loong
International Journal of Industrial and Systems Engineering (IJISE), Vol. 28, No. 1, 2018
Abstract: This paper proposes a novel hybrid algorithm in which simulated annealing algorithm starts with a population of good initial solutions constructed by combining ant colony, clonal selection, and robust layout design approaches. The proposed algorithm can be used to solve a dynamic (multi-period) facility layout problem in both deterministic and stochastic cases. In the stochastic environment, product demands are assumed to be normally distributed random variables with known probability density function that changes from period to period at random. In addition, a quadratic assignment-based mathematical model, which is used in the proposed hybrid algorithm, is developed to design a robust layout for the stochastic dynamic layout problem. Finally, the performance of the proposed algorithm is evaluated by solving a large number of randomly generated test problems and some test problems from the literature in stochastic and deterministic cases respectively. The results show that the hybrid algorithm has an outstanding performance from both solution quality and computational time points of view.
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 Industrial and Systems Engineering (IJISE):
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