EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Learning-based multi-objective hyper-heuristic algorithm for reconfigurable assembly line scheduling problems

Haoyi Zhao, Xiangming Huang, Guoliang Liu, Zixiang Li iD, Fan Chen, Gaojie Lu

PLOS One · 20.05.2026 · 21 (5) · e0348884

DOI: 10.1371/journal.pone.0348884 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS One, online erschienen am 20.05.2026. Verfasst von Haoyi Zhao und 5 weiteren Autor:innen. Beteiligte Einrichtung: College of Mechanical and Vehicle Engineering, Hunan University, Changsha, Hunan, China. Hauptthemen laut MEDLINE: Algorithms, Heuristics. Die Arbeit nennt 47 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Hubei Provincial Natural Science Foundation of China.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Reconfigurable assembly lines have emerged as a vital manufacturing paradigm to meet the growing demand for customized and multi-variety products. This study considers the reconfigurable assembly line scheduling problem, involving product sequencing optimization, to minimize reconfiguration cost, production workload equalization, and logistics leveling simultaneously. This study formulates a novel and linearized multi-objective mathematical model, which rectifies deficiencies in prior formulations. A novel Q-learning-based multi-objective hyper-heuristic algorithm is proposed. The algorithm integrates multiple metaheuristic operators, including particle swarm optimization, teaching–learning-based optimization, whale optimization algorithm, and grey wolf optimizer, within a unified search framework. Q-learning is employed to adaptively select the most promising operator at each search stage based on real-time performance feedback. Moreover, the proposed algorithm incorporates a new density-aware leader selection strategy with a survival-time decay factor to select the global best solution for population evolution, favoring superior solutions in sparse regions and increasing selection pressure on high-quality individuals. A numerical case study demonstrates that the models with the ε-constraint method could achieve a set of Pareto solutions. A computational study on 120 generated benchmark instances demonstrates that the proposed methodology outperforms nine other high-performing multi-objective algorithms.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsHeuristicsParticle Swarm OptimizationModels, TheoreticalComputer Simulation

Autor:innen und Institutionen

  • College of Mechanical and Vehicle Engineering, Hunan University, Changsha, Hunan, China.
  • Wuhan Vocational College of Software and Engineering (Wuhan Open University), Wuhan, Hubei, China.
  • Hunan Sinoboom Intelligent Equipment Co., ltd., Changsha, Hunan, China.
  • Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education, Wuhan University of Science and Technology, Wuhan, Hubei, China.

ORCID-Profile: Zixiang Li

Förderung

  • National Natural Science Foundation of China
  • Hubei Provincial Natural Science Foundation of China

Zitieren

APA

Zhao, H., Huang, X., Liu, G., Li, Z., Chen, F., & Lu, G. (2026). Learning-based multi-objective hyper-heuristic algorithm for reconfigurable assembly line scheduling problems. PLOS One, 21(5), e0348884. https://doi.org/10.1371/journal.pone.0348884

Vancouver

Zhao H, Huang X, Liu G, Li Z, Chen F, Lu G. Learning-based multi-objective hyper-heuristic algorithm for reconfigurable assembly line scheduling problems. PLOS One. 2026;21(5):e0348884. doi:10.1371/journal.pone.0348884

BibTeX
@article{Zhao2026,
  author = {Zhao, Haoyi and Huang, Xiangming and Liu, Guoliang and Li, Zixiang and Chen, Fan and Lu, Gaojie},
  title = {Learning-based multi-objective hyper-heuristic algorithm for reconfigurable assembly line scheduling problems},
  journal = {PLOS One},
  year = {2026},
  volume = {21},
  number = {5},
  pages = {e0348884},
  doi = {10.1371/journal.pone.0348884}
}
Kostenlos starten →