首页> 外文会议>International Symposium on Computational Intelligence and Design >Model and Algorithm of Dynamic Wagon-flow Allocation on Uncertainty Conditions
【24h】

Model and Algorithm of Dynamic Wagon-flow Allocation on Uncertainty Conditions

机译:动态货车流量分配模型与算法在不确定性条件下

获取原文
获取外文期刊封面目录资料

摘要

Under the target of maximum number of vehicles in a stage plan, the model of dynamic wagon-flow allocating under the uncertain condition can be built. The improved approximate nondeterministic tree search (ANTS) algorithm whose parameter a fixed by chaos sequence generator will be introduced by means of defining the possibility break up set, waiting set and choice set to mapping dynamic wagon-flow allocating onto scheme tree. Improved route construction rule and pheromone updating, and the judgment of constraint condition in the process of transfer can enhance the efficiency of solution and convergence speed of the algorithm. The example demonstrates that the algorithm mentioned can find out a global scheme in a relatively efficient way.
机译:在舞台计划中最大车辆数量的目标下,可以构建在不确定条件下分配的动态货源流量模型。通过混沌序列发生器固定的参数A的改进的近似非测定树搜索(ANTS)算法将通过定义可能分解集,等待集和选择设置为映射到方案树上的动态Wagon流程来引入。改进的路线施工规则和信息素更新,传输过程中约束条件的判断可以提高算法的解决方案和收敛速度的效率。该示例演示了所提到的算法可以以相对有效的方式找到全局方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号