English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 50123/85142 (59%)
造访人次 : 7906825      在线人数 : 59
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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
    显示于类别:[物理學系暨研究所] 期刊論文


    档案 描述 大小格式浏览次数



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