An improved artificial bee colony algorithm with MaxTF heuristic rule for two-sided assembly line balancing problem

Abstract

Two-sided assembly line is usually used for the assembly of large products such as cars, buses, and trucks. With the development of technical progress, the assembly line needs to be reconfigured and the cycle time of the line should be optimized to satisfy the new assembly process. Two-sided assembly line balancing with the objective of minimizing the cycle time is called TALBP-2. This paper proposes an improved artificial bee colony (IABC) algorithm with the MaxTF heuristic rule. In the heuristic initialization process, the MaxTF rule defines a new task’s priority weight. On the basis of priority weight, the assignment of tasks is reasonable and the quality of an initial solution is high. In the IABC algorithm, two neighborhood strategies are embedded to balance the exploitation and exploration abilities of the algorithm. The employed bees and onlooker bees produce neighboring solutions in different promising regions to accelerate the convergence rate. Furthermore, a well-designed random strategy of scout bees is developed to escape local optima. The experimental results demonstrate that the proposed MaxTF rule performs better than other heuristic rules, as it can find the best solution for all the 10 test cases. A comparison of the IABC algorithm and other algorithms proves the effectiveness of the proposed IABC algorithm. The results also denote that the IABC algorithm is efficient and stable in minimizing the cycle time for the TALBP-2, and it can find 20 new best solutions among 25 large-sized problem cases.

Keywords

two-sided assembly line balancing problem / artificial bee colony algorithm / heuristic rules / time boundary

References

[1] Scholl A, Becker C. State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. European Journal of Operational Research, 2006, 168(3): 666–693

[2] Becker C, Scholl A. A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research, 2006, 168(3): 694–715

[3] Liu S B, Ng K M, Ong H L. Branch-and-bound algorithms for simple assembly line balancing problem. International Journal of Advanced Manufacturing Technology, 2008, 36(1–2): 169–177

[4] Amen M. An exact method for cost-oriented assembly line balancing. International Journal of Production Economics, 2000, 64(1–3): 187–195

[5] Sewell E C, Jacobson S H A. Branch, bound, and remember algorithm for the simple assembly line balancing problem. INFORMS Journal on Computing, 2012, 24(3): 433–442

[6] Mendes A R, Ramos A L, Simaria A S, Combining heuristic procedures and simulation models for balancing a PC camera assembly line. Computers & Industrial Engineering, 2005, 49(3): 413–431

[7] Kilincci O. A Petri net-based heuristic for simple assembly line balancing problem of type 2. International Journal of Advanced Manufacturing Technology, 2010, 46(1–4): 329–338

[8] Zheng Q X, Li M, Li Y X, Station ant colony optimization for the type 2 assembly line balancing problem. International Journal of Advanced Manufacturing Technology, 2013, 66(9–12): 1859–1870

[9] Li Z, Kucukkoc I, Nilakantan J M. Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem. Computers & Operations Research, 2017, 84: 146–161

[10] Bartholdi J J. Balancing two-sided assembly lines: A case study. International Journal of Production Research, 1993, 31(10): 2447–2461

[11] Kim Y K, Kim Y H, Kim Y J. Two-sided assembly line balancing: A genetic algorithm approach. Production Planning and Control, 2000, 11(1): 44–53

[12] Wu E F, Jin Y, Bao J S, A branch-and-bound algorithm for two-sided assembly line balancing. International Journal of Advanced Manufacturing Technology, 2008, 39(9–10): 1009–1015

[13] Baykasoglu A, Dereli T. Two-sided assembly line balancing using an ant-colony-based heuristic. International Journal of Advanced Manufacturing Technology, 2008, 36(5–6): 582–588

[14] Özcan U, Toklu B. Balancing of mixed-model two-sided assembly lines. Computers & Industrial Engineering, 2009, 57(1): 217–227

[15] Kim Y K, Song W S, Kim J H. A mathematical model and a genetic algorithm for two-sided assembly line balancing. Computers & Operations Research, 2009, 36(3): 853–865

[16] Özcan U. Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm. European Journal of Operational Research, 2010, 205(1): 81–97

[17] Tapkan P, Ozbakir L, Baykasoglu A. Modeling and solving constrained two-sided assembly line balancing problem via bee algorithms. Applied Soft Computing, 2012, 12(11): 3343–3355

[18] Khorasanian D, Hejazi S R, Moslehi G. Two-sided assembly line balancing considering the relationships between tasks. Computers & Industrial Engineering, 2013, 66(4): 1096–1105

[19] Yuan B, Zhang C, Shao X. A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints. Journal of Intelligent Manufacturing, 2015, 26(1): 159–168

[20] Tang Q, Li Z, Zhang L. An effective discrete artificial bee colony algorithm with idle time reduction techniques for two-sided assembly line balancing problem of type-II. Computers & Industrial Engineering, 2016, 97: 146–156

[21] Li Z, Tang Q, Zhang L. Minimizing the cycle time in two-sided assembly lines with assignment restrictions: Improvements and a simple algorithm. Mathematical Problems in Engineering, 2016, 2016: 4536426

[22] Tang Q, Li Z, Zhang L, Balancing stochastic two-sided assembly line with multiple constraints using hybrid teaching-learning-based optimization algorithm. Computers & Operations Research, 2017, 82: 102–113

[23] Li Z, Tang Q, Zhang L. Two-sided assembly line balancing problem of type I: Improvements, a simple algorithm and a comprehensive study. Computers & Operations Research, 2017, 79: 78–93

[24] Gansterer M, Hartl R F. One- and two-sided assembly line balancing problems with real-world constraints. International Journal of Production Research, 2017, (3): 1–18

[25] Karaboga D. An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report TR06. 2005

[26] Mohammadi F G, Abadeh M S. Image steganalysis using a bee colony based feature selection algorithm. Engineering Applications of Artificial Intelligence, 2014, 31: 35–43

[27] Liu Y, Liu S. A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Applied Soft Computing, 2013, 13(3): 1459–1463

[28] Karaboga D, Basturk B. A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm. Journal of Global Optimization, 2007, 39(3): 459–471

[29] Özcan U, Toklu B. A tabu search algorithm for two-sided assembly line balancing. International Journal of Advanced Manufacturing Technology, 2009, 43(7–8): 822–829

[30] Moodie C L, Young H H. A heuristic method of assembly line balancing for assumptions of constant or variable work element times. Journal of Industrial Engineering, 1965, 16: 23–29

[31] Tonge F M. Summary of a heuristic line balancing procedure.Management Science, INFORMs, 1960, 7(1): 21–42

[32] Helgeson W B, Birnie D P. Assembly line balancing using the ranked positional weight technique. Journal of Industrial Engineering, 1961, 12: 394–398

Acknowledgements

This work was supported by the National Science and Technology Supporting Plan (Grant No. 2015BAF01B04). The authors would also like to thank the editor and the anonymous reviewers for their thorough reviews, detailed comments, and constructive suggestions, which helped improve the quality of this paper.

RIGHTS & PERMISSIONS

2018 Higher Education Press and Springer-Verlag GmbH Germany, part of Springer Nature