Fitness landscape analysis for the no-wait flow-shop scheduling problem

被引：17
作者：
Czogalla, Jens [1 ]
Fink, Andreas [1 ]
机构：
[1] Helmut Schmidt Univ, Holstenhofweg 85, D-22043 Hamburg, Germany
来源：
JOURNAL OF HEURISTICS | 2012年 / 18卷 / 01期
关键词：
Evolutionary computation; Combinatorial optimization problem; No-wait (continuous) flow-shop scheduling; Fitness landscape analysis; PARTICLE SWARM OPTIMIZATION; DISTANCE MEASURES; ALGORITHMS; SHOP; MINIMIZE;
D O I：
10.1007/s10732-010-9155-x
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The fitness landscape of the no-wait (continuous) flow-shop scheduling problem is investigated by examining the ruggedness of the landscape and the correlation between the quality of a solution and its distance to an optimal solution. The results confirm the presence of a big valley structure as known from other combinatorial optimization problems. The suitability of the landscape for search with evolutionary computation and local search methods is discussed. The observations are validated by experiments with two evolutionary algorithms.
引用
收藏
页码：25 / 51
页数：27
相关论文
共 50 条
[41]   An effective hybrid particle swarm optimization for no-wait flow shop scheduling [J].
Bo Liu ;
Ling Wang ;
Yi-Hui Jin .
The International Journal of Advanced Manufacturing Technology, 2007, 31 :1001-1011
[42]   A factorial based particle swarm optimization with a population adaptation mechanism for the no-wait flow shop scheduling problem with the makespan objective [J].
Zhao, Fuqing ;
Qin, Shuo ;
Yang, Guoqiang ;
Ma, Weimin ;
Zhang, Chuck ;
Song, Houbin .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 126 :41-53
[43]   A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion [J].
Quan-Ke Pan ;
Ling Wang ;
M. Fatih Tasgetiren ;
Bao-Hua Zhao .
The International Journal of Advanced Manufacturing Technology, 2008, 38 :337-347
[44]   A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion [J].
Pan, Quan-Ke ;
Wang, Ling ;
Tasgetiren, M. Fatih ;
Zhao, Bao-Hua .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 38 (3-4) :337-347
[45]   An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem [J].
Shao, Weishi ;
Pi, Dechang ;
Shao, Zhongshi .
APPLIED SOFT COMPUTING, 2017, 61 :193-210
[46]   Proportionate flow-shop scheduling with rejection [J].
Shabtay, Dvir ;
Oron, Daniel .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2016, 67 (05) :752-769
[47]   The just-in-time scheduling problem in a flow-shop scheduling system [J].
Shabtay, Dvir .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 216 (03) :521-532
[48]   A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems [J].
Pan, Quan-Ke ;
Wang, Ling ;
Qian, Bin .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (08) :2498-2511
[49]   Studying the effect of server side-constraints on the makespan of the no-wait flow-shop problem with sequence-dependent set-up times [J].
Samarghandi, Hamed .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (09) :2652-2673
[50]   Solutions to No-Wait Flow Shop Scheduling Problem Using the Flower Pollination Algorithm Based on the Hormone Modulation Mechanism [J].
Qu, Chiwen ;
Fu, Yanming ;
Yi, Zhongjun ;
Tan, Jun .
COMPLEXITY, 2018,
12345