Abstract
The paper proposes a method to solve the mixed-model assembly line sequencing problem based on the Simulated Annealing Optimization algorithm. Achieving full line synchronization, by creating the appropriate model version sequence, becomes increasingly difficult at current levels of product complexity. The method of generating the candidate sequence by repeatedly swapping two random positions depending on the current temperature value was used. The search area is relatively large in the early phase of the algorithm. In addition, the conditions for resetting the temperature indicator if the local point candidate solutions are not improved have been added. It was also necessary to create a search objective function, taking into account specific aspects related to the mix-model sequencing problem. The proposed approach is based on binary coding of the input sequence and a suitably modified method of determining the boundaries of the search area. This increases the chance to avoid local optima trapping.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ćwikła, G., Grabowik, C., Kalinowski, K., Paprocka, I., Banaś, W.: The initial considerations and tests on the use of real time locating system in manufacturing processes improvement. IOP Conf. Ser. Mater. Sci. Eng. 400, 1757–8981 (2018)
Golz, J.: Part feeding at high-variant mixed-model assembly lines. Flex. Serv. Manuf. J. 24, 119–141 (2011)
Akpinar, S., Bayhan, G.M.: A hybrid genetic algorithm for mixed model assembly line balancing problem with parallel workstations and zoning constraints. Eng. Appl. Artif. Intell. 24, 449–457 (2011)
Scholl, A., Voß, S.: Simple assembly line balancing—heuristic approaches. J. Heuristics 2(3), 217–244 (1996)
Simaria, A.S., Vilarinho, P.M.: A genetic algorithm based approach to the mixed-model assembly line balancing problem of type II. Comput. Ind. Eng. 47, 391–407 (2004)
Şeker, Ş., Özgürler, M., Tanyaş, M.A.: Weighted multiobjective optimization method for mixed-model assembly line problem. J. Appl. Math. 2013, 1–10 (2013). Article ID 531056
Krenczyk, D., Skolud, B., Herok, A.: A heuristic and simulation hybrid approach for mixed and multi model assembly line balancing. In: Advances in Intelligent Systems and Computing, vol. 637, pp. 99–108 (2018). https://doi.org/10.1007/978-3-319-64465-3_10
Hamzadayi, A., Yildiz, G.: A simulated annealing algorithm based approach for balancing and sequencing of mixed-model U-lines. Comput. Ind. Eng. 66, 1070–1084 (2013)
Krenczyk, D., Dziki, K.: A hybrid heuristic algorithm for multi-manned assembly line balancing problem with location constraints. In: Advances in Intelligent Systems and Computing, vol. 950, pp. 333–343 (2020)
Kundua, K.: A study of a Kanban based assembly line feeding system through integration of simulation and particle swarm optimization. Int. J. Ind. Eng. Comput. 10, 421–442 (2019)
Cohen, Y., Naseraldin, H., Chaudhuri, A., Pilati, F.: Assembly systems in Industry 4.0 era: a road map to understand Assembly 4.0. Int. J. Adv. Manuf. Technol. 105, 4037–4054 (2019)
Hyun, C.J., Kim, Y., Kim, Y.K.: A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines. Comput. Oper. Res. 25, 675–689 (1998)
Zhang, X., Gao, L., Wen, L., Huang, Z.: A hybrid algorithm based on tabu search and large neighbourhood search for car sequencing problem. J. Cent. South Univ. 25, 315–330 (2018)
McMullen, P.R., Frazier, G.V.: A simulated annealing approach to mixed-model sequencing with multiple objectives on a just-in-time line. IIE Trans. 32(8), 679–686 (2000)
Liu, Z., Wang, C., Sun, T.: Production sequencing of mixed-model assembly lines based on simulated annealing algorithm. In: International Conference of Logistics Engineering and Management, ICLEM 2010, vol. 387, pp. 1803–1808 (2010)
Xiaobo, Z., Ohno, K.: Algorithms for sequencing mixed models on an assembly line in a JIT production system. Comput. Ind. Eng. 32, 47–56 (1997)
Dong, J., Zhang, L., Xiao, T., Mao, H.: Balancing and sequencing of stochastic mixed-model assembly U-lines to minimise the expectation of work overload time. Int. J. Prod. Res. 52(24), 7529–7548 (2014)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Eglese, R.W.: Simulated annealing: a tool for operational research. Eur. J. Oper. Res. 46, 271–281 (1990)
Goldkrg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Krenczyk, D., Dziki, K. (2021). A Simulated Annealing Based Method for Sequencing Problem in Mixed Model Assembly Lines. In: Herrero, Á., Cambra, C., Urda, D., Sedano, J., Quintián, H., Corchado, E. (eds) 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020). SOCO 2020. Advances in Intelligent Systems and Computing, vol 1268. Springer, Cham. https://doi.org/10.1007/978-3-030-57802-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-030-57802-2_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-57801-5
Online ISBN: 978-3-030-57802-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)