• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Critical issues in transportation systems planning, development, and management >An Improved Ant Colony Algorithm for the Shortest Path Problem inTime-Dependent Networks
【24h】

An Improved Ant Colony Algorithm for the Shortest Path Problem inTime-Dependent Networks

机译：时变网络中最短路径问题的改进蚁群算法

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Research of the shortest path problem in time-dependent networks hasrnimportant practical value. An improved pheromone update strategy is demonstratedrnhere. Using this strategy, the residual pheromone of each path can accurately reflectrnthe change of weighted value for each path. An improved ant colony algorithm forrnthe shortest path problem in time-dependent networks based on our improvedrnstrategy is also presented here. The results of this experiment show that the improvedrnalgorithm has a greater probability to achieve an optimal solution, and thernconvergence rate of the algorithm is greater than that of a traditional ant colonyrnalgorithm.
机译：时变网络中最短路径问题的研究具有重要的实用价值。本文展示了一种改进的信息素更新策略。使用该策略，每个路径的残留信息素可以准确反映每个路径的加权值的变化。本文还提出了一种基于改进策略的时间依赖网络中最短路径问题的改进蚁群算法。实验结果表明，改进的算法有较高的概率来获得最优解，并且算法的收敛速度大于传统的蚁群算法。

著录项

  • 来源
  • 会议地点 Harbin(CN);Harbin(CN)
  • 作者

    Gao Hui; Liu Yongqiang; Chang Qing; Xiong Huagang;

  • 作者单位

    DFH Satellite Information Technology Co.,Ltd,Beijing 100081 PH (010)68118008rnext.923 email:ghcc@263.net;

    School of Electronics and Information Engineering, Beijing University ofrnAeronautics and Astronautics, Beijing 100191, China PH (010)82317800 email:yongqiangliu@sina.com;

    School of Electronics and Information Engineering, Beijing University ofrnAeronautics and Astronautics, Beijing 100191, China PH (010)82317800 email:changq@263.net;

    School of Electronics and Information Engineering, Beijing University ofrnAeronautics and Astronautics, Beijing 100191, China PH (010)82317800;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 交通工程与交通管理;
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号