Hybrid Memetic Algorithm to Solve Multiobjective Distributed Fuzzy Flexible Job Shop Scheduling Problem with Transfer

被引:13
作者
Yang, Jinfeng [1 ]
Xu, Hua [1 ]
机构
[1] Jiangnan Univ, Sch Artificial Intelligence & Comp Sci, Wuxi 214122, Jiangsu, Peoples R China
关键词
mutiobjective; distributed flexible job shop scheduling; fuzzy transfer time; fuzzy processing time; memetic algorithm; weight vector; variable neighborhood search; GENETIC ALGORITHM; OPTIMIZATION;
D O I
10.3390/pr10081517
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
Most studies on distributed flexible job shop scheduling problem (DFJSP) assume that both processing time and transmission time are crisp values. However, due to the complexity of the factory processing environment, the processing information is uncertain. Therefore, we consider the uncertainty of processing environment, and for the first time propose a multiobjective distributed fuzzy flexible job shop scheduling problem with transfer (MO-DFFJSPT). To solve the MO-DFFJSPT, a hybrid decomposition variable neighborhood memetic algorithm (HDVMA) is proposed with the objectives of minimizing the makespan, maximum factory load, and total workload. In the proposed HDVMA, the well-designed encoding/decoding method and four initialization rules are used to generate the initial population, and several effective evolutionary operators are designed to update populations. Additionally, a weight vector is introduced to design high quality individual selection rules and acceptance criteria. Then, three excellent local search operators are designed for variable neighborhood search (VNS) to enhance its exploitation capability. Finally, a Taguchi experiment is designed to adjust the important parameters. Fifteen benchmarks are constructed, and the HDVMA is compared with four other famous algorithms on three metrics. The experimental results show that HDVMA is superior to the other four algorithms in terms of convergence and uniformity of non-dominated solution set distribution.
引用
收藏
页数:23
相关论文
共 30 条
[1]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[2]   A Pareto based discrete Jaya algorithm for multi-objective flexible job shop scheduling problem [J].
Caldeira, Rylan H. ;
Gnanavelbabu, A. .
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 170
[3]   Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms [J].
Chang, Hao-Chin ;
Liu, Tung-Kuan .
JOURNAL OF INTELLIGENT MANUFACTURING, 2017, 28 (08) :1973-1986
[4]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[5]   An improved artificial bee colony algorithm for flexible job-shop scheduling problem with fuzzy processing time [J].
Gao, Kai Zhou ;
Suganthan, Ponnuthurai Nagaratnam ;
Pan, Quan Ke ;
Chua, Tay Jin ;
Chong, Chin Soon ;
Cai, Tian Xiang .
EXPERT SYSTEMS WITH APPLICATIONS, 2016, 65 :52-67
[6]   A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion [J].
Gao, Kai Zhou ;
Suganthan, Ponnuthurai Nagaratnam ;
Chua, Tay Jin ;
Chong, Chin Soon ;
Cai, Tian Xiang ;
Pan, Qan Ke .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (21) :7652-7663
[7]   An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time [J].
Gao, Kai Zhou ;
Suganthan, Ponnuthurai Nagaratnam ;
Pan, Quan Ke ;
Tasgetiren, Mehmet Fatih .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (19) :5896-5911
[8]   Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling [J].
Lei, Deming .
APPLIED SOFT COMPUTING, 2012, 12 (08) :2237-2245
[9]   Swarm-based neighbourhood search algorithm for fuzzy flexible job shop scheduling [J].
Lei, Deming ;
Guo, Xiuping .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (06) :1639-1649
[10]   A genetic algorithm for flexible job shop scheduling with fuzzy processing time [J].
Lei, Deming .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (10) :2995-3013