n-dimensional Cauchy neighbor generation for the fast simulate dannealing

Dongkyung Nam, Jong Seok Lee, Cheol Hoon Park

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)2499-2502
Number of pages4
JournalIEICE Transactions on Information and Systems
VolumeE87-D
Issue number11
Publication statusPublished - 2004 Jan 1

Fingerprint

Simulated annealing

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

@article{fcbe399e9cde47178c547a36acb0bbed,
title = "n-dimensional Cauchy neighbor generation for the fast simulate dannealing",
abstract = "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.",
author = "Dongkyung Nam and Lee, {Jong Seok} and Park, {Cheol Hoon}",
year = "2004",
month = "1",
day = "1",
language = "English",
volume = "E87-D",
pages = "2499--2502",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "11",

}

n-dimensional Cauchy neighbor generation for the fast simulate dannealing. / Nam, Dongkyung; Lee, Jong Seok; Park, Cheol Hoon.

In: IEICE Transactions on Information and Systems, Vol. E87-D, No. 11, 01.01.2004, p. 2499-2502.

Research output: Contribution to journalArticle

TY - JOUR

T1 - n-dimensional Cauchy neighbor generation for the fast simulate dannealing

AU - Nam, Dongkyung

AU - Lee, Jong Seok

AU - Park, Cheol Hoon

PY - 2004/1/1

Y1 - 2004/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=10444288769&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10444288769&partnerID=8YFLogxK

M3 - Article

VL - E87-D

SP - 2499

EP - 2502

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 11

ER -