首页> 外文会议>2011 4th International Conference on Biomedical Engineering and Informatics >Towards hybrid simulation of self-organizing and distributed vehicle routing in large traffic systems
【24h】

Towards hybrid simulation of self-organizing and distributed vehicle routing in large traffic systems

机译:面向大型交通系统中自组织和分布式车辆路径的混合仿真

获取原文

摘要

Traffic congestions have been a major problem in metropolitan areas worldwide, causing enormous economical as well as ecological damage. At the same time, in densely populated areas with high vehicle traffic, central information gathering and distribution to vehicles takes too long for providing accurate, let alone optimal routing directions (which would have to be available in due time before vehicles arrive at road intersections). Accurate information provided too late may even add to congestion problems. In this paper we present a bottom-up, multi-agent online approach termed BeeJamA (Bee-Inspired Traffic Jam Avoidance) for individual vehicle routing which, on its network communication layer, is taking advantage of our novel self — organizing network routing algorithm BeeHive/BeeAdhoc. This Swarm Intelligence based method has been largely inspired by the behavior of honey bees. As a distributed algorithm BeeJamA does not rely on global information, and scalability is not a critical issue. BeeJamA features dynamic deadlines. The quality of the algorithm has a strong impact on the acceptance rate through the drivers, for installing and operating communication features (navigators and routing-related software) as well as on driver adherence to routing directions. This, in turn, requires a high amount of flexibility for routing algorithms considering (unpredictable) resetting of destinations by drivers, making dynamic real-time reactions a critical issue. For a comprehensive and comparative realistic evaluation reflecting the aforementioned aspects/parameters we have developed a generic routing framework (GRF) which allows to run BeeJamA and other routing algorithms on different scientific or commercial traffic simulators. (Each of them serves different purposes and is therefore considerably abstracting from reality.) While we (briefly) report on extensive simulation experiments on the MAT-Sim simulator which verify BeeJamA's superior performance compared to-- existing models we will also outline — as part of our current research — how to create an incremental procedure for performing realistic field studies where in ever larger areas the abstract simulation is replaced, and observed, through real traffic. This imposes very strict requirements for the real-time, or online, performance of the simulator. Comprehensive results results of these altogether novel experimental investigations will be subject of upcoming publications.
机译:交通拥堵已成为全球大都市地区的主要问题,造成了巨大的经济和生态破坏。同时,在人流密集的人口稠密地区,集中信息的收集和分发到车辆花费的时间太长,无法提供准确的,更不用说最优的路线指引(在车辆到达路口之前必须在适当的时间提供) 。太迟提供的准确信息甚至可能加剧拥塞问题。在本文中,我们提出了一种自底向上的多代理在线方法,称为BeeJamA(Bee启发式交通拥堵避免),用于单个车辆的路线选择,在其网络通信层上,它利用了我们新颖的自组织网络路线选择算法BeeHive / BeeAdhoc。这种基于群体智能的方法在很大程度上受到了蜜蜂行为的启发。作为一种分布式算法,BeeJamA不依赖于全局信息,而可伸缩性也不是关键问题。 BeeJamA具有动态截止日期。算法的质量对驱动程序的接受率,安装和操作通信功能(导航器和与路由相关的软件)的接受率以及驱动程序对路由方向的遵循性都有很大影响。反过来,考虑到驾驶员(不可预测的)目的地重置,路由算法需要高度的灵活性,从而使动态实时反应成为关键问题。为了反映上述方面/参数的全面,比较现实的评估,我们开发了通用路由框架(GRF),该框架允许在不同的科学或商业交通模拟器上运行BeeJamA和其他路由算法。 (它们每个都有不同的用途,因此从现实中得到了很大的抽象。)虽然我们(简要地)报告了MAT-Sim模拟器上的大量模拟实验,这些实验证明BeeJamA的性能优于- -- 在我们现有研究的一部分中,我们还将概述现有模型-如何创建用于执行现实现场研究的增量程序,在更大的区域中,通过真实交通来替换和观察抽象模拟。这对模拟器的实时或在线性能提出了非常严格的要求。这些完全新颖的实验研究的综合结果将成为即将出版的出版物的主题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号