A new methodology of simulated annealing for the optimisation problems

doi:10.1016/0378-4371(94)90514-2

淡江大學機構典藏 > 理學院 > 物理學系暨研究所 > 期刊論文 > Item 987654321/107891

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/107891

題名:	A new methodology of simulated annealing for the optimisation problems
作者:	Lin, Simon C.;Hsueh, James H.C.
日期:	1994-04-01
上傳時間:	2016-10-13 02:10:30 (UTC+8)
出版者:	Elsevier Science B.V.
摘要:	Complex optimisation problems with many degrees of freedom are often characterised by the enormously large configuration space, typically O(eN) or O(N!). The idea of simulated annealing (SA) proposed by Kirkpatrick has been applied to the complex optimisation problems, which can be treated as annealing a statistical mechanical system from high temperature to low temperature; however, the SA is terribly slow for large problem sizes in typically O(N3lnN) time. We discover the hybrid algorithm (HA), which is based on a hybrid mechanism which combines conventional heuristics with low temperature simulated annealing (LTSA), which could be parallelised easily. The HA is a new approach of resolving optimisation problems with O(N) complexity where information propagation can be inhibited by restraining the range of searches in the configuration space. We use the HA to resolve several famous combinatorial optimisation problems, including the travelling salesman problem (TSP) of large sizes up to 1 000 000 cities within 3 to 5 percent of the optimal value in linear time and other nonuniformly distributed TSPs as well. We shall also discuss the applicability of the HA to the optimisation problems in general.
關聯:	Physica A: Statistical Mechanics and its Applications 205(1-3), pp.367-374
DOI:	10.1016/0378-4371(94)90514-2
顯示於類別:	[物理學系暨研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	202	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....