Referenced Items are not available for this document.
Conventional differential evolution (CDE) algorithm runs the risk of being trapped by local optima because of its greedy updating strategy and intrinsic differential property. A novel simulated annealing differential evolution (SADE) algorithm is proposed to compute optimal reactive power flow (ORPF). With the aid of simulated annealing updating strategy, SADE is able to escape from the local optima, and achieve the balance between exploration and exploitation. Optimization results on ORPF of IEEE standard 118 nodes system indicate that SADE outperforms CDE in the global search ability.
Published in:
Computational Intelligence and Design, 2008. ISCID '08. International Symposium on
(Volume:2
)
Date of Conference: 17-18 Oct. 2008
- Page(s):
- 185 - 189
- Print ISBN:
- 978-0-7695-3311-7
- INSPEC Accession Number:
- 10451023
- Conference Location :
- Wuhan
- Digital Object Identifier :
- 10.1109/ISCID.2008.40
- 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.
