首页> 外文会议>Evolutionary Computation, 2000. Proceedings of the 2000 Congress on >A new constraint tournament selection method for multicriteria optimization using genetic algorithm
【24h】

A new constraint tournament selection method for multicriteria optimization using genetic algorithm

机译:一种基于遗传算法的多准则优化的约束竞赛选择新方法

获取原文

摘要

A new genetic algorithm based method for solving nonlinear multicriterion optimization problems is described. The method does not use a fitness value as a measure, as a genetic algorithm uses to create the population of chromosomes for the next generation. The proposed method uses tournament selection which does not require evaluation of fitness values in order to create a new population of chromosomes for the next generation. The tournament is arranged such that objective functions are evaluated only for feasible solutions. After a detailed description of the method two examples are presented and the results are compared with those obtained using other methods. This comparison shows the effectiveness of the proposed method.
机译:描述了一种基于遗传算法的新方法,用于解决非线性多准则优化问题。该方法不使用适应度值作为度量,因为遗传算法用于创建下一代的染色体种群。所提出的方法使用不需要选择适应度值的比赛选择,以便为下一代创建新的染色体群体。安排比赛,以便仅针对可行的解决方案评估目标函数。在对该方法进行了详细说明之后,给出了两个示例,并将结果与​​使用其他方法获得的结果进行了比较。这种比较表明了该方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号