English  |  正體中文  |  简体中文  |  Items with full text/Total items : 58323/91867 (63%)
Visitors : 14040350      Online Users : 101
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/107886

    Title: Nearest-neighbour heuristics in accelerated algorithms of optimisation problems
    Authors: Lin, Simon C.;Hsueh, H.C.
    Date: 1994-03-15
    Issue Date: 2016-10-13 02:10:22 (UTC+8)
    Publisher: Elsevier Science B.V.
    Abstract: 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.
    Relation: Physica A: Statistical Mechanics and its Applications 203(3-4), pp.369-380
    DOI: 10.1016/0378-4371(94)90005-1
    Appears in Collections:[物理學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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