Paper Info
Title
A hybrid DE-SQP algorithm with switching procedure for dynamic optimization.
Abstract
A hybrid optimization algorithm DE-SQP is presented here to solve dynamic optimization problems. In this hybrid algorithm, differential evolution (DE) is firstly introduced to find the vicinity of the solution, and then sequential quadratic programming (SQP) is used to find the final solution. In particular, a new switching procedure is proposed to determine an efficient switching point at which the optimization is switched from the DE optimizer to the SQP optimizer. The proposed algorithm combines the two optimizers efficiently and avoids time consuming tests in advance. Performance of the DE-SQP algorithm is examined by solving two challenging multimodal optimal control problems. Simulation results show that the hybrid algorithm is insensitive to the initial point, and can find the final solution faster than the DE.
Year
DOI
Venue
2009
10.1109/CDC.2009.5399846
CDC
Keywords
DocType
Volume
quadratic programming,algorithm design and analysis,optimal control,optimization,dynamic programming,evolutionary computation,inductors,switches,trajectory
Conference
null
Issue
ISSN
ISBN
null
null
978-1-4244-3872-3
Citations 
PageRank 
References 
3
0.37
6
Authors
2
Name
Order
Citations
PageRank
Ping Wang130.37
Xuemin Tian2717.54