Developing Dynamic Facility Layout Problem with Single-Solution and Population-Based Metaheuristics Methods

Subject Areas : Industrial Management

Mohammad Mahdi Karampour ¹ , Mostafa Hajiaghaei-Keshteli ²

1 - M.A. in industrial engineering, department of industrial engineering, university of science and technology of Mazandaran, Behshahr
2 - Assistant professor, department of industrial engineering, university of science and technology of Mazandaran, Behshahr Email: [e-mail]

Received: 2018-06-02 Accepted : 2018-06-02 Published : 2018-05-22

Keywords:

Abstract :

In modern societies, production centers should be able to supply the variety of demand and type of productions correctly, exactly, clearly and straightly. So, this study aims to present the dynamic facility layout problem (DFLP) in order to minimize the total cost of the facilities and costumes. Design an optimal plan leads to reduce the production process and cost of inventory. Transportation cost plays a key-role to specify the performance designing of part systems. This content displays the Dynamic Facility Location Problem (DFLP) in this paper. In order to handle the proposed problem, five metaheuristic methods are introduced: Genetic Algorithm (GA), Simulated Annealing (SA), Tabu Search (TS), Particle Swarm Optimization (PSO) and Imperialist Competitive Algorithm (ICA) are tackled to solve the problem. Taguchi approach is considered to select the proper values for presented algorithms. The results explain that proposed methods are provided the optimal design for the dynamic facility location problem. As a result, ICA and PSO reach the most performance output in the comparison of other algorithms with assumed conditions in the problem.  

References:

1. Armour, G. C. (1963). A heuristic algorithm and simulation approach to relative location of facilities. Management Science , 9(2), 294-309.


2. Balakrishnan J, &. C. (2000). Genetic search and the dynamic layout problem. Computers & Operations Research , 27(6):587–593.


3. Balakrishnan, J. C. (2000). An improved pair-wise exchange heuristic for the dynamic plant layout problem. International Journal of Production Research , 38(13), 3067-3077.


4. Balakrishnan, J. C. (2003). A hybrid genetic algorithm for the dynamic plant layout problem. International Journal of Production Economics , 86(2), 107-120.


5. BaykasogluA, &. G. (2001). A simulated annealing algorithm for dynamic facility layout problem. . Computers & Operations Research , 28(14):1403–26.


6. Burkard RE, &. B. (1983). A heuristic for quadratic Boolean problems with application to quadratic assignment problem. European Journal of Operational Research , 13:374–86.


7. Conway, D. G. (1994). Genetic search and the dynamic facility layout problem. Computers & Operations Research , 21(8), 955-960.


8. Erel E, G. J. (2003). New heuristic for the dynamic layout problem. . Journal of the Operational Research Society , 54:1275–82.


9. Gomory RE, &. H. (1961). Multi-terminal network flows. SIAM Journal , 9:551–70.


10. Hajiaghaei-Keshteli, M. &. (2010). Deriving the cost function for a class of three-echelon inventory system with N-retailers and one-for-one ordering policy. The International Journal of Advanced Manufacturing Technology , 50(1-4), 343.


11. Hajiaghaei-Keshteli, M. S. (2011). Determination of the economical policy of a three-echelon inventory system with (R, Q) ordering policy and information sharing. The International Journal of Advanced Manufacturing Technology , 55(5-8), 831-841.


12. Kaku, B. K. (1997). A tabu-search heuristic for the dynamic plant layout problem. INFORMS Journal on Computing , 9(4), 374-384.


13. Lacksonen TA, &. E. (1993). Quadratic assignment algorithms for the dynamic layout problem. International Journal of Production Research , 31(3):503–17.


14. McKendall, A. R. (2006). Hybrid ant systems for the dynamic facility layout problem. Computers & Operations Research , 33(3), 790-803. .


15. Pardalos PH, &. C. (1989). Proceedings of the 1989 supercomputer conference. In A parallel algorithm for the QAP. (pp. p. 351–60.). New York: ACM Press.


16. Pourvaziri, H. &. (2014). A hybrid multi-population genetic algorithm for the dynamic facility layout problem. Applied Soft Computing , 24, 457-469.


17. Rosenblatt, M. J. (1986). The dynamics of plant layout. Management Science , 32(1), 76-86.


18. Tompkins, J. A. (1996). Facilities Planning. 2 nd edn(New York: Wiley).


19. Urban, T. (1993). A heuristic for the dynamic facility layout problem. IIE Transactions , 25(4):57–63.