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

NCUTIR > College of Electrical Engineering and Computer Science > Department of Computer Science and Information Engineering > 【資訊工程系所】期刊論文 > Item 987654321/5981

Please use this identifier to cite or link to this item: http://ir.lib.ncut.edu.tw/handle/987654321/5981

Title:	Flow shop scheduling based on a novel cooling temperature driven simulated annealing algorithm
Authors:	陳瑞茂
Contributors:	資訊工程系
Date:	2015-08
Issue Date:	2017-09-26 09:19:16 (UTC+8)
Abstract:	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
Relation:	SCIENTIA IRANICA
Appears in Collections:	[Department of Computer Science and Information Engineering] 【資訊工程系所】期刊論文

Files in This Item:

There are no files associated with this item.

View Licence

Loading...