English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 49521/84657 (58%)
造訪人次 : 7600719      線上人數 : 87
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/107886


    題名: Nearest-neighbour heuristics in accelerated algorithms of optimisation problems
    作者: Lin, Simon C.;Hsueh, H.C.
    日期: 1994-03-15
    上傳時間: 2016-10-13 02:10:22 (UTC+8)
    出版者: Elsevier Science B.V.
    摘要: 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.
    關聯: Physica A: Statistical Mechanics and its Applications 203(3-4), pp.369-380
    DOI: 10.1016/0378-4371(94)90005-1
    顯示於類別:[物理學系暨研究所] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML33檢視/開啟

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

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋