An Adaptive Multi-Objective Evolutionary Algorithm with Two-Stage Local Search for Flexible Job-Shop Scheduling

被引:6
作者
Li, Yingli [1 ]
Wang, Jiahai [1 ]
Liu, Zhengwei [1 ]
机构
[1] Tongji Univ, Sch Mech Engn, Shanghai 201804, Peoples R China
基金
国家重点研发计划;
关键词
Flexible job-shop scheduling; Multi objective optimisation; Evolutionary algorithm; Local search; GENETIC ALGORITHM; OPTIMIZATION ALGORITHM; TABU SEARCH;
D O I
10.2991/ijcis.d.201104.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An adaptive evolutionary algorithm with two-stage local search is proposed to solve the multi-objective flexible job-shop scheduling problem (MOFJSP). Adaptivity and efficient solving ability are the two main features. An autonomous selection mechanism of crossover operator is designed, which divides individuals into different levels and selects the appropriate one according to the both sides' levels to improve the self-adaptation. in parameter setting, the autonomous determination and adjustment mechanism is proposed, and parameters are adjusted autonomously according to the job scale and iteration number, so as to reduce the complexity of parameter setting and further improve the adaptivity. For improving solving ability, two-stage local search mechanism is designed. The first stage is performed before the evolution operation, so that each individual has more good genes to participate in the following operation. The second stage is performed after the evolution operation to further search the optimal solutions. Finally, a large number of comparative numerical tests are carried out, compared with other excellent algorithms, the proposed algorithm has fewer parameters to be set and stronger solving ability. (C) 2021 The Authors. Published by Atlantis Press B.V.
引用
收藏
页码:54 / 66
页数:13
相关论文
共 41 条
[1]   An artificial immune algorithm for the flexible job-shop scheduling problem [J].
Bagheri, A. ;
Zandieh, M. ;
Mahdavi, Iraj ;
Yazdani, M. .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2010, 26 (04) :533-541
[2]   Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems [J].
Baykasoglu, A ;
Özbakir, L ;
Sönmez, AI .
JOURNAL OF INTELLIGENT MANUFACTURING, 2004, 15 (06) :777-785
[3]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[4]   JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES [J].
BRUCKER, P ;
SCHLIE, R .
COMPUTING, 1990, 45 (04) :369-375
[5]   A two-stage hybrid memetic algorithm for multiobjective job shop scheduling [J].
Cheng, Hsueh-Chien ;
Chiang, Tsung-Che ;
Fu, Li-Chen .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (09) :10983-10998
[6]   A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling [J].
Chiang, Tsung-Che ;
Lin, Hsiao-Jou .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) :87-98
[7]   An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search [J].
DauzerePeres, S ;
Paulli, J .
ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) :281-306
[8]  
Deb K., 2000, Parallel Problem Solving from Nature PPSN VI. 6th International Conference. Proceedings (Lecture Notes in Computer Science Vol.1917), P849
[9]   A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups [J].
Defersha, Fantahun M. ;
Chen, Mingyuan .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 49 (1-4) :263-279
[10]   A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling [J].
Deng, Qianwang ;
Gong, Guiliang ;
Gong, Xuran ;
Zhang, Like ;
Liu, Wei ;
Ren, Qinghua .
COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2017, 2017