The pseudocode for the NAFPSO algorithm. by Huichao Guo (14515171)

“…In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”

PSO algorithm flowchart. by Huichao Guo (14515171)

“…In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”

Procedure of the DCT-based EIT algorithm. by Rongqing Chen (249906)

Subjects:

Scheduling time of five algorithms. by Huichao Guo (14515171)

“…In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”

Convergence speed of five algorithms. by Huichao Guo (14515171)

“…In view of the high-dimensional complexity and local optimal problems, the neighborhood adaptive constrained fractional particle swarm optimization (NACFPSO) algorithm is used to solve it. The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”

Iteration curves of different algorithms. by Tengfei Ma (597633)

Subjects:

Flowchart of OP-ZOA algorithm. by Tengfei Ma (597633)

Subjects:

If datasets are small and/or noisy, linear-regression-based algorithms for identifying functional groups outperform more complex versions. by Yuanchen Zhao (12905580)

Subjects:

Completion times for different algorithms. by Jianbin Zheng (587000)

“…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …”

The average cumulative reward of algorithms. by Jianbin Zheng (587000)

“…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …”

Construction of the PRG score index using integrated machine learning algorithms. by Xiangxin Wu (22320058)

Subjects:

Simulation settings of rMAPPO algorithm. by Jianbin Zheng (587000)

“…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …”

Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy by Yujin Wu (2901128)

Subjects:

Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy by Yujin Wu (2901128)

Subjects:

Power consumption for SHA256 software algorithm. by Maytham S. Jabor (15853046)

Subjects:

CEC2017 basic functions. by Tengfei Ma (597633)

Subjects:

Flow chart diagram of blind quantum algorithm. by Sultan H. Almotiri (14029251)

Subjects:

CEC2017 test function test results. by Tengfei Ma (597633)

Subjects:

Optimum feature set for classification using both core and margin information utilizing GLCM, GRLM, and GLSZM texture methods and SVM-RBF classification algorithm. by Laurentius O. Osapoetra (9931759)

Network structure diagram of YOLOv8 algorithm. by Weiyu Han (3448742)