Zhaolin Lv¹, Yuexia Zhao², Hongyue Kang^3,*, Zhenyu Gao³, Yuhang Qin⁴

CMC-Computers, Materials & Continua, Vol.78, No.2, pp. 2337-2360, 2024, DOI:10.32604/cmc.2023.045826

Abstract Flexible job shop scheduling problem (FJSP) is the core decision-making problem of intelligent manufacturing production management. The Harris hawk optimization (HHO) algorithm, as a typical metaheuristic algorithm, has been widely employed to solve scheduling problems. However, HHO suffers from premature convergence when solving NP-hard problems. Therefore, this paper proposes an improved HHO algorithm (GNHHO) to solve the FJSP. GNHHO introduces an elitism strategy, a chaotic mechanism, a nonlinear escaping energy update strategy, and a Gaussian random walk strategy to prevent premature convergence. A flexible job shop scheduling model is constructed, and the static and dynamic FJSP is investigated to minimize… More >

Hui Xu, Yalin Hu^*, Weidong Cao, Longjie Han

CMC-Computers, Materials & Continua, Vol.76, No.3, pp. 3239-3255, 2023, DOI:10.32604/cmc.2023.039227

Abstract The massive influx of traffic on the Internet has made the composition of web traffic increasingly complex. Traditional port-based or protocol-based network traffic identification methods are no longer suitable for today’s complex and changing networks. Recently, machine learning has been widely applied to network traffic recognition. Still, high-dimensional features and redundant data in network traffic can lead to slow convergence problems and low identification accuracy of network traffic recognition algorithms. Taking advantage of the faster optimization-seeking capability of the jumping spider optimization algorithm (JSOA), this paper proposes a jumping spider optimization algorithm that incorporates the harris hawk optimization (HHO) and… More >