Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/73501
題名: | A new heuristic based on local best solution for permutation flow shop scheduling | 作者: | 陳春龍 Chen, Chun-Lung;Tzeng, Yeu-Ruey;Chen, Chuen-Lung |
貢獻者: | 資管系 | 關鍵詞: | Scheduling; Heuristic; Permutation flow shop scheduling; Makespan | 日期: | 四月-2015 | 上傳時間: | 12-二月-2015 | 摘要: | This paper proposes a population-based heuristic based on the local best solution (HLBS) for the minimization of makespan in permutation flow shop scheduling problems. The proposed heuristic operates through three mechanisms: (i) it introduces a new method to produce a trace-model for guiding the search, (ii) it modifies a filter strategy to filter the solution regions that have been reviewed and guide the search to new solution regions in order to keep the search from trapping into local optima, and (iii) it initiates a new jump strategy to help the search escape if the search is trapped at a local optimum. Computational experiments on the well-known Taillard`s benchmark data sets demonstrate that the proposed algorithm generated high quality solutions when compared to existing population-based search algorithms such as genetic algorithms, ant colony optimization, and particle swarm optimization. | 關聯: | Applied Soft Computing,29,75-81 | 資料類型: | article | DOI: | http://dx.doi.org/10.1016/j.asoc.2014.12.011 |
Appears in Collections: | 期刊論文 |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.