首页> 外文期刊>Intelligent Transportation Systems, IEEE Transactions on >Traffic Signal Optimization in “La Almozara” District in Saragossa Under Congestion Conditions, Using Genetic Algorithms, Traffic Microsimulation, and Cluster Computing
【24h】

Traffic Signal Optimization in “La Almozara” District in Saragossa Under Congestion Conditions, Using Genetic Algorithms, Traffic Microsimulation, and Cluster Computing

机译:使用遗传算法,交通微仿真和集群计算的塞拉戈萨“ La Almozara”区交通拥堵情况下的交通信号优化

获取原文
           

摘要

Urban traffic congestion is a pandemic illness affecting many cities around the world. We have developed and tested a new model for traffic signal optimization based on the combination of three key techniques: 1) genetic algorithms (GAs) for the optimization task; 2) cellular-automata-based microsimulators for evaluating every possible solution for traffic-light programming times; and 3) a Beowulf Cluster, which is a multiple-instruction-multiple-data (MIMD) multicomputer of excellent price/performance ratio. This paper presents the results of applying this architecture to a large-scale real-world test case in a congestion situation, using four different variables as fitness function of the GA. We have simulated a set of congested scenarios for ¿La Almozara¿ in Saragossa, Spain. Our results in this extreme case are encouraging: As we increase the incoming volume of vehicles entering the traffic network - from 36 up to 3600 vehicles per hour - we get better performance from our architecture. Finally, we present new research directions in this area.
机译:城市交通拥堵是一种流行病,影响着世界许多城市。我们基于三种关键技术的组合,开发并测试了一种用于交通信号优化的新模型:1)用于优化任务的遗传算法(GA); 2)基于细胞自动机的微型仿真器,用于评估交通信号灯编程时间的每种可能解决方案; 3)Beowulf集群,它是具有出色性价比的多指令多数据(MIMD)多计算机。本文介绍了在拥塞情况下将此架构应用于大规模实际测试案例的结果,其中使用了四个不同的变量作为GA的适应度函数。我们已经模拟了西班牙萨拉戈萨的ƒƒÂ,LaAlmozaraÃÂ,Â的一组拥挤场景。在这种极端情况下,我们的结果令人鼓舞:随着我们增加进入交通网络的车辆的接收量-从每小时36到3600车辆-我们的架构获得了更好的性能。最后,我们提出了该领域的新研究方向。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号