Hybrid optimisation method using PGA and SQP algorithm

Publisher:
IEEE
Publication Type:
Conference Proceeding
Citation:
Proceedings of the IEEE Symposium on Foundations of Computational Intelligence, 2007, pp. 73 - 80
Issue Date:
2007-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2006009451.pdf1.63 MB
Adobe PDF
This paper investigates the hybridisation of two very different optimisation methods, namely the Parallel Genetic Algorithm (PGA) and Sequential Quadratic Programming (SQP) algorithm. The different characteristics of genetic-based and traditional quadratic programming-based methods are discussed and to what extent the hybrid method can benefit the solving of optimisation problems with nonlinear complex objective and constraint functions. Experiments show the hybrid method effectively combines the robust and global search property of Parallel Genetic Algorithms with the high convergence velocity of the Sequential Quadratic Programming Algorithm, thereby reducing computation time, maintaining robustness and increasing solution quality.
Please use this identifier to cite or link to this item: