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 条
[1]   An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering [J].
Aickelin, U. ;
Burke, E. K. ;
Li, J. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (12) :1574-1585
[2]  
[Anonymous], 1994, POPULATION BASED INC
[3]  
[Anonymous], 2006, NEW EVOLUTIONARY COM
[4]   Inexact graph matching by means of estimation of distribution algorithms [J].
Bengoetxea, E ;
Larrañaga, P ;
Bloch, I ;
Perchant, A ;
Boeres, C .
PATTERN RECOGNITION, 2002, 35 (12) :2867-2880
[5]  
Bosman P., 2001, WORKSH 2001 GEN EV C
[6]  
Branke J, 2007, GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, P508
[7]   Approaches to Selection and their Effect on Fitness Modelling in an Estimation of Distribution Algorithm [J].
Brownlee, Alexander E. I. ;
McCall, John A. W. ;
Zhang, Qingfu ;
Brown, Deryck F. .
2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, :2621-+
[8]  
Brucker P., 1977, Ann. Discrete Math., V1, P343, DOI [DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]
[9]   A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems [J].
Ceberio, Josu ;
Irurozki, Ekhine ;
Mendiburu, Alexander ;
Lozano, Jose A. .
PROGRESS IN ARTIFICIAL INTELLIGENCE, 2012, 1 (01) :103-117
[10]   Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems [J].
Chang, Pei-Chann ;
Chen, Shih-Hsin ;
Fan, Chin-Yuan ;
Chan, Chien-Lung .
APPLIED MATHEMATICS AND COMPUTATION, 2008, 205 (02) :550-561