Addressing the advantages of using ensemble probabilistic models in Estimation of Distribution Algorithms for scheduling problems

被引:23
作者
Chen, Shih-Hsin [1 ]
Chen, Min-Chih [2 ]
机构
[1] Nanhua Univ, Dept Elect Commerce Management, Dalin 62248, Taiwan
[2] WuFeng Univ, Dept Informat Management, Wufeng 62153, Taiwan
关键词
Estimation of Distribution Algorithms; Single machine scheduling problem; Permutation flowshop scheduling problem; Self-Guided Genetic Algorithm; GENETIC ALGORITHM; ARTIFICIAL CHROMOSOMES; LOCAL SEARCH; MACHINE; OPTIMIZATION; HEURISTICS; EARLINESS;
D O I
10.1016/j.ijpe.2012.05.010
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Estimation of Distribution Algorithms (EDAs) have recently been recognized as a prominent alternative to traditional evolutionary algorithms due to their increasing popularity. The core of EDAs is a probabilistic model which directly impacts performance of the algorithm. Previous EDAs have used a univariate, bi-variate, or multi-variable probabilistic model each time. However, application of only one probabilistic model may not represent the parental distribution well. This paper advocates the importance of using ensemble probabilistic models in EDAs. We combine the univariate probabilistic model with the bi-variate probabilistic model which learns different population characteristics. To explain how to employ the two probabilistic models, we proposed the Ensemble Self-Guided Genetic Algorithm (eSGGA). The extensive computation results on two NP-hard scheduling problems indicate the advantages of adopting two probabilistic models. Most important of all, eSGGA can avoid the computation effort overhead when compared with other EDAs employing two models. As a result, this paper might point out a next generation approach for EDAs. (c) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:24 / 33
页数:10
相关论文
共 51 条
[11]   Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems [J].
Chang, Pei-Chann ;
Chen, Shih-Shin ;
Fan, Chin-Yuan .
APPLIED SOFT COMPUTING, 2008, 8 (01) :767-777
[12]   Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems [J].
Chang, Pei-Chann ;
Chen, Shih-Hsin ;
Fan, Chin-Yuan ;
Mani, V. .
ANNALS OF OPERATIONS RESEARCH, 2010, 180 (01) :197-211
[13]   A Self-guided Genetic Algorithm for permutation flowshop scheduling problems [J].
Chen, Shih-Hsin ;
Chang, Pei-Chann ;
Cheng, T. C. E. ;
Zhang, Qingfu .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) :1450-1457
[14]   EA/G-GA for Single Machine Scheduling Problems with Earliness/Tardiness Costs [J].
Chen, Shih-Hsin ;
Chen, Min-Chih ;
Chang, Pei-Chann ;
Chen, Yuh-Min .
ENTROPY, 2011, 13 (06) :1152-1169
[15]   Guidelines for developing effective Estimation of Distribution Algorithms in solving single machine scheduling problems [J].
Chen, Shih-Hsin ;
Chen, Min-Chih ;
Chang, Pei-Chann ;
Zhang, Qingfu ;
Chen, Yuh-Min .
EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (09) :6441-6451
[16]  
Chen SH, 2009, INT J INNOV COMPUT I, V5, P4753
[17]   Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems [J].
Chen, Yuh-Min ;
Chen, Min-Chih ;
Chang, Pei-Chann ;
Chen, Shih-Hsin .
COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 62 (02) :536-545
[18]   A review and classification of heuristics for permutation flow-shop scheduling with makespan objective [J].
Framinan, JM ;
Gupta, JND ;
Leisten, R .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (12) :1243-1255
[19]   Ensemble of surrogates [J].
Goel, Tushar ;
Haftka, Raphael T. ;
Shyy, Wei ;
Queipo, Nestor V. .
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2007, 33 (03) :199-216
[20]   Variable neighborhood search: Principles and applications [J].
Hansen, P ;
Mladenovic, N .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 130 (03) :449-467