Referenced Items are not available for this document.
We introduce four new general optimization algorithms based on the `demon' algorithm from statistical physics and the simulated annealing (SA) optimization method. These algorithms reduce the computation time per trial without significant effect on the quality of solutions found. Any SA annealing schedule or move generation function can be used. The algorithms are tested on traveling salesman problems including Grotschel's 442-city problem (1984) with results comparable to SA. Applications to the Boltzmann machine are considered
Published in:
Neural Networks Proceedings, 1998. IEEE World Congress on Computational Intelligence. The 1998 IEEE International Joint Conference on
(Volume:2
)
Date of Conference: 4-9 May 1998
- Page(s):
- 1661 - 1666 vol.2
- Meeting Date :
- 04 May 1998-09 May 1998
- ISSN :
- 1098-7576
- Print ISBN:
- 0-7803-4859-1
- INSPEC Accession Number:
- 6047068
- Conference Location :
- Anchorage, AK
- Digital Object Identifier :
- 10.1109/IJCNN.1998.686028
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
