Presentation 2014-10-16
Improvement of Simulated Annealing Search Based on Tree Representations
Takaaki BANNO, Kunihiro FUJIYOSHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Simulated Annealing is a metaheuristic for the general optimization problem of locating a good approximation to the global minimum of a given cost function in a large solution space. To search suboptimal solutions by Simulated Annealing, it is necessary to define appropriate perturbations. In this paper, we assumed that the degradation of search efficiency are caused when adjacent solution needs several times of perturbations to restore it which was made by once. Therefore, we set limits in perturbations so that they can restore any solution in constant times and test them to see the improvement of search efficiency, and confirm the efficacy.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Simulated Annealing / tree representations / perturbations / O-tree / DTS
Paper # CAS2014-51,NLP2014-45
Date of Issue

Conference Information
Committee CAS
Conference Date 2014/10/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Circuits and Systems (CAS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Improvement of Simulated Annealing Search Based on Tree Representations
Sub Title (in English)
Keyword(1) Simulated Annealing
Keyword(2) tree representations
Keyword(3) perturbations
Keyword(4) O-tree
Keyword(5) DTS
1st Author's Name Takaaki BANNO
1st Author's Affiliation Tokyo University of Agriculture and Technology()
2nd Author's Name Kunihiro FUJIYOSHI
2nd Author's Affiliation Tokyo University of Agriculture and Technology
Date 2014-10-16
Paper # CAS2014-51,NLP2014-45
Volume (vol) vol.114
Number (no) 249
Page pp.pp.-
#Pages 6
Date of Issue