1. NCCU Academic Hub
  2. 學術產出
  3. College of Commerce
  4. Periodical Articles
  5. Item

學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 A hybrid EDA with ACS for solving permutation flow shop scheduling
作者 陳春龍
Tzeng, Yeu-Ruey;Chen, Chun-Lung;Chen, Chuen-Lung
貢獻者 資管系
關鍵詞 Ant colony system; Estimation of distribution algorithm; Permutation flow shop scheduling; Makespan
日期 2012-06
上傳時間 12-Feb-2015 14:18:43 (UTC+8)
摘要 This paper proposes a hybrid estimation of distribution algorithm (EDA) with ant colony system (ACS) for the minimization of makespan in permutation flow shop scheduling problems. The core idea of EDA is that in each iteration, a probability model is estimated based on selected members in the iteration along with a sampling method applied to generate members from the probability model for the next iteration. The proposed algorithm, in each iteration, applies a new filter strategy and a local search method to update the local best solution and, based on the local best solution, generates pheromone trails (a probability model) using a new pheromone-generating rule and applies a solution construction method of ACS to generate members for the next iteration. In addition, a new jump strategy is developed to help the search escape if the search becomes trapped at a local optimum. Computational experiments on Taillard’s benchmark data sets demonstrate that the proposed algorithm generated high-quality solutions by comparing with the existing population-based search algorithms, such as genetic algorithms, ant colony optimization, and particle swarm optimization.
關聯 The International Journal of Advanced Manufacturing Technology,60(9-12),1139-1147
資料類型 article
DOI http://dx.doi.org/10.1007/s00170-011-3671-1
dc.contributor 資管系-
dc.creator (作者) 陳春龍-
dc.creator (作者) Tzeng, Yeu-Ruey;Chen, Chun-Lung;Chen, Chuen-Lung-
dc.date (日期) 2012-06-
dc.date.accessioned 12-Feb-2015 14:18:43 (UTC+8)-
dc.date.available 12-Feb-2015 14:18:43 (UTC+8)-
dc.date.issued (上傳時間) 12-Feb-2015 14:18:43 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/73494-
dc.description.abstract (摘要) This paper proposes a hybrid estimation of distribution algorithm (EDA) with ant colony system (ACS) for the minimization of makespan in permutation flow shop scheduling problems. The core idea of EDA is that in each iteration, a probability model is estimated based on selected members in the iteration along with a sampling method applied to generate members from the probability model for the next iteration. The proposed algorithm, in each iteration, applies a new filter strategy and a local search method to update the local best solution and, based on the local best solution, generates pheromone trails (a probability model) using a new pheromone-generating rule and applies a solution construction method of ACS to generate members for the next iteration. In addition, a new jump strategy is developed to help the search escape if the search becomes trapped at a local optimum. Computational experiments on Taillard’s benchmark data sets demonstrate that the proposed algorithm generated high-quality solutions by comparing with the existing population-based search algorithms, such as genetic algorithms, ant colony optimization, and particle swarm optimization.-
dc.format.extent 182498 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) The International Journal of Advanced Manufacturing Technology,60(9-12),1139-1147-
dc.subject (關鍵詞) Ant colony system; Estimation of distribution algorithm; Permutation flow shop scheduling; Makespan-
dc.title (題名) A hybrid EDA with ACS for solving permutation flow shop scheduling-
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1007/s00170-011-3671-1en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1007/s00170-011-3671-1en_US