本文已被：浏览 1461次 下载 3505次
Received:September 19, 2015 Revised:November 13, 2015
Received:September 19, 2015 Revised:November 13, 2015
中文摘要: 遗传算法和粒子群算法都具有很强的搜索能力,在最优化问题中有着极其广泛的应用.文章针对常微分方程(DE)近似解和一般线性规划(LP)问题的解利用遗传算法和粒子群算法求解,深入的比较和分析了GA与PSO在这两种优化问题中的效率.在固定其他参数而调整群体数量的基础上比较了GA与PSO在微分方程近似解和LP问题解的优化能力.
Abstract:Genetic algorithm and Particle Swarm Optimization algorithm with strong search capability have a very wide range of applications in the optimization problem. This paper focuses on approximate solutions of ordinary differential equations and LP solutions, based on genetic algorithm and particle swarm algorithms, a comparison and analysis of the efficiency of two kinds of optimization problems is made. We then fix other parameters but adjust the particle population, in the purpose to compare optimization capability of GA and PSO in approximate solutions of differential equation and the LP problem.
keywords: genetic algorithm particle swarm optimization differential equation liear program optimization problem
文章编号： 中图分类号： 文献标志码：
基金项目:江苏省高校自然科学研究项目(14KJB520036)
| Author Name | Affiliation |
| ZHUANG Si-Fa | School of Math & Statistics, Shaoguan University, Shaoguan 512005, China |
| Author Name | Affiliation |
| ZHUANG Si-Fa | School of Math & Statistics, Shaoguan University, Shaoguan 512005, China |
引用文本：
庄思发.GA与PSO解DE与LP问题的效率比较.计算机系统应用,2016,25(6):244-248
ZHUANG Si-Fa.Efficiency Comparison of GA and PSO on DE and LP Problem.COMPUTER SYSTEMS APPLICATIONS,2016,25(6):244-248
庄思发.GA与PSO解DE与LP问题的效率比较.计算机系统应用,2016,25(6):244-248
ZHUANG Si-Fa.Efficiency Comparison of GA and PSO on DE and LP Problem.COMPUTER SYSTEMS APPLICATIONS,2016,25(6):244-248
