A Q-learning based hyper-heuristic scheduling algorithm with multi-rule selection for sub-assembly in shipbuilding

被引:3
作者
Wang, Teng [1 ]
Zhang, Yahui [2 ]
Hu, Xiaofeng [1 ,3 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Mech Engn, Shanghai 200240, Peoples R China
[2] Shanghai Jiao Tong Univ, Inst Marine Equipment, 5G Intelligent Mfg Res Ctr, Shanghai 200240, Peoples R China
[3] Shanghai Key Lab Adv Mfg Environm, Shanghai 200240, Peoples R China
关键词
Spatial scheduling; Sub-assembly; Multi-rule selection; Hyper-heuristic; Q; -learning; RESOURCE; SHOP; EVOLUTIONARY; BLOCKS;
D O I
10.1016/j.cie.2024.110567
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Sub-assembly is the basic stage of ship hull construction. It is necessary to optimize the scheduling of subassembly to shorten its assembly cycle and ensure the normal execution of subsequent processes. The scheduling problem of sub-assembly is an NP-hard problem that should take into consideration both spatial layout and temporal schedule. In this work, a mathematical model for scheduling the sub-assembly is established, and a Qlearning based hyper-heuristic with multi-spatial layout rule selection is proposed. Specifically, a spatial layout method based on multi-rule selection is proposed first. In various scenarios, distinct spatial layout rules are chosen to derive an appropriate spatial arrangement. Subsequently, a hyper-heuristic algorithm based on Qlearning is crafted to optimize the scheduling sequence and the selection of spatial layout rules. As a verification, numerical experiments are carried out in cases of different scales collected from a large shipyard. The effectiveness of the proposed algorithm is verified by comparing it with different spatial layout algorithms, various heuristic operators, existing well-known hyper-heuristic methods, and other Q-learning based scheduling methods. The results suggest that the proposed algorithm outperforms other comparison algorithms in most testing cases.
引用
收藏
页数:24
相关论文
共 46 条
[1]  
Bean J. C., 1994, INFORMS: ORSA Journal on Computing
[2]   SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY [J].
BLAZEWICZ, J ;
LENSTRA, JK ;
KAN, AHGR .
DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :11-24
[3]   Multi-objective Q-learning-based hyper-heuristic with Bi-criteria selection for energy-aware mixed shop scheduling [J].
Cheng, Lixin ;
Tang, Qiuhua ;
Zhang, Liping ;
Zhang, Zikai .
SWARM AND EVOLUTIONARY COMPUTATION, 2022, 69
[4]  
Cowling P, 2001, LECT NOTES COMPUT SC, V2079, P176
[5]   A BRANCH-AND-BOUND PROCEDURE FOR THE MULTIPLE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM [J].
DEMEULEMEESTER, E ;
HERROELEN, W .
MANAGEMENT SCIENCE, 1992, 38 (12) :1803-1818
[6]   New benchmark results for the resource - Constrained project scheduling problem [J].
Demeulemeester, EL ;
Herroelen, WS .
MANAGEMENT SCIENCE, 1997, 43 (11) :1485-1492
[7]   Resource and time criticality based block spatial scheduling in a shipyard under uncertainty [J].
Dixit, Vijaya ;
Verma, Priyanka ;
Raj, Piyush ;
Sharma, Mayank .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (22) :6993-7007
[8]   Hyper-heuristics: A survey and taxonomy [J].
Dokeroglu, Tansel ;
Kucukyilmaz, Tayfun ;
Talbi, El-Ghazali .
COMPUTERS & INDUSTRIAL ENGINEERING, 2024, 187
[9]  
Du JW, 2019, IN C IND ENG ENG MAN, P1491, DOI [10.1109/ieem44572.2019.8978760, 10.1109/IEEM44572.2019.8978760]
[10]  
Fisher Henry., 1963, Industrial scheduling, V3, P225