多群优化
粒子群优化
数学优化
惩罚法
连续优化
元启发式
离散优化
元优化
工程优化
最优化问题
计算机科学
帝国主义竞争算法
优化测试函数
博弈论
数学
数理经济学
作者
Kiran Kumar Annamdas,Singiresu S. Rao
标识
DOI:10.1080/03052150902822141
摘要
This study proposes particle swarm optimization (PSO) based algorithms to solve multi-objective engineering optimization problems involving continuous, discrete and/or mixed design variables. The original PSO algorithm is modified to include dynamic maximum velocity function and bounce method to enhance the computational efficiency and solution accuracy. The algorithm uses a closest discrete approach (CDA) to solve optimization problems with discrete design variables. A modified game theory (MGT) approach, coupled with the modified PSO, is used to solve multi-objective optimization problems. A dynamic penalty function is used to handle constraints in the optimization problem. The methodologies proposed are illustrated by several engineering applications and the results obtained are compared with those reported in the literature.
科研通智能强力驱动
Strongly Powered by AbleSci AI