Demon algorithms and their application to optimization problems

Wood, and Downs, T (1998). Demon algorithms and their application to optimization problems. In: 2nd IEEE World Congress on Computational Intelligence (WCCI 98), Anchorage Ak, (1661-1666). May 04-09, 1998.

Author Wood,
Downs, T
Title of paper Demon algorithms and their application to optimization problems
Conference name 2nd IEEE World Congress on Computational Intelligence (WCCI 98)
Conference location Anchorage Ak
Conference dates May 04-09, 1998
Journal name Ieee World Congress On Computational Intelligence
Place of Publication NEW YORK
Publisher IEEE
Publication Year 1998
Year available 1998
Sub-type Fully published paper
Open Access Status Not yet assessed
ISBN 0-7803-4860-5
Start page 1661
End page 1666
Total pages 6
Language eng
Abstract/Summary We introduce four new general optimization algorithms based on the 'demon' algorithm from statistical physics and the simulated annealing (SA) optimization method. These algorithms reduce the computation time per trial without significant effect on the quality of solutions found. Any SA annealing schedule or move generation function can be used. The algorithms are tested on traveling salesman problems including Grotschel's 442-city problem with results comparable to SA. Applications to the Boltzmann machine are considered.
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status UQ

Document type: Conference Paper
Sub-type: Fully published paper
Collection: WoS Import
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 3 times in Thomson Reuters Web of Science Article | Citations
Google Scholar Search Google Scholar
Created: Sun, 24 Dec 2017, 17:04:51 EST