Q-learning based hyper-heuristic with clustering strategy for combinatorial optimization : a case study on permutation flow-shop scheduling problem
Year of publication: |
2025
|
---|---|
Authors: | Yang, Yuan-yuan ; Qian, Bin ; Li, Zuocheng ; Hu, Rong ; Wang, Ling |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 173.2025, Art.-No. 106833, p. 1-22
|
Subject: | Q-learning algorithm | Hyper-heuristic | Low-dimensional mapping | Clustering strategy | Combinatorial optimization | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Regionales Cluster | Regional cluster | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming |
-
A clustering search approach for the train timetabling problem
Pinheiro, Eggo Henrique Freire, (2024)
-
An effective hybrid search algorithm for the multiple traveling repairman problem with profits
Ren, Jintong, (2023)
-
Jin, Bo, (2023)
- More ...
-
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
Pan, Quan-ke, (2009)
-
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
Qian, Bin, (2009)
-
An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
Qian, Bin, (2009)
- More ...