共 50 条
Discrete evolutionary multi-objective optimization for energy-efficient blocking flow shop scheduling with setup time
被引:95
|作者:
Han, Yuyan
[1
]
Li, Junqing
[1
,2
]
Sang, Hongyan
[1
]
Liu, Yiping
[5
]
Gao, Kaizhou
[4
]
Pan, Quanke
[3
]
机构:
[1] Liaocheng Univ, Sch Comp Sci, Liaocheng 252059, Shandong, Peoples R China
[2] Shandong Normal Univ, Sch Comp Sci, Jinan 252000, Peoples R China
[3] Shanghai Univ, Sch Mechatron Engn & Automat, Shanghai 200072, Peoples R China
[4] Macau Univ Sci & Technol, Macau Inst Syst Engn, Macau 999078, Peoples R China
[5] Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Peoples R China
基金:
中国国家自然科学基金;
关键词:
Blocking flow shop;
Energy consumption;
Multi-objective evolutionary optimization;
Self-adaptive;
FLEXIBLE JOB-SHOP;
WATER-WAVE OPTIMIZATION;
BEE COLONY ALGORITHM;
TRANSPORTATION;
CONSUMPTION;
MAKESPAN;
D O I:
10.1016/j.asoc.2020.106343
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
Sustainable scheduling problems have been attracted great attention from researchers. For the flow shop scheduling problems, researches mainly focus on reducing economic costs, and the energy consumption has not yet been well studied up to date especially in the blocking flow shop scheduling problem. Thus, we construct a multi-objective optimization model of the blocking flow shop scheduling problem with makespan and energy consumption criteria. Then a discrete evolutionary multi-objective optimization (DEMO) algorithm is proposed. The three contributions of DEMO are as follows. First, a variable single-objective heuristic is proposed to initialize the population. Second, the self-adaptive exploitation evolution and self-adaptive exploration evolution operators are proposed respectively to obtain high quality solutions. Third, a penalty-based boundary interstation based on the local search, called by PBI-based-local search, is designed to further improve the exploitation capability of the algorithm. Simulation results show that DEMO outperforms the three state-of-the-art algorithms with respect to hypervolume, coverage rate and distance metrics. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:15
相关论文