A quantum particle swarm optimization driven urban traffic light scheduling model

被引:0
|
作者
Wenbin Hu
Huan Wang
Zhenyu Qiu
Cong Nie
Liping Yan
机构
[1] Wuhan University,School of Computer
来源
关键词
Traffic congestion; Simulation; Optimization; BML; Updating rules;
D O I
暂无
中图分类号
学科分类号
摘要
Urban traffic congestion becomes a severe problem for many cities all around the world. How to alleviate traffic congestions in real cities is a challenging problem. Benefited from concise and efficient evolution rules, the Biham, Middleton and Levine (BML) model has a great potential to provide favorable results in the dynamic and uncertain traffic flows within an urban network. In this paper, an enhanced BML model (EBML) is proposed to effectively simulate the urban traffic where the timing scheduling optimization algorithm (TSO) based on the quantum particle swarm optimization is creatively introduced to optimize the timing scheduling of traffic light. The main contributions include that: (1) The actual urban road network with different two-way multi-lane roads is firstly mapped into the theoretical lattice space of BML. And the corresponding updating rules of each lattice site are proposed to control vehicle dynamics; (2) compared with BML, a much deeper insight into the phase transition and traffic congestions is provided in EBML. And the interference among different road capacities on forming traffic congestions is elaborated; (3) based on the scheduling simulation of EBML, TSO optimizes the timing scheduling of traffic lights to alleviate traffic congestions. Extensive comparative experiments reveal that TSO can achieve excellent optimization performances in real cases.
引用
收藏
页码:901 / 911
页数:10
相关论文
共 50 条
  • [1] A quantum particle swarm optimization driven urban traffic light scheduling model
    Hu, Wenbin
    Wang, Huan
    Qiu, Zhenyu
    Nie, Cong
    Yan, Liping
    NEURAL COMPUTING & APPLICATIONS, 2018, 29 (03): : 901 - 911
  • [2] Particle swarm optimization applied to vertical traffic scheduling in buildings
    Li, Zhonghua
    Tan, Hong-Zhou
    Zhang, Yunong
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS: KES 2007 - WIRN 2007, PT I, PROCEEDINGS, 2007, 4692 : 831 - +
  • [3] A study of particle swarm optimization in Urban Traffic Surveillance System
    Hu, Jianming
    Song, Jingyan
    Kang, Xiaojing
    Zrang, Mingchen
    2006 IMACS: MULTICONFERENCE ON COMPUTATIONAL ENGINEERING IN SYSTEMS APPLICATIONS, VOLS 1 AND 2, 2006, : 2056 - +
  • [4] Traffic Light Timing Optimization based on Improved Particle Swarm Optimization
    Liu, Chi
    Yan, Changqing
    Ma, Chenyin
    Suo, Qihan
    2022 IEEE 6TH ADVANCED INFORMATION TECHNOLOGY, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (IAEAC), 2022, : 635 - 639
  • [5] Freeway Ramp Metering by Macroscopic Traffic Scheduling with Particle Swarm Optimization
    Zhao, Xinjie
    Xu, Jianxin
    Srinivasan, Dipti
    PROCEEDINGS OF THE 2013 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN VEHICLES AND TRANSPORTATION SYSTEMS (CIVTS), 2013, : 32 - 37
  • [6] Swarm intelligence for traffic light scheduling: Application to real urban areas
    Garcia-Nieto, J.
    Alba, E.
    Carolina Olivera, A.
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2012, 25 (02) : 274 - 283
  • [7] A swarm intelligent method for traffic light scheduling: application to real urban traffic networks
    Hu, Wenbin
    Wang, Huan
    Yan, Liping
    Du, Bo
    APPLIED INTELLIGENCE, 2016, 44 (01) : 208 - 231
  • [8] A swarm intelligent method for traffic light scheduling: application to real urban traffic networks
    Wenbin Hu
    Huan Wang
    Liping Yan
    Bo Du
    Applied Intelligence, 2016, 44 : 208 - 231
  • [9] A Hybrid Cellular Swarm Optimization Method for Traffic-Light Scheduling
    HU Wenbin
    WANG Huan
    YAN Liping
    DU Bo
    ChineseJournalofElectronics, 2018, 27 (03) : 611 - 616
  • [10] A coordinated traffic control on urban expressways with modified particle swarm optimization
    Yaying Zhang
    Qunhao Ni
    KSCE Journal of Civil Engineering, 2017, 21 : 501 - 511