IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2013y2013i1n197313.html

Link‐Based Signalized Arterial Progression Optimization with Practical Travel Speed

Author

Listed:
  • Wu Xianyu
  • Hu Peifeng
  • Yuan Zhenzhou

Abstract

Bandwidth is defined as the maximum amount of green time for a designated movement as it passes through an arterial. In most previous studies, bandwidth has been referred to arterial bandwidth. In practice, a balance between link bandwidth and arterial bandwidth has proven to be important in optimizing coordinated signal timing plans, because not all drivers need to pass through all the intersections on an arterial. This study proposes an algorithm on how to obtain an optimal coordinated signal timing plan with both optimal link bandwidth and optimal arterial bandwidth considering practical vehicles’ speed. The weighted link bandwidth attainability is introduced as an additional measure of effectiveness for assessing the optimization results. The link bandwidth optimization is built based on the improvement of Messer’s algorithm about bandwidth optimization. The arterial bandwidth optimization algorithm takes into consideration the weighted link bandwidth attainability while selecting phase sequences. The proposed algorithm is demonstrated in a case study, and many improvements are archived when a balanced consideration is given to both link bandwidth and arterial bandwidth. Fine‐tuning of initial signal timing plan is done using practical travel speed. The evaluation results show a rather significant improvement which is achieved.

Suggested Citation

  • Wu Xianyu & Hu Peifeng & Yuan Zhenzhou, 2013. "Link‐Based Signalized Arterial Progression Optimization with Practical Travel Speed," Journal of Applied Mathematics, John Wiley & Sons, vol. 2013(1).
    • Handle: RePEc:wly:jnljam:v:2013:y:2013:i:1:n:197313
    DOI: 10.1155/2013/197313
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2013/197313
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/197313?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Papola, Natale & Fusco, Gaetano, 1998. "Maximal bandwidth problems: a new algorithm based on the properties of periodicity of the system," Transportation Research Part B: Methodological, Elsevier, vol. 32(4), pages 277-288, May.
    2. Papola, Natale, 1992. "Bandwidth maximization: Split and unsplit solutions," Transportation Research Part B: Methodological, Elsevier, vol. 26(5), pages 341-356, October.
    3. Pillai, Rekha S. & Rathi*, Ajay K. & L. Cohen, Stephen, 1998. "A restricted branch-and-bound approach for generating maximum bandwidth signal timing plans for traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 517-529, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ennio Cascetta & Mariano Gallo & Bruno Montella, 2006. "Models and algorithms for the optimization of signal settings on urban networks with stochastic assignment models," Annals of Operations Research, Springer, vol. 144(1), pages 301-328, April.
    2. Wang, Tao & Yuan, Zijian & Zhang, Yuanshu & Zhang, Jing & Tian, Junfang, 2023. "A driving guidance strategy with pre-stop line at signalized intersection: Collaborative optimization of capacity and fuel consumption," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    3. D’Acierno, Luca & Gallo, Mariano & Montella, Bruno, 2012. "An Ant Colony Optimisation algorithm for solving the asymmetric traffic assignment problem," European Journal of Operational Research, Elsevier, vol. 217(2), pages 459-469.
    4. Zhao, Jing & Li, Peng, 2016. "An extended car-following model with consideration of speed guidance at intersections," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 1-8.
    5. Papola, Natale & Fusco, Gaetano, 1998. "Maximal bandwidth problems: a new algorithm based on the properties of periodicity of the system," Transportation Research Part B: Methodological, Elsevier, vol. 32(4), pages 277-288, May.
    6. Ngo, Huan Hoang & Shah, Rohan & Mishra, Sabyasachee, 2018. "Optimal asset management strategies for mixed transit fleet," Transportation Research Part A: Policy and Practice, Elsevier, vol. 117(C), pages 103-116.
    7. Mathew, Tom V. & Khasnabis, Snehamay & Mishra, Sabyasachee, 2010. "Optimal resource allocation among transit agencies for fleet management," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(6), pages 418-432, July.
    8. Fusco, G. & Bielli, M. & Cipriani, E. & Gori, S. & Nigro, M., 2013. "Signal settings synchronization and dynamic traffic modelling," European Transport \ Trasporti Europei, ISTIEE, Institute for the Study of Transport within the European Economic Integration, issue 53, pages 1-7.
    9. Yu, Chunhui & Ma, Wanjing & Lo, Hong K. & Yang, Xiaoguang, 2015. "Optimization of mid-block pedestrian crossing network with discrete demands," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 103-121.
    10. Mishra, Sabyasachee & Sharma, Sushant & Khasnabis, Snehamay & Mathew, Tom V., 2013. "Preserving an aging transit fleet: An optimal resource allocation perspective based on service life and constrained budget," Transportation Research Part A: Policy and Practice, Elsevier, vol. 47(C), pages 111-123.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnljam:v:2013:y:2013:i:1:n:197313. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.