Multi-Strategy Enhanced White Shark Optimizer for Solving Job Shop Scheduling Problem

Aiming at the inherent limitations of the basic White Shark Optimizer (WSO), such as insufficient population diversity, unbalanced global and local search mechanisms, and weak convergence in the later stage, this paper proposes an Improved White Shark Optimizer (IWSO). The algorithm is improved from the following three aspects: Firstly, the Tent chaotic map is introduced to replace the traditional random initialization in the population initialization stage. Secondly, an adaptive nonlinear convergence factor and a dynamic inertia weight adjustment strategy are designed to focus on the fine search in the neighborhood of the optimal solution. Thirdly, the Levy flight perturbation mechanism and the elite opposition-based learning strategy are integrated to expand the search range and further accelerate the convergence speed. To verify the effectiveness and superiority of the IWSO algorithm, the CEC2017 test suite is selected for simulation experiments, and the IWSO is systematically compared with seven other representative swarm intelligence algorithms. The experimental results show that the IWSO is significantly superior to all comparison algorithms in multiple evaluation indicators, including minimum makespan, average convergence value, standard deviation, and successful convergence rate, on scheduling instances of different scales and difficulties. The convergence curve remains leading throughout the iteration process and shows a smoother convergence trend. The multi-strategy enhanced white shark optimizer proposed in this paper effectively overcomes the inherent defects of the basic algorithm, significantly improves the solution accuracy and convergence efficiency of the job shop scheduling problem, and has high theoretical research value and practical engineering application prospects. In the future, the multi-strategy improved White Shark Optimizer will be extended to multi-objective job shop scheduling, dynamic disturbance job shop scheduling, and large-scale production scheduling scenarios with numerous workpieces and machines.

Authors

Institutions

Publication Details

Journal
Biomimetics
Published
2026-05-27
DOI
https://doi.org/10.3390/biomimetics11060372
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Strategy Enhanced White Shark Optimizer for Solving Job Shop Scheduling Problem

Zihao Cheng, Yinggao Yue, Meng Li, Yang Qiu et al.
Biomimetics
Metaheuristic Optimization Algorithms Research
article

Multi-Strategy Enhanced White Shark Optimizer for Solving Job Shop Scheduling Problem

Zihao Cheng, Yinggao Yue, Meng Li, Yang Qiu, Li Cao, Ken Chen
article en

Abstract

Aiming at the inherent limitations of the basic White Shark Optimizer (WSO), such as insufficient population diversity, unbalanced global and local search mechanisms, and weak convergence in the later stage, this paper proposes an Improved White Shark Optimizer (IWSO). The algorithm is improved from the following three aspects: Firstly, the Tent chaotic map is introduced to replace the traditional random initialization in the population initialization stage. Secondly, an adaptive nonlinear convergence factor and a dynamic inertia weight adjustment strategy are designed to focus on the fine search in the neighborhood of the optimal solution. Thirdly, the Levy flight perturbation mechanism and the elite opposition-based learning strategy are integrated to expand the search range and further accelerate the convergence speed. To verify the effectiveness and superiority of the IWSO algorithm, the CEC2017 test suite is selected for simulation experiments, and the IWSO is systematically compared with seven other representative swarm intelligence algorithms. The experimental results show that the IWSO is significantly superior to all comparison algorithms in multiple evaluation indicators, including minimum makespan, average convergence value, standard deviation, and successful convergence rate, on scheduling instances of different scales and difficulties. The convergence curve remains leading throughout the iteration process and shows a smoother convergence trend. The multi-strategy enhanced white shark optimizer proposed in this paper effectively overcomes the inherent defects of the basic algorithm, significantly improves the solution accuracy and convergence efficiency of the job shop scheduling problem, and has high theoretical research value and practical engineering application prospects. In the future, the multi-strategy improved White Shark Optimizer will be extended to multi-objective job shop scheduling, dynamic disturbance job shop scheduling, and large-scale production scheduling scenarios with numerous workpieces and machines.

BiomimeticsVol. 11(6)
Wenzhou University (CN), Zhejiang Institute of Special Equipment Inspection (CN), Zhejiang University (CN)
Natural Science Foundation of Zhejiang Province
Decent work and economic growth
Openalex Percentile: Top 4%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.