| Pareto局部搜索算法的改进 |
| |
| 引用本文： | 郭敏,朱文兴.Pareto局部搜索算法的改进[J].莆田高等专科学校学报,2012(2):47-52. |
| |
| 作者姓名： | 郭敏 朱文兴 |
| |
| 作者单位： | 福州大学数学与计算机科学学院,福建福州350108 |
| |
| 基金项目： | 国家自然科学基金资助项目（61170308） |
| |
| 摘 要： | 针对一个Pareto局部搜索（PLS）算法在解决多目标组合优化问题中所得到的解集与初始点的选取有关,提出该算法的改进。改进算法从初始解开始进行PLS搜索产生一组改进解集VF,然后对VF中的所有解再进行PLS搜索,如此重复直到满足终止条件。实例计算表明,PLSⅠ算法和算法Ⅱ能得到很好的解且解的质量优于PLS算法。
|
| 关 键 词： | 多目标组合优化 Pareto局部搜索 Pareto最优解 |
An Improved Pareto Local Search Algorithm for Multi-objective Combinatorial Optimization |
| |
| GUO Min,ZHU Wen-xing.An Improved Pareto Local Search Algorithm for Multi-objective Combinatorial Optimization[J].Journal of Putian College,2012(2):47-52. |
| |
| Authors: | GUO Min ZHU Wen-xing |
| |
| Institution: | (College of Mathematics and Computer Science,Fuzhou University,Fuzhou Fujian 350108,China) |
| |
| Abstract: | The Pareto Local Search（PLS） algorithm is a novel method in multi-objective combinatorial optimization,which searches for a multi-objective local optimal solution set from an initial solution.To improve the algorithm,we take the solutions in a multi-objective local optimal solution set as initial solutions,and further search for a multi-objective local optimal solution set,until a stopping criterion is satisfied.Computational tests on several instances demonstrate the effectiveness of the improved algorithm. |
| |
| Keywords: | multi-objective combinatorial optimization Pareto Local Search Pareto optimal solution |
| 本文献已被 维普 等数据库收录！ |
