首页> 外文会议>Natural Computation (ICNC), 2008 Fourth International Conference on >Solving the Optimization of Projection Pursuit Model Using Improved Ant Colony Algorithm
【24h】

Solving the Optimization of Projection Pursuit Model Using Improved Ant Colony Algorithm

机译:改进蚁群算法求解投影寻踪模型的优化

获取原文

摘要

Projection pursuit was a reducing dimensions treatment method. It was widely used to make the transition from high dimensional problem to one dimensional problem by projection direction. It was usually difficult to search the best projection direction, however it could be solved by an optimization question. Aimed at the prematurity and stagnancy shortages of basic ant colony, some improved countermeasures were put forward. Simulative result indicated that it was applicable and effective to solve the above optimization question based on improved ant colony algorithm
机译:投影追求是缩小尺寸的处理方法。它被广泛用于使高维问题从投影方向过渡到一维问题。通常很难找到最佳的投影方向,但是可以通过优化问题来解决。针对基础蚁群早熟,停滞的现状,提出了一些改进对策。仿真结果表明,基于改进的蚁群算法可以有效地解决上述优化问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号