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
关键词
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 条
  • [31] Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan
    Davendra, Donald
    Zelinka, Ivan
    Bialic-Davendra, Magdalena
    Senkerik, Roman
    Jasek, Roman
    MATHEMATICAL AND COMPUTER MODELLING, 2013, 57 (1-2) : 100 - 110
  • [32] A composite heuristic for the no-wait flow shop scheduling
    Gao Kaizhou
    Suganthan, P. N.
    Bao Zhenqiang
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [33] Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution
    Bin Qian
    Ling Wang
    De-Xian Huang
    Xiong Wang
    Soft Computing, 2009, 13 : 847 - 869
  • [34] Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization
    Kaizhou Gao
    Quanke Pan
    P. N. Suganthan
    Junqing Li
    The International Journal of Advanced Manufacturing Technology, 2013, 66 : 1563 - 1572
  • [35] Multi-objective no-wait flow-shop scheduling with a memetic algorithm based on differential evolution
    Qian, Bin
    Wang, Ling
    Huang, De-Xian
    Wang, Xiong
    SOFT COMPUTING, 2009, 13 (8-9) : 847 - 869
  • [36] A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling
    Wang, Shijin
    Liu, Ming
    Chu, Chengbin
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (04) : 1143 - 1167
  • [37] Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization
    Gao, Kaizhou
    Pan, Quanke
    Suganthan, P. N.
    Li, Junqing
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 66 (9-12): : 1563 - 1572
  • [38] A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem
    Zhao, Fuqing
    Liu, Huan
    Zhang, Yi
    Ma, Weimin
    Zhang, Chuck
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 91 : 347 - 363
  • [39] An Improved Multiobjective Evolutionary Algorithm for Solving the No-wait Flow Shop Scheduling Problem
    Yeh, Tsung-Su
    Chiang, Tsung-Che
    2018 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEE IEEM), 2018, : 142 - 147
  • [40] Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
    Shao, Weishi
    Shao, Zhongshi
    Pi, Dechang
    COMPUTERS & OPERATIONS RESEARCH, 2021, 136