A new hybrid heuristic algorithm based on bacterial foraging optimization for the dynamic facility layout problem

被引:56
作者
Turanoglu, Betul [1 ]
Akkaya, Gokay [1 ]
机构
[1] Ataturk Univ, Dept Ind Engn, TR-25240 Erzurum, Turkey
关键词
Dynamic facility layout; Bacterial foraging optimization; Simulated annealing; Hybrid heuristic methods; UNEQUAL AREA FACILITY; GENETIC ALGORITHM; PLANT LAYOUT; GLOBAL OPTIMIZATION; SYSTEMS; SEARCH; DESIGN; PERFORMANCE; CHEMOTAXIS; STRATEGY;
D O I
10.1016/j.eswa.2018.01.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
One of the most important features of modern production is that the demand for the product is constantly changing. The problems showing demand variability in certain time periods are called dynamic facility layout problems (DFLP). The establishment of a balance between handling and moving costs is attempted with such problems. Because the DFLP are complex combinatorial optimization problems, classical optimization techniques may not always be sufficient to solve them. Furthermore, it is necessary to find a solution within a reasonable computation time. Therefore, researchers tend to use heuristic methods. In the literature, various heuristic methods, such as the genetic algorithm, tabu search and ant-colony algorithm, were used to solve the DFLP. The paper introduces the use of bacterial foraging optimization (BFO) to solve the DFLP. In this study, a new hybrid heuristic algorithm, called simulated annealing which is based on bacterial foraging optimization (SABFO), is proposed for the DFLP. Also, the parameter tuning of the SABFO is made by Taguchi method. The proposed algorithm is tested on the most-used test problems in the literature, and satisfactory results are obtained at reasonable computation times. The study is important to show how BFO that is a new heuristic approach is applied to the DFLP. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:93 / 104
页数:12
相关论文
共 52 条
[1]   A novel multiobjective optimization algorithm based on bacterial chemotaxis [J].
Alejandra Guzman, Maria ;
Delgado, Alberto ;
De Carvalho, Jonas .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2010, 23 (03) :292-301
[2]   SOLUTIONS FOR THE CONSTRAINED DYNAMIC FACILITY LAYOUT PROBLEM [J].
BALAKRISHNAN, J ;
JACOBS, FR ;
VENKATARAMANAN, MA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 57 (02) :280-286
[3]   Genetic search and the dynamic layout problem [J].
Balakrishnan, J ;
Cheng, CH .
COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (06) :587-593
[4]   A hybrid genetic algorithm for the dynamic plant layout problem [J].
Balakrishnan, JD ;
Cheng, CH ;
Conway, DG ;
Lau, CM .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2003, 86 (02) :107-120
[5]   An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems [J].
Baykasoglu, A ;
Dereli, T ;
Sabuncu, I .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (04) :385-396
[6]   A simulated annealing algorithm for dynamic layout problem [J].
Baykasoglu, A ;
Gindy, NNZ .
COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (14) :1403-1426
[7]   A comparative study on the application of advanced bacterial foraging models to image registration [J].
Bermejo, E. ;
Cordon, O. ;
Damas, S. ;
Santamaria, J. .
INFORMATION SCIENCES, 2015, 295 :160-181
[8]   Numerical optimization using synergetic swarms of foraging bacterial populations [J].
Chatzis, Sotirios P. ;
Koukas, Spyros .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (12) :15332-15343
[9]   Bacterial colony foraging algorithm: Combining chemotaxis, cell-to-cell communication, and self-adaptive strategy [J].
Chen, Hanning ;
Zhu, Yunlong ;
Hu, Kunyuan ;
Ma, Lianbo .
INFORMATION SCIENCES, 2014, 273 :73-100
[10]   The facility layout problem in non-rectangular logistics parks with split lines [J].
Chen, Yanru ;
Jiang, Yangsheng ;
Wahab, M. I. M. ;
Long, Xiaoqiang .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (21) :7768-7780