An Enhanced Discrete Hummingbird Algorithm With Reinforcement Learning for Efficient Hybrid Flow Shop Scheduling

ABSTRACT To overcome the limitations of the artificial hummingbird algorithm (AHA), such as slow convergence and its inability to address discrete optimization problems, this paper proposes an improved Q‐learning‐based discrete artificial hummingbird algorithm (QIDAHA). The original foraging strategies of AHA are discretized, and a tailored model for the hybrid flow‐shop scheduling problem (HFSP) is constructed, with specifically designed encoding and decoding mechanisms. By integrating reinforcement learning, Q‐learning is employed to adaptively select the optimal flight directions of hummingbirds according to environmental states and feedback, while an ‐convergence factor balances exploration and exploitation during action selection. In addition, an elite neighborhood optimization strategy is introduced in the later search stages to accelerate convergence and enhance solution accuracy. The effectiveness of QIDAHA is validated on three small‐scale and 10 large‐scale HFSP benchmark instances, and its performance is compared against several state‐of‐the‐art discrete algorithms. Experimental results show that QIDAHA achieves superior scheduling performance, with an average optimal makespan of 604.6 on large‐scale problems, outperforming SHPSO (613.5), PSO (632.5), DWOA (645.1), IDDE (631.3), DSSA (623.4), and DAHA (613.2). This study not only extends the applicability of AHA to discrete scheduling but also provides an efficient and reliable approach to solving HFSP. The proposed algorithm demonstrates both theoretical significance and practical value for optimizing complex manufacturing systems. Finally, the structure of this paper is organized as follows: Chapter 1 introduces the overall background; Chapter 2 presents the traditional Artificial Hummingbird Algorithm (AHA); Chapter 3 describes its discrete version; Chapter 4 analyzes the shortcomings of the discrete AHA and introduces the Qlearning–enhanced improvements; Chapter 5 reports the experimental studies; and Chapter 6 provides the overall conclusions.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-11-03
DOI
https://doi.org/10.1002/cpe.70409
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Enhanced Discrete Hummingbird Algorithm With Reinforcement Learning for Efficient Hybrid Flow Shop Scheduling

Jing Yao, Ning Zhou, Zhiwei Zhou
Concurrency and Computation Practice and Experience
Scheduling and Optimization Algorithms
article

An Enhanced Discrete Hummingbird Algorithm With Reinforcement Learning for Efficient Hybrid Flow Shop Scheduling

Jing Yao, Ning Zhou, Zhiwei Zhou
article en

Abstract

ABSTRACT To overcome the limitations of the artificial hummingbird algorithm (AHA), such as slow convergence and its inability to address discrete optimization problems, this paper proposes an improved Q‐learning‐based discrete artificial hummingbird algorithm (QIDAHA). The original foraging strategies of AHA are discretized, and a tailored model for the hybrid flow‐shop scheduling problem (HFSP) is constructed, with specifically designed encoding and decoding mechanisms. By integrating reinforcement learning, Q‐learning is employed to adaptively select the optimal flight directions of hummingbirds according to environmental states and feedback, while an ‐convergence factor balances exploration and exploitation during action selection. In addition, an elite neighborhood optimization strategy is introduced in the later search stages to accelerate convergence and enhance solution accuracy. The effectiveness of QIDAHA is validated on three small‐scale and 10 large‐scale HFSP benchmark instances, and its performance is compared against several state‐of‐the‐art discrete algorithms. Experimental results show that QIDAHA achieves superior scheduling performance, with an average optimal makespan of 604.6 on large‐scale problems, outperforming SHPSO (613.5), PSO (632.5), DWOA (645.1), IDDE (631.3), DSSA (623.4), and DAHA (613.2). This study not only extends the applicability of AHA to discrete scheduling but also provides an efficient and reliable approach to solving HFSP. The proposed algorithm demonstrates both theoretical significance and practical value for optimizing complex manufacturing systems. Finally, the structure of this paper is organized as follows: Chapter 1 introduces the overall background; Chapter 2 presents the traditional Artificial Hummingbird Algorithm (AHA); Chapter 3 describes its discrete version; Chapter 4 analyzes the shortcomings of the discrete AHA and introduces the Qlearning–enhanced improvements; Chapter 5 reports the experimental studies; and Chapter 6 provides the overall conclusions.

Concurrency and Computation Practice and ExperienceVol. 37(27-28)
Lanzhou Jiaotong University (CN)
Openalex Percentile: Top 55%
Scheduling and Optimization Algorithms
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.