摘要: 分析了遗传算法和单纯形算法的特点,充分利用二者的优点,把单纯形算法作为一种局部搜索方法与变权系数遗传算法有机地结合起来,提出了一种求解多目标优化问题的混合遗传算法。数值实验表明该混合遗传算法能求得问题的数量更多、分布更广的Pareto最优解。
关键词:
遗传算法,
单纯形算法,
局部搜索,
多目标优化,
Pareto最优解
Abstract: A new hybridized algorithm based on the characteristics of the genetic algorithm and the simplex algorithm is presented, by joining the simplex algorithm, as a local searching method, into the genetic algorithm with randomly specified weight values for solving multi-objective optimization problem. The numerical experiments show that this algorithm can find more and wider Pareto-optimal solutions than the original one.
中图分类号:
牛志华,李乃成,肖国镇. 一种新的求解多目标优化问题的混合遗传算法[J]. , 2003, 29(18): 68-70.
NIU Zhihua1, LI Naicheng2, XIAO Guozhen1. A New Hybridized Genetic Algorithm for Solving Multi-objective Optimization Problems[J]. , 2003, 29(18): 68-70.