HuanKun Li

Mr. HuanKun Li


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 July 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JLJian Li
Jian Li
HLHuanKun Li
HuanKun Li
PHPengbo He
Pengbo He
LXLiping Xu
Liping Xu
KHKui He
Kui He
SLShanhui Liu
Shanhui Liu
Green manufacturing has become a new production mode for the development and operation of modern and future manufacturing industries. The flexible job shop scheduling problem (FJSP), as one of the key core problems in the field of green manufacturing process planning, has become a hot topic and a difficult issue in manufacturing production research. In this paper, an improved multi-objective wolf pack algorithm (MOWPA) is proposed for solving a multi-objective flexible job shop scheduling problem with transportation constraints. Firstly, a multi-objective flexible job shop scheduling model with transportation constraints is established, which takes the maximum completion time and total energy consumption as the optimization objectives. Secondly, an improved wolf pack algorithm is proposed, which designs individual codes from two levels of process and machine. The precedence operation crossover (POX) operation is used to improve the intelligent behavior of wolves, and the optimal Pareto solution set is obtained by introducing non-dominated congestion ranking. Thirdly, the Pareto solution set is selected using the gray relational decision analysis method and analytic hierarchy process to obtain the optimal scheduling scheme. Finally, the proposed algorithm is compared with other algorithms through a variety of standard examples. The analysis results show that the improved multi-objective wolf pack algorithm is superior to other algorithms in terms of solving speed and convergence performance of the Pareto solution, which shows that the proposed algorithm has advantages when solving FJSPs.

21 January 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
JLJian Li
Jian Li
PHPengbo He
Pengbo He
HLHuanKun Li
HuanKun Li
SLShifa Li
Shifa Li
LXLiping Xu
Liping Xu
KHKui He
Kui He
In order to achieve minimum energy consumption in computerized numerical control (CNC) lathe processing under the premise of ensuring the imposed roughness of the machined surface, a black hole-continuous ant colony optimization algorithm (BH-ACOR) is proposed to optimize the turning parameters. Taking turning specific energy and surface roughness as the optimization objectives, a turning test was designed. Subsequently, a multi-objective mathematical model of the cutting stage was formulated through the application of the least-squares method to fit the test data. The black hole algorithm was introduced to mitigate the shortcomings of the continuous-domain ant colony algorithm, which easily falls into a local optimum, so as to put forward a kind of BH-ACOR that is applicable to multi-objective optimization. The algorithm was applied to the multi-objective mathematical model in the turning stage to determine the optimal cutting parameters. Through simulation and test verification, the validity and practicability of the proposed method are further proved.