【24h】

A Stochastic Traffic Assignment Algorithm Based on Ant Colony Optimisation

机译:基于蚁群算法的随机交通分配算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In this paper we propose a Stochastic User Equilibrium (SUE) algorithm that can be adopted as a model, known as a simulation model, that imitates the behaviour of transportation systems. Indeed, analyses of real dimension networks need simulation algorithms that allow network conditions and performances to be rapidly determined. Hence, we developed an MSA (Method of Successive Averages) algorithm based on the Ant Colony Optimisation paradigm that allows transportation systems to be simulated in less time but with the same accuracy as traditional MSA algorithms. Finally, by means of Blum's theorem, we stated theoretically the convergence of the proposed ACO-based algorithm.
机译:在本文中,我们提出了一种随机用户平衡(SUE)算法,该算法可以用作模拟运输系统行为的模型,称为模拟模型。实际上,对真实尺寸网络的分析需要模拟算法,该算法可以快速确定网络条件和性能。因此,我们基于蚁群优化范式开发了一种MSA(连续平均方法)算法,该算法可以在更短的时间内模拟运输系统,但精度与传统MSA算法相同。最后,通过Blum定理,我们从理论上说明了所提出的基于ACO的算法的收敛性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号