SA algorithm based on block properties of large-scale FSPs | |
Jin Feng ; Song Shi-ji ; Wu Cheng | |
2010-05-06 ; 2010-05-06 | |
关键词 | Theoretical or Mathematical/ flow shop scheduling probability simulated annealing/ block properties large-scale FSP simulated annealing flow shop scheduling/ C1290F Systems theory applications in industry C1180 Optimisation techniques C1140Z Other topics in statistics E1010 Production management E0210G Optimisation E0210J Statistics E1540 Systems theory applications |
中文摘要 | Simulated annealing (SA) algorithm is one of the commonly used approaches in solving flow shop scheduling problems (FSPs). For the large-scale FSPs, the accepting probability of the candidate neighbor decreases greatly as the size of neighborhood and the number of bad neighbors increase, which leads to low performance of SA. A kind of simulated annealing algorithm based on the block properties of FSP is proposed to solve the problem. In the proposed algorithm, the whole neighborhood is first divided into several small sub-neighborhoods. The best neighbor in the whole sub-neighborhood is selected as the candidate neighbor so as to increase the accepting probability. Moreover, the block properties of FSP is introduced, with which the size of neighborhood is greatly reduced, and search is then focused on the promising area of the neighborhood, which enhance the performance more. Numerical experiments show that the near-optimal solutions of large-scale FSPs can be found in a short time with the proposed algorithm. |
语种 | 中文 ; 中文 |
出版者 | Science Press ; China |
内容类型 | 期刊论文 |
源URL | [http://hdl.handle.net/123456789/8900] |
专题 | 清华大学 |
推荐引用方式 GB/T 7714 | Jin Feng,Song Shi-ji,Wu Cheng. SA algorithm based on block properties of large-scale FSPs[J],2010, 2010. |
APA | Jin Feng,Song Shi-ji,&Wu Cheng.(2010).SA algorithm based on block properties of large-scale FSPs.. |
MLA | Jin Feng,et al."SA algorithm based on block properties of large-scale FSPs".(2010). |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论