EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

An Improved Multi-Objective Memetic Algorithm with Q-Learning for Distributed Hybrid Flow Shop Considering Sequence-Dependent Setup Times

Yong Shen, Yibo Liu, Hongwei Kang, Xingping Sun, Qingyi Chen

Symmetry · 09.01.2026 · 18 (1) · 135

DOI: 10.3390/sym18010135 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Symmetry, online erschienen am 09.01.2026. Verfasst von Yong Shen und 4 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Open Foundation of Key Laboratory of Software Engineering of Yunnan Province, New round of Double First-class Project of Yunnan University, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Most multi-objective studies on distributed hybrid flow shops that include tardiness-related objectives focus solely on optimizing makespan alongside a single tardiness objective. However, in real-world scenarios with strict contractual deadlines or high penalty costs for delays, minimizing both total tardiness and the number of tardy jobs becomes critically important. This paper addresses this gap by prioritizing tardiness-related objectives while simultaneously optimizing makespan, total tardiness, and the number of tardy jobs. It investigates a distributed hybrid flow shop scheduling problem (DHFSP), which has some symmetries on machines. We propose an improved multi-objective memetic algorithm incorporating Q-learning (IMOMA-QL) to solve this problem, featuring (1) a hybrid initialization method that generates high-quality, diverse solutions by balancing all three objectives; (2) a multi-factory SB2OX crossover operator preserving high-performance job sequences across factories; (3) six problem-specific neighborhood structures for efficient solution space exploration; and (4) a Q-learning-guided variable neighborhood search that adaptively selects neighborhood structures. Based on extensive numerical experiments across 100 generated instances and a comprehensive comparison with four comparative algorithms, the proposed IMOMA demonstrates its effectiveness and proves to be a competitive method for solving the DHFSP.

Förderung

  • Open Foundation of Key Laboratory of Software Engineering of Yunnan Province
  • New round of Double First-class Project of Yunnan University
  • National Natural Science Foundation of China
  • Special Fund for the Central Government to Guide Local Science
  • Key Research and Development Program of Yunnan Province

Zitieren

APA

Shen, Y., Liu, Y., Kang, H., Sun, X., & Chen, Q. (2026). An Improved Multi-Objective Memetic Algorithm with Q-Learning for Distributed Hybrid Flow Shop Considering Sequence-Dependent Setup Times. Symmetry, 18(1), 135. https://doi.org/10.3390/sym18010135

Vancouver

Shen Y, Liu Y, Kang H, Sun X, Chen Q. An Improved Multi-Objective Memetic Algorithm with Q-Learning for Distributed Hybrid Flow Shop Considering Sequence-Dependent Setup Times. Symmetry. 2026;18(1):135. doi:10.3390/sym18010135

BibTeX
@article{Shen2026,
  author = {Shen, Yong and Liu, Yibo and Kang, Hongwei and Sun, Xingping and Chen, Qingyi},
  title = {An Improved Multi-Objective Memetic Algorithm with Q-Learning for Distributed Hybrid Flow Shop Considering Sequence-Dependent Setup Times},
  journal = {Symmetry},
  year = {2026},
  volume = {18},
  number = {1},
  pages = {135},
  doi = {10.3390/sym18010135}
}
Kostenlos starten →