Nearest-neighbour heuristics in accelerated algorithms of optimisation problems

機構典藏 > College of Sciences > Graduate Institute & Department of Physics > Journal Article > Item 987654321/107886

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/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:	[Graduate Institute & Department of Physics] Journal Article

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	214	View/Open