咨询与建议
  • 全部搜索
  • 期刊论文
  • 图书
  • 学位论文
  • 标准
  • 纸本馆藏
  • 外文资源发现
  • 数据库导航
  • 超星发现
高级检索

限定检索结果

文献类型

  • 3 篇 会议

馆藏范围

  • 3 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 3 篇 工学
    • 2 篇 控制科学与工程
    • 2 篇 计算机科学与技术...
    • 2 篇 软件工程
    • 1 篇 材料科学与工程（可...
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 3 篇 guotao algorithm
  • 1 篇 elite multi-pare...
  • 1 篇 path avoiding ob...
  • 1 篇 tsp
  • 1 篇 genome database
  • 1 篇 mechanical optim...
  • 1 篇 genetic algorith...
  • 1 篇 hybrid discrete ...
  • 1 篇 inver-over opera...
  • 1 篇 artificial fish-...

机构

  • 1 篇 hunan univ arts ...

作者

  • 1 篇 wang jinfei li z...
  • 1 篇 luo youxin
  • 1 篇 dai guangming go...

语言

  • 3 篇 英文
检索条件"主题词=GuoTao algorithm"
共 3 条 记 录，以下是1-10 订阅
全选 清除本页 清除全部 题录导出 标记到"检索档案"
详细 简洁
排序：
An algorithm for Solving the Path Avoiding Obstructions Based on guotao algorithm
An Algorithm for Solving the Path Avoiding Obstructions Base...
收藏
分享
引用
智能计算及其应用国际会议
作者： DAI Guangming, GONG Chen, DU Anhong (Department of Computer Science, China University of Geosciences, Wuhan 430074, China)
guotao algorithm (GT) is a kind of high-efficient algorithm which solves traveling salesman problem (TSP). After comparing the differences between solving the path avoiding obstructions and TSP, GT is
来源： 评论
The Novel Compound Evolutionary Optimization algorithm with Hybrid Discrete Variables and its Application to Mechanical Optimization
收藏
分享
引用
International Conference on Manufacturing Science and Engineering (ICMSE 2009)
作者： Luo, Youxin Hunan Univ Arts & Sci Coll Mech Engn Changde 415000 Peoples R China
To overcome the problem of low convergence speed and sensitivity to local convergence with the traditional Artificial Fish-swarm algorithm (AFSA) to handle complex functions, a novel compound evolutionary algorithm, c... 详细信息
来源： 评论
Analysis the Characteristics of Inver-over Operator in GT algorithm
Analysis the Characteristics of Inver-over Operator in GT Al...
收藏
分享
引用
智能计算及其应用国际会议
作者： WANG Jinfei, LI Zhenhua (Department of Computer Sciences, China University of Geosciences, Wuhan 430074,China)
Guo Tao algorithm possibly is the fastest evolution algorithm in solving the Traveling Salesman Problem at present [1]. The core lies in the design of inver-over operator. This paper analyzes the char
来源： 评论
全选 清除本页 清除全部 题录导出 标记到“检索档案”
共1页 <<  < 1 >  >>
回到顶部
执行限定条件