Abstract
The scheduling optimization of industrial processes is crucial for enhancing production capacity and minimizing energy consumption. In the realm of continuous casting, the expansion of the scheduling scale and the increasing number of scheduling objects pose challenges for genetic algorithms in swiftly generating optimal solutions that adhere to constraints. Prolonged scheduling decision times and difficulties in ensuring constant pouring constraints are critical issues that require urgent resolution in the continuous casting scheduling problem within steelmaking. This paper proposes a genetic algorithm driven by translational mutation operator for the scheduling optimization in the steelmaking-continuous casting production named TMGA. Incorporating continuous pouring information in the encoding process guarantees uninterrupted pouring during the casting stage. Furthermore, applying the translational mutation operator is instrumental in elevating the search efficiency for the global optimal solution, consequently diminishing scheduling decision times. To validate the effectiveness of the proposed approach, this study conducts a rigorous examination involving a numerical simulation case and two ablation experiments. The experimental results demonstrate the superior performance of TMGA compared to other methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Rouf, S., et al.: Additive manufacturing technologies: industrial and medical applications. Sustain. Oper. Comput. 3, 258–274 (2022)
Siengchin, S.: A review on lightweight materials for defence applications: present and future developments. Defence Technol. 24, 1–17 (2023)
Tan, X., et al.: Unlocking operational excellence: a deep dive into a communication-driven multi-strategy state transition algorithm for industrial process optimization. Chemom. Intell. Lab. Syst. 240, 104934 (2023)
Li, F.: Towards a computational intelligence framework in steel product quality and cost control. 2021
Lee, M., et al.: A critical review of planning and scheduling in steel-making and continuous casting in the steel industry. J. Oper. Res. Soc. 2023: p. 1–35
Carlucci, D., Renna, P., Materi, S.: A job-shop scheduling decision-making model for sustainable production planning with power constraint. IEEE Trans. Eng. Manage. 70(5), 1923–1932 (2023)
He, K., Wang, L.: A review of energy use and energy-efficient technologies for the iron and steel industry. Renew. Sustain. Energy Rev. 70, 1022–1039 (2017)
Tang, X.L., Scheduling a hybrid flowshop with batch production at the last stage. Comput. Oper. Res. 2007
Aggoune, R.: Minimizing the makespan for the flow shop scheduling problem with availability constraints. Eur. J. Oper. Res. 153(3), 534–543 (2004)
Sun, L.: An efficient and effective approach for the scheduling of steelmaking-continuous casting process with multi different refining routes. IEEE Robot. Autom. Lett. 7(4), 10454–10461 (2022)
Cui, H., X. Luo, and Y. Wang, Scheduling of steelmaking-continuous casting process with different processing routes using effective surrogate Lagrangian relaxation approach and improved concave–convex procedure. Int. J. Prod. Res. 2021
Xu, W., Tang, L and Pistikopoulos, E.N.: Modeling and solution for steelmaking scheduling with batching decisions and energy constraints. Comput. Chem. Eng. 116(AUG.4): p. 368–384 (2018)
Tang, L., Zhao, Y. and Liu, J.: An improved differential evolution algorithm for practical dynamic scheduling in steelmaking-continuous casting production. IEEE Trans. Evol. Comput. (2014)
Fazel Zarandi, M.H., Dorry, F.: A hybrid fuzzy PSO algorithm for solving steelmaking-continuous casting scheduling problem. Int. J. Fuzzy Syst. 20(1), 219–235 (2017). https://doi.org/10.1007/s40815-017-0331-0
Peng, K., et al.: An improved artificial bee colony algorithm for Real-world hybrid flowshop rescheduling in steelmaking-refining continuous casting process. Comput. Ind. Eng. 2018. 122(AUG.): p. 235–250
Wei, X., Task scheduling optimization strategy using improved ant colony optimization algorithm in cloud computing. J. Ambient Intell. Humanized Comput. 2020(4)
Zhou, L. Cui. Y.: Parameter optimization and its application of support vector machines based on improved particle swarm optimization algorithm. In 2022 4th International Conference on Intelligent Information Processing (IIP). 2022
Li, Y., et al.: An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times. Comput. Ind. Eng. 147, 106638 (2020)
Jia, Z., et al.: Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities. Appl. Soft Comput. 75, 548–561 (2019)
Zhang, G., et al.: An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints. Swarm Evol. Comput. 54, 100664 (2020)
Zhou, Z., et al.: An improved genetic algorithm using greedy strategy toward task scheduling optimization in cloud environments. Neural Comput. Appl. 32, 1531–1541 (2020)
Liu, S.C., et al.: Many-objective job-shop scheduling: a multiple populations for multiple objectives-based genetic algorithm approach. IEEE Trans. Cybern. 2021
Yusof, R., et al.: Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm. Appl. Soft Comput. 11(8), 5782–5792 (2011)
Rubén, et al., Two new robust genetic algorithms for the flowshop scheduling problem - ScienceDirect. Omega, 2006. 34(5): p. 461–476
Long, J., et al.: Scheduling a realistic hybrid flow shop with stage skipping and adjustable processing time in steel plants. Appl. Soft Comput. 64, 536–549 (2017)
Lu, H. and Qiao, F.: An efficient adaptive genetic algorithm for energy saving in the hybrid flow shop scheduling with batch production at last stage. Expert Syst. 2021
Wang, H., Wang, H. and Luo, H. An improved multi-objective optimization algorithm for flexible job shop dynamic scheduling problem. In IECON 2022 – 48th Annual Conference of the IEEE Industrial Electronics Soc. 2022
Lu, L., Ng, C.T., Zhang, L.: Optimal algorithms for single-machine scheduling with rejection to minimize the makespan. Int. J. Prod. Econ. 130(2), 153–158 (2011)
Kennedy, J. and Eberhart. R.: Particle swarm optimization. In: Proceedings of ICNN'95-International Conference on Neural Networks. 1995. IEEE
Holland, J.H.: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. 1992: MIT press
Zhou, X., Yang, C. and Gui, W.: State transition algorithm. arXiv preprint arXiv:1205.6548, 2012
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 IFIP International Federation for Information Processing
About this paper
Cite this paper
Guan, L., Wang, Y., Tan, X., Liu, C. (2024). Genetic Algorithm Driven by Translational Mutation Operator for the Scheduling Optimization in the Steelmaking-Continuous Casting Production. In: Shi, Z., Torresen, J., Yang, S. (eds) Intelligent Information Processing XII. IIP 2024. IFIP Advances in Information and Communication Technology, vol 703. Springer, Cham. https://doi.org/10.1007/978-3-031-57808-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-031-57808-3_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-57807-6
Online ISBN: 978-3-031-57808-3
eBook Packages: Computer ScienceComputer Science (R0)