TY - GEN
T1 - Best Bordering Algorithm for complexly shaped Blocks in Shipbuilding
AU - Wang, Yiyan
AU - Luo, Qifan
AU - He, Kunhuan
AU - Zhang, Jinming
AU - Wang, Aimin
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - This paper proposes the best bordering algorithm for optimizing the placement of complexly shaped blocks in shipbuilding. The best bordering algorithm primarily measures the bordering length between the blocks and the workplace, and selects the placement position with the maximum bordering length to achieve a dense arrangement of blocks in the workplace and obtain the optimal arrangement plan. By using the best bordering algorithm, it ensures that each block entering the workplace is placed in the most adjacent position to other blocks, which maximizes the utilization rate of the workplace. When compared with the existing lowest center-of-gravity method, we observe that the overall makespan of the scheduling plan obtained by the best bordering algorithm is shorter and the average utilization rate of the workplace is higher, thus highlighting its superiority. This algorithm can be applied to solve actual production planning and scheduling problems in the industry to improve resource utilization rates and maximize efficiency.
AB - This paper proposes the best bordering algorithm for optimizing the placement of complexly shaped blocks in shipbuilding. The best bordering algorithm primarily measures the bordering length between the blocks and the workplace, and selects the placement position with the maximum bordering length to achieve a dense arrangement of blocks in the workplace and obtain the optimal arrangement plan. By using the best bordering algorithm, it ensures that each block entering the workplace is placed in the most adjacent position to other blocks, which maximizes the utilization rate of the workplace. When compared with the existing lowest center-of-gravity method, we observe that the overall makespan of the scheduling plan obtained by the best bordering algorithm is shorter and the average utilization rate of the workplace is higher, thus highlighting its superiority. This algorithm can be applied to solve actual production planning and scheduling problems in the industry to improve resource utilization rates and maximize efficiency.
KW - Boolean operation for polygon
KW - best bordering algorithm
KW - complexly shaped blocks
KW - spatial scheduling
UR - http://www.scopus.com/inward/record.url?scp=85170824610&partnerID=8YFLogxK
U2 - 10.1109/ICMA57826.2023.10216248
DO - 10.1109/ICMA57826.2023.10216248
M3 - Conference contribution
AN - SCOPUS:85170824610
T3 - 2023 IEEE International Conference on Mechatronics and Automation, ICMA 2023
SP - 1449
EP - 1453
BT - 2023 IEEE International Conference on Mechatronics and Automation, ICMA 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 20th IEEE International Conference on Mechatronics and Automation, ICMA 2023
Y2 - 6 August 2023 through 9 August 2023
ER -