Merits of using chromosome representations and shadow chromosomes in genetic algorithms for solving scheduling problems
檔案
本條目沒有附加檔案。
日期
2019-08-01
類型
系所
期刊名稱
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING
卷期與頁次
第 58 卷,頁 196–207
ISSN
0736-5845
語言
英文
摘要
Two conjectures, the use of incomplete chromosome representations and shadow chromosomes may improve the performance of genetic algorithms (GAs), are examined in this study. The examination entails testing distributed flexible job shop scheduling (DFJS) problems subject to preventive maintenance (PM) that involve four scheduling decisions. Genetic algorithms based on a complete chromosome representation that explicitly models the four decisions have been developed previously. By contrast, herein, two incomplete chromosome representations are proposed, whereby the conjectured advantages are two-fold. First, an incomplete chromosome representation models two scheduling decisions, and the remaining two are decoded by heuristic rules designed to ensure the load balance of manufacturing resources. Therefore, scheduling solutions with load imbalance will not be generated, which will help prevent the execution of ineffective searches. Second, a novel method of generating new chromosomes is developed and employed, instead of using traditional genetic operations. These chromosomes, called shadow chromosomes, are generated from good quality scheduling solutions and they may improve performance. Based on these two conjectures, four GAs are proposed. Numerical experiments reveal that each proposed GA outperforms the prior GAs substantially and the two conjectures are thus well justified. These findings shed light on the application of the two conjectures for developing metaheuristic algorithms to solve other high-dimensional space search problems.
關鍵詞
Genetic algorithmChromosome representationShadow chromosomeScheduling and preventive maintenance所屬典藏
期刊論文引用此條目
Lin, C.-S., Lee, I.-L., & Wu, M.-C. (2019). Merits of using chromosome representations and shadow chromosomes in genetic algorithms for solving scheduling problems. ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 58, 196–207. https://doi.org/10.1016/j.rcim.2019.01.005
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/152334