Abstract
The multi-objective genetic algorithm(MOGA) and adaptive particle swarm optimization(APSO) algorithm are new variants of natural population-based search methods with the effective capability to solve extremely nonlinear mixed integer optimized complex engineering problems. This paper attempts to examine the performance and convergence analysis for MOGA and APSO algorithm with benchmarked test functions namely Rosen Brock, Six Hump Camel Back, Goldstein-Price’s and Rastrigin. The numerical simulation results indicate the adaptive particle swarm optimization algorithm was able to find the best solutions than a multi-objective genetic algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
