Modified mean field annealing algorithm for combinatorial optimisation problems with continuous state space

Access Full Text

Modified mean field annealing algorithm for combinatorial optimisation problems with continuous state space

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

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.

Inspec keywords: combinatorial mathematics; polynomials; optimisation; simulated annealing; state-space methods

Other keywords: polynomial regression model; combinatorial optimisation; modified mean field annealing algorithm; real-valued states; D-optimal design; continuous state space

Subjects: Combinatorial mathematics; Combinatorial mathematics; Optimisation techniques; Optimisation techniques

References

    1. 1)
      • D.E. Van den Bout , T. Miller . Graph partitioning using annealed neural networks. IEEE Trans. Neural Networks , 192 - 203
    2. 2)
      • L.M. Haines . The application of the annealing algorithm to the construction of exactoptimal designs for linear-regression models. Technometrics , 439 - 447
    3. 3)
      • N. Ansari , E.S.H. Hou , Y. Yu . A new method to optimise the satellite broadcasting schedules using themean field annealing of a Hopfield neural network. IEEE Trans. Neural Networks , 470 - 483
    4. 4)
      • G. Bilbro , R. Mann , T. Miller , W. Snyder , D.E. Van den Bout , M. White . Optimisation by mean field annealing. Adv. Neural Info. Process. Syst. , 91 - 98
    5. 5)
      • S. Kirkpatrick , C.D. Gelatt , M.P. Vecchi . Optimisation by simulated annealing. Science , 671 - 680
    6. 6)
      • C. Peterson , J.R. Anderson . A mean field theory learning algorithm for neural networks. Complex Systems , 995 - 1019
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19970641
Loading

Related content

content/journals/10.1049/el_19970641
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading