Hybrid optimisation method using PGA and SQP algorithm
- Publication Type:
- Conference Proceeding
- Proceedings of the 2007 IEEE Symposium on Foundations of Computational Intelligence, FOCI 2007, 2007, pp. 73 - 80
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
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. © 2007 IEEE.
Please use this identifier to cite or link to this item: