A multiobjective memetic algorithm with particle swarm optimization and Q-learning-based local search for energy-efficient distributed heterogeneous hybrid flow-shop scheduling problem

被引:27
作者
Zhang, Wenqiang [1 ]
Li, Chen [1 ]
Gen, Mitsuo [2 ]
Yang, Weidong [3 ]
Zhang, Guohui [4 ]
机构
[1] Henan Univ Technol, Coll Informat Sci & Engn, Zhengzhou, Peoples R China
[2] Tokyo Univ Sci, Fuzzy Log Syst Inst, Tokyo, Japan
[3] Henan Univ Technol, Henan Key Lab Grain Photoelect Detect & Control, Zhengzhou, Peoples R China
[4] Zhengzhou Univ Aeronaut, Sch Management Engn, Zhengzhou, Peoples R China
基金
中国国家自然科学基金;
关键词
Hybrid flow-shop scheduling; Heterogeneous distributed scheduling; Energy-efficient; Memetic algorithm; Particle swarm optimization; Q-learning; DIFFERENTIAL EVOLUTION; GENETIC ALGORITHM; SHOP; MAKESPAN;
D O I
10.1016/j.eswa.2023.121570
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Most existing distributed hybrid flow-shop scheduling problems (DHFSPs) assume identical shops and lack consideration of heterogeneous shops. This study focuses on energy-efficient heterogeneous DHFSP. A multi -objective memetic algorithm with particle swarm optimization and Q-learning-based local search is proposed in order to optimize both makespan and total energy consumption. Particle swarm optimization with multi-group is specifically designed as a global search strategy to improve the fast convergence performance of solutions in multi-direction of Pareto front. To improve the problem-specific knowledge search, two local search strategies are designed to further improve the quality and diversity of solutions. In addition, Q-learning is utilized to guide variable neighborhood search to better balance the exploration and exploitation of algorithms. This study investigates the effect of parameter setting and conducts extensive numerical tests. The comparative results and statistical analysis demonstrate the superior convergence and distribution performance of the proposed algorithm.
引用
收藏
页数:20
相关论文
共 48 条
[1]   A survey of multi-factory scheduling [J].
Behnamian, J. ;
Ghomi, S. M. T. Fatemi .
JOURNAL OF INTELLIGENT MANUFACTURING, 2016, 27 (01) :231-249
[2]   Heuristics for scheduling in a flow shop with multiple processors [J].
Brah, SA ;
Loo, LL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 113 (01) :113-122
[3]   A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop [J].
Cai, Jingcao ;
Lei, Deming ;
Li, Ming .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2021, 59 (18) :5404-5421
[4]   Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks [J].
Cai, Jingcao ;
Zhou, Rui ;
Lei, Deming .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2020, 90
[5]   Fuzzy distributed two-stage hybrid flow shop scheduling problem with setup time: collaborative variable search [J].
Cai, Jingcao ;
Zhou, Rui ;
Lei, Deming .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2020, 38 (03) :3189-3199
[6]   A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem [J].
Chen, Ronghua ;
Yang, Bo ;
Li, Shi ;
Wang, Shilong .
COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 149
[7]   A Multi-Facet Survey on Memetic Computation [J].
Chen, Xianshun ;
Ong, Yew-Soon ;
Lim, Meng-Hiot ;
Tan, Kay Chen .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (05) :591-607
[8]   An improved multi-population genetic algorithm with a greedy job insertion inter-factory neighborhood structure for distributed heterogeneous hybrid flow shop scheduling problem [J].
Cui, Hanghao ;
Li, Xinyu ;
Gao, Liang .
EXPERT SYSTEMS WITH APPLICATIONS, 2023, 222
[9]   An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem [J].
De Giovanni, L. ;
Pezzella, F. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (02) :395-408
[10]   A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem [J].
Deng, Jin ;
Wang, Ling .
SWARM AND EVOLUTIONARY COMPUTATION, 2017, 32 :121-131