n-Dimensional cauchy neighbor generation for the fast simulated annealing

Cited 14 time in webofscience Cited 0 time in scopus
  • Hit : 211
  • Download : 0
Many simulated annealing algorithms use the Cauchy neighbors for fast convergence, and the conventional method uses the product of n one-dimensional Cauchy distributions as an approximation. However, this method slows down the search severely as the dimension gets high because of the dimension-wise neighbor generation. In this paper, we analyze the orthogonal neighbor characteristics of the conventional method and propose a method of generating symmetric neighbors from the n-dimensional Cauchy distribution. The simulation results show that the proposed method is very effective for the search in the simulated annealing and can be applied to many other stochastic optimization algorithms.
Publisher
IEICE-Inst Electronics Information Communications Eng
Issue Date
2004-11
Language
English
Article Type
Letter
Citation

IEICE TRANSACTIONS ON COMMUNICATIONS, v.E87D, no.11, pp.2499 - 2502

ISSN
0916-8516
URI
http://hdl.handle.net/10203/81835
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 14 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0