Optimizing production planning and sequencing in hot strip mills: an approach using multi-objective genetic algorithms

被引:0
作者
Fardad, Hamidreza [1 ,2 ]
Safi-Esfahani, Faramarz [1 ,2 ]
Barekatain, Behrang [1 ,2 ]
机构
[1] Islamic Azad Univ, Fac Comp Engn, Najafabad Branch, Najafabad, Iran
[2] Islamic Azad Univ, Big Data Res Ctr, Najafabad Branch, Najafabad, Iran
关键词
Production planning; Sequencing; Hot strip mill (HSM); Multi-objective genetic algorithms; Optimization; SCHEDULING PROBLEM; STEEL;
D O I
10.1007/s11227-024-06469-z
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Planning and sequencing for hot strip mills in the steel industry is a challenging, complex problem that has fascinated optimization researchers and practitioners alike. This paper applies a combinatory heuristic search and a multi-objective metaheuristic that is a novel approach called HSMO-NSGA-II and employs the HSMO heuristic search method and NSGA-II multi-objective genetic optimization as a metaheuristic algorithm to address complex hot strip mills scheduling tasks. This research aims to enhance the efficiency and effectiveness of production planning and sequencing in hot strip mill, while minimizing operational costs and maximizing rolling utilization. The output consists of slabs categorized into three parts, which converge toward a set of Pareto-optimal solutions while maintaining diversity across the entire solution space. The results demonstrate a significant improvement in comparing the base methods with the HSMO-NSGA-II method, and the proposed method shows better average performance at 23.01%. Notably, the HSMO-NSGA-II method demonstrated a remarkable improvement in performance across the evaluated scenarios, showcasing its potential to enhance productivity and operational efficiency in industrial applications significantly. These findings not only support the viability of using advanced genetic algorithms in complex industrial settings but also open avenues for future research into hybrid optimization techniques.
引用
收藏
页数:48
相关论文
共 25 条
  • [1] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [2] Ergun O., 2001, New neighborhood search algorithms based on exponentially large scale neighborhoods
  • [3] Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness
  • [4] A decomposition-based hierarchical optimization algorithm for hot rolling batch scheduling problem
    Jia, Shujin
    Zhu, Jun
    Yang, Genke
    Yi, Jian
    Du, Bin
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 61 (5-8) : 487 - 501
  • [5] Kun Li., 2016, A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem
  • [6] What you should know about the vehicle routing problem
    Laporte, Gilbert
    [J]. NAVAL RESEARCH LOGISTICS, 2007, 54 (08) : 811 - 819
  • [7] Li T., 2023, IEEE Trans Autom Sci Eng, V21, P14
  • [8] Research and application of multiple constrained hot strip mill scheduling problem based on HPSA
    Liu, Lilan
    Liu, Chao
    Liu, Xuewei
    Wang, Sen
    Zhou, Wei
    Zhang, Zhenyou
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2015, 81 (9-12) : 1817 - 1829
  • [9] Variable neighborhood search
    Mladenovic, N
    Hansen, P
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (11) : 1097 - 1100
  • [10] A general heuristic for vehicle routing problems
    Pisinger, David
    Ropke, Stefan
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (08) : 2403 - 2435