MODIFIED MEAN-FIELD ANNEALING ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS WITH CONTINUOUS STATE-SPACE

Authors
KWON OJ LEE WD BANG SY
Citation
Oj. Kwon et al., MODIFIED MEAN-FIELD ANNEALING ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS WITH CONTINUOUS STATE-SPACE, Electronics Letters, 33(11), 1997, pp. 968-969
Citations number
6
Categorie Soggetti
Engineering, Eletrical & Electronic
Journal title
Electronics Letters → ACNP
ISSN journal
00135194
Volume
33
Issue
11
Year of publication
1997
Pages
968 - 969
Database
ISI
SICI code
0013-5194(1997)33:11<968:MMAAFC>2.0.ZU;2-D
Abstract
The authors present a modified mean field annealing algorithm which su pports the combinatorial optimisation problems with continuous real-va lued states. The proposed algorithm has been applied to the constructi on of D-optimal designs for a simple polynomial regression model with degree 5. Experimental results show that the proposed algorithm is use ful and effective in terms of computation time and the quality of solu tions, compared with the stochastic simulated annealing algorithm.