Nearest-neighbour heuristics in accelerated algorithms of optimisation problems
學年 82
學期 2
出版（發表）日期 1994-03-15
作品名稱 Nearest-neighbour heuristics in accelerated algorithms of optimisation problems
作品名稱（其他語言）
著者 Lin, Simon C.; Hsueh, H.C.
單位
出版者
著錄名稱、卷期、頁數 Physica A: Statistical Mechanics and its Applications 203(3-4), pp.369-380
摘要 A scalable linear algorithm of simulated annealing (SA) was proposed by Lin et al. that is capable of achieving a near optimal solution for the travelling saleman problem in a controllable way. Since the linearity is based on the hybrid mechanism that combines SA heuristics with the scaling relation of acceptance ratio in the low temperature, other conventional heuristics in optimisation problems ought to be tried. The nearest-neighbour (NN) heuristics is thus studied, and one finds that the quenched configuration of NN's could be resurrected back to SA path by the hybrid mechanism. It is also verified that the same scalable linear algorithm of Lin's may continue to apply with exactly the same set of parameters.
關鍵字
語言 en
ISSN
期刊性質 國外
收錄於
產學合作
通訊作者
審稿制度 否
國別 NLD
公開徵稿
出版型式 ,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/107886 )

SDGS 優質教育