教師資料查詢 | 類別: 期刊論文 | 教師: 陳世興CHEN, SHIH-HSIN (瀏覽個人網頁)

標題:Extended Artificial Chromosomes Genetic Algorithm for Permutation Flowshop Scheduling problems
學年100
學期2
出版(發表)日期2012/03/01
作品名稱Extended Artificial Chromosomes Genetic Algorithm for Permutation Flowshop Scheduling problems
作品名稱(其他語言)
著者Chen, Y. M.; M. C. Chen; P. C. Chang; S. H. Chen
單位
出版者
著錄名稱、卷期、頁數Computers & Industrial Engineering 62(2), p.536–545
摘要In our previous researches, we proposed the artificial chromosomes with genetic algorithm (ACGA) which combines the concept of the Estimation of Distribution Algorithms (EDAs) with genetic algorithms (GAs). The probabilistic model used in the ACGA is the univariate probabilistic model. We showed that ACGA is effective in solving the scheduling problems. In this paper, a new probabilistic model is proposed to capture the variable linkages together with the univariate probabilistic model where most EDAs could use only one statistic information. This proposed algorithm is named extended artificial chromosomes with genetic algorithm (eACGA). We investigate the usefulness of the probabilistic models and to compare eACGA with several famous permutation-oriented EDAs on the benchmark instances of the permutation flowshop scheduling problems (PFSPs). eACGA yields better solution quality for makespan criterion when we use the average error ratio metric as their performance measures. In addition, eACGA is further integrated with well-known heuristic algorithms, such as NEH and variable neighborhood search (VNS) and it is denoted as eACGAhybrid to solve the considered problems. No matter the solution quality and the computation efficiency, the experimental results indicate that eACGAhybrid outperforms other known algorithms in literature. As a result, the proposed algorithms are very competitive in solving the PFSPs.
關鍵字Evolutionary algorithm with probabilistic models;Scheduling problems;Estimation of distribution algorithms
語言英文
ISSN1879-0550
期刊性質國外
收錄於SCI;
產學合作
通訊作者
審稿制度
國別英國
公開徵稿
出版型式,電子版,紙本
相關連結
SDGs
Google+ 推薦功能,讓全世界都能看到您的推薦!