Multi-objective genetic local search algorithm
Multi-objective genetic local search algorithm
复制标题
DOI：
10.1109/icec.1996.542345
复制
发表时间：
1996-05
期刊：
影响因子：
--
通讯作者：
H. Ishibuchi;T. Murata
中科院分区：
文献类型：
--
作者：
H. Ishibuchi;T. Murata
提出了一种求解多目标优化问题非支配解集的混合算法。在所提出的算法中，局部搜索过程被应用到由遗传操作产生的每个解（即每个个体）。该算法的目的不是确定一个单一的最终解决方案，但试图找到所有的非支配解决方案的多目标优化问题。最终解决方案的选择取决于决策者的偏好。流水车间调度问题的计算机仿真结果表明，该算法具有很强的搜索能力。
Proposes a hybrid algorithm for finding a set of non-dominated solutions of a multi-objective optimization problem. In the proposed algorithm, a local search procedure is applied to each solution (i.e. to each individual) generated by genetic operations. The aim of the proposed algorithm is not to determine a single final solution but to try to find all the non-dominated solutions of a multi-objective optimization problem. The choice of the final solution is left to the decision maker's preference. The high searching ability of the proposed algorithm is demonstrated by computer simulations on flowshop scheduling problems.