File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/CEC.2008.4631046
- Scopus: eid_2-s2.0-55749101909
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A non-revisiting simulated annealing algorithm
Title | A non-revisiting simulated annealing algorithm |
---|---|
Authors | |
Issue Date | 2008 |
Publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4235 |
Citation | The 2008 IEEE Congress on Evolutionary Computation (CEC 2008), Hong Kong, China, 1-6 June 2008. In IEEE Transactions on Evolutionary Computation, 2008, p. 1886-1892 How to Cite? |
Abstract | In this article, a non-revisiting simulated annealing algorithm (NrSA) is proposed. NrSA is an integration of the non-revisiting scheme and standard simulated annealing (SA). It guarantees that every generated neighbor must not be visited before. This property leads to reduction on the computation cost on evaluating time consuming and expensive objective functions such as surface registration, optimized design and energy management of heating, ventilating and air conditioning systems. Meanwhile, the prevention on function re-evaluation also speeds up the convergence. Furthermore, due to the nature of the non-revisiting scheme, the returned non-revisited solutions from the scheme can be treated as self-adaptive solutions, such that no parametric neighbor picking scheme is involved in NrSA. Thus NrSA can be identified as a parameter-less SA. The simulation results show that NrSA is superior to adaptive SA (ASA) on both uni-modal and multi-modal functions with dimension up to 40. We also illustrate that the overhead and archive size of NrSA are insignificant, so it is practical for real world applications. © 2008 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/196703 |
ISBN | |
ISSN | 2023 Impact Factor: 11.7 2023 SCImago Journal Rankings: 5.209 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yuen, SY | - |
dc.contributor.author | Chow, CK | - |
dc.date.accessioned | 2014-04-24T02:10:35Z | - |
dc.date.available | 2014-04-24T02:10:35Z | - |
dc.date.issued | 2008 | - |
dc.identifier.citation | The 2008 IEEE Congress on Evolutionary Computation (CEC 2008), Hong Kong, China, 1-6 June 2008. In IEEE Transactions on Evolutionary Computation, 2008, p. 1886-1892 | - |
dc.identifier.isbn | 978-1-4244-1822-0 | - |
dc.identifier.issn | 1089-778X | - |
dc.identifier.uri | http://hdl.handle.net/10722/196703 | - |
dc.description.abstract | In this article, a non-revisiting simulated annealing algorithm (NrSA) is proposed. NrSA is an integration of the non-revisiting scheme and standard simulated annealing (SA). It guarantees that every generated neighbor must not be visited before. This property leads to reduction on the computation cost on evaluating time consuming and expensive objective functions such as surface registration, optimized design and energy management of heating, ventilating and air conditioning systems. Meanwhile, the prevention on function re-evaluation also speeds up the convergence. Furthermore, due to the nature of the non-revisiting scheme, the returned non-revisited solutions from the scheme can be treated as self-adaptive solutions, such that no parametric neighbor picking scheme is involved in NrSA. Thus NrSA can be identified as a parameter-less SA. The simulation results show that NrSA is superior to adaptive SA (ASA) on both uni-modal and multi-modal functions with dimension up to 40. We also illustrate that the overhead and archive size of NrSA are insignificant, so it is practical for real world applications. © 2008 IEEE. | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4235 | - |
dc.relation.ispartof | IEEE Transactions on Evolutionary Computation | - |
dc.rights | ©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.title | A non-revisiting simulated annealing algorithm | - |
dc.type | Conference_Paper | - |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/CEC.2008.4631046 | - |
dc.identifier.scopus | eid_2-s2.0-55749101909 | - |
dc.identifier.spage | 1886 | - |
dc.identifier.epage | 1892 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 160602 amended | - |
dc.identifier.issnl | 1089-778X | - |