Flow shop scheduling based on a novel cooling temperature driven simulated annealing algorithm

勤益科大機構典藏 > 電資學院 > 資訊工程系(所) > 【資訊工程系所】期刊論文 > Item 987654321/5981

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncut.edu.tw/handle/987654321/5981

题名:	Flow shop scheduling based on a novel cooling temperature driven simulated annealing algorithm
作者:	陳瑞茂
贡献者:	資訊工程系
日期:	2015-08
上传时间:	2017-09-26 09:19:16 (UTC+8)
摘要:	The Permutation Flow Shop Problem (PFSP) has been applied to many types of problems. The PFSP is an NP-hard permutation sequencing scheduling problem. A local search with simulated annealing scheme involving two phases is proposed in this investigation for solving PFSP. First, for lowering computation complexity, a simple insertion local search is applied to generate the solution of the PFSP. Second, two non-decreasing cooling temperature driven Simulated Annealing (SA), namely, steady SA and reheating SA are employed to maintain successive exploration or exploitation in the solution space. The steady SA maintains the same temperature and keeps the same search behavior and thereby allows the neighbors of the worse solutions to be explored, consequently increasing the chances of finding better solutions, while the reheating SA increases the temperature and exploration ability. The most important feature of the proposed method is its simple implementation and low computation time complexity. Experimental results are compared with other state-of-the-art algorithms and reveal that the proposed simple insertion with steady SA (SI-SSA) method is able to efficiently yield the best permutation schedules. © 2015 Sharif University of Technology. All rights reserved
關聯:	SCIENTIA IRANICA
显示于类别:	[資訊工程系(所)] 【資訊工程系所】期刊論文

文件中的档案:

没有与此文件相关的档案.

检视Licence

在NCUTIR中所有的数据项都受到原著作权保护.

数据加载中.....