Mathematical formulation and hybrid meta-heuristic solution approaches for dynamic single row facility layout problem
- PDF / 2,147,640 Bytes
- 24 Pages / 439.37 x 666.142 pts Page_size
- 14 Downloads / 204 Views
Mathematical formulation and hybrid meta-heuristic solution approaches for dynamic single row facility layout problem 1 · Sadegh Niroomand2 Ramazan Sahin ¸ Saber Molla-Alizadeh-Zavardehi3
· Esra Duygu Durmaz1 ·
© Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract In this study, for the first time, the classical single row facility layout problem is extended to its dynamic type by considering several planning periods. This new problem consists of two types of costs e.g. material handling cost and rearrangement cost of the departments at the beginning of each period. The problem is formulated by a mixed integer linear programming model. Because of the high complexity of the problem, two well-known meta-heuristic algorithms e.g. the GA and the SA are proposed to solve the problem. In addition, both of the algorithms are hybridized considering the restart and acceptance probability strategies. In order to study the performance of the proposed algorithms, 20 benchmark problems are generated randomly. Considering one of the generated benchmarks, the parameters of the algorithms are tuned by a typical method and final experiments are performed accordingly. The obtained results strongly prove the superiority of the SA hybridized by the restart strategy as it shows much better performance comparing to other proposed algorithms in more than 60% of the benchmarks. Keywords Dynamic single row facility layout problem · NP-hard problem · Meta-heuristic algorithm · Restart strategy · Parameter tuning
1 Introduction The layout of a manufacturing facility is one of the most important factors affecting its efficiency. Tompkins et al. (2003) stated that 20–50% of the total operating costs in a factory is related to the material handling. The authors has also stated that at least 10–30% of material handling costs can be reduced by only optimizing the layout of factory. Therefore, the problem
B
Sadegh Niroomand [email protected]
1
Department of Industrial Engineering, Faculty of Engineering, Gazi University, Ankara, Turkey
2
Department of Industrial Engineering, Firouzabad Institute of Higher Education, Firouzabad, Fars, Iran
3
Department of Industrial Engineering, Masjed-Soleiman Branch, Islamic Azad University, Masjed-Soleiman, Iran
123
Annals of Operations Research
of minimizing total cost of material handling within facilities (the facility layout problem) is impressively important. Single Row Facility Layout Problem (SRFLP) is a special case of facility layout problem. Kothari and Ghosh (2013) defined the SRFLP as the problem of arranging departments with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of departments. The SRFLP has numerous real-life applications. It has been used to arrange the departments on one side of an aisle in a supermarket, an office or a hospital (Simmons 1969), to assign the disk cylinders to files (Picard and Queyranne 1981), to place the machines on one side of a straight automated guided veh
Data Loading...
