DocumentCode :
1253770
Title :
Modified mean field annealing algorithm for combinatorial optimisation problems with continuous state space
Author :
Oh-Jun Kwon ; Sung-Yang Bang
Author_Institution :
Dept. of Comput. Sci. & Eng., Pohang Univ. of Sci. & Technol.
Volume :
33
Issue :
11
fYear :
1997
fDate :
5/22/1997 12:00:00 AM
Firstpage :
968
Lastpage :
969
Abstract :
The authors present a modified mean field annealing algorithm which supports the combinatorial optimisation problems with continuous real-valued states. The proposed algorithm has been applied to the construction of D-optimal designs for a simple polynomial regression model with degree 5. Experimental results show that the proposed algorithm is useful and effective in terms of computation time and the quality of solutions, compared with the stochastic simulated annealing algorithm
Keywords :
combinatorial mathematics; optimisation; polynomials; simulated annealing; state-space methods; D-optimal design; combinatorial optimisation; continuous state space; modified mean field annealing algorithm; polynomial regression model; real-valued states;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19970641
Filename :
591584
Link To Document :
بازگشت