摘要
最近涌现了各种进化方法来解决多目标优化问题,分散搜索也是一种可以解决多目标问题的算法。该算法的结构引用进化算法的杂交和变异算子来增强它的性能,但该算法与其他进化算法的不同在于一系列操作策略不再基于随机性原理,而是运用"分散-收敛集聚"的迭代机制。论文在多目标优化问题区域讨论分散搜索算法,寻找多目标的非支配集或Pareto最优解。实验表明,分散搜索算法具有很好的收敛性和分布性。
Scatter search algorithm can solve the multi-objective optimization problem which enhancing it＇s performance by using genetic algorithm crossover and mutation operator.Operating strategy of scatter search is not based on the princlple of stochastic.It is based on ＂distributing-convergence collecting＂to inerative mechanism.This paper analyzes the scatter search in multi-objective optimization problem region and finds the Pareto optimal solutions.The experiment results show that this algorithm is effective.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第33期66-68,共3页
Computer Engineering and Applications
