IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v40y2006i7p543-562.html
   My bibliography  Save this article

A platoon-based traffic signal timing algorithm for major-minor intersection types

Author

Listed:
  • Jiang, Yi
  • Li, Shuo
  • Shamo, Daniel E.

Abstract

This paper presents a platoon-based traffic signal timing algorithm that reduces traffic delays at major-minor type of intersections. The algorithm reduces traffic delays at intersections by minimizing the interruptions to vehicle platoon movements on the major roads. In this paper, the characteristics of vehicle platoons are discussed, including the key platoon variables and their mathematical distributions. Then the platoon-based traffic signal timing algorithm is illustrated with proposed platoon detector placement and signal control logic. Further, through computer simulations it is shown that the platoon-based algorithm provides better performance at major-minor types of intersections than conventional signal timing algorithms.

Suggested Citation

  • Jiang, Yi & Li, Shuo & Shamo, Daniel E., 2006. "A platoon-based traffic signal timing algorithm for major-minor intersection types," Transportation Research Part B: Methodological, Elsevier, vol. 40(7), pages 543-562, August.
  • Handle: RePEc:eee:transb:v:40:y:2006:i:7:p:543-562
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(05)00079-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chang, Tang-Hsien & Sun, Guey-Yin, 2004. "Modeling and optimization of an oversaturated signalized network," Transportation Research Part B: Methodological, Elsevier, vol. 38(8), pages 687-707, September.
    2. Michalopoulos, Panos G. & Stephanopoulos, Gregory & Stephanopoulos, George, 1981. "An application of shock wave theory to traffic signal control," Transportation Research Part B: Methodological, Elsevier, vol. 15(1), pages 35-51, February.
    3. Panos G. Michalopoulos & Gregory Stephanopoulos & Vijay B. Pisharody, 1980. "Modeling of Traffic Flow at Signalized Links," Transportation Science, INFORMS, vol. 14(1), pages 9-41, February.
    4. Ceylan, Halim & Bell, Michael G. H., 2004. "Traffic signal timing optimisation based on genetic algorithm approach, including drivers' routing," Transportation Research Part B: Methodological, Elsevier, vol. 38(4), pages 329-342, May.
    5. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    6. Michalopoulos, Panos G. & Pisharody, Vijaykumar B., 1981. "Derivation of delays based on improved macroscopic traffic models," Transportation Research Part B: Methodological, Elsevier, vol. 15(5), pages 299-317, October.
    7. Smith, M. J. & Ghali, M., 1990. "The dynamics of traffic assignment and traffic control: A theoretical study," Transportation Research Part B: Methodological, Elsevier, vol. 24(6), pages 409-422, December.
    8. Randolph W. Hall, 1986. "The Fastest Path through a Network with Random Time-Dependent Travel Times," Transportation Science, INFORMS, vol. 20(3), pages 182-188, August.
    9. Yang, Baiyu & Miller-Hooks, Elise, 2004. "Adaptive routing considering delays due to signal operations," Transportation Research Part B: Methodological, Elsevier, vol. 38(5), pages 385-413, June.
    10. Robert Herman & Elliott W. Montroll & Renfrey B. Potts & Richard W. Rothery, 1959. "Traffic Dynamics: Analysis of Stability in Car Following," Operations Research, INFORMS, vol. 7(1), pages 86-106, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. L D Smith & D C Sweeney & J F Campbell, 2009. "Simulation of alternative approaches to relieving congestion at locks in a river transportion system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 519-533, April.
    2. Kosun, Caglar & Ozdemir, Serhan, 2017. "Determining the complexity of multi-component conformal systems: A platoon-based approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 688-695.
    3. Li, Baibing, 2017. "Stochastic modeling for vehicle platoons (II): Statistical characteristics," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 378-393.
    4. Rey, David & Levin, Michael W. & Dixit, Vinayak V., 2021. "Online incentive-compatible mechanisms for traffic intersection auctions," European Journal of Operational Research, Elsevier, vol. 293(1), pages 229-247.
    5. Li, Baibing, 2017. "Stochastic modeling for vehicle platoons (I): Dynamic grouping behavior and online platoon recognition," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 364-377.
    6. Yuanyuan Wu & Feng Zhu, 2021. "Junction Management for Connected and Automated Vehicles: Intersection or Roundabout?," Sustainability, MDPI, vol. 13(16), pages 1-18, August.

    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. Yang, Baiyu & Miller-Hooks, Elise, 2004. "Adaptive routing considering delays due to signal operations," Transportation Research Part B: Methodological, Elsevier, vol. 38(5), pages 385-413, June.
    2. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    3. He Huang & Song Gao, 2018. "Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times," Transportation Science, INFORMS, vol. 52(1), pages 102-117, January.
    4. Wong, S. C. & Wong, G. C. K., 2002. "An analytical shock-fitting algorithm for LWR kinematic wave model embedded with linear speed-density relationship," Transportation Research Part B: Methodological, Elsevier, vol. 36(8), pages 683-706, September.
    5. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
    6. Gao, Song & Chabini, Ismail, 2006. "Optimal routing policy problems in stochastic time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 40(2), pages 93-122, February.
    7. Yang, Lixing & Zhou, Xuesong, 2014. "Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 22-44.
    8. Elise Miller-Hooks & Baiyu Yang, 2005. "Updating Paths in Time-Varying Networks Given Arc Weight Changes," Transportation Science, INFORMS, vol. 39(4), pages 451-464, November.
    9. Cho, Hsun-Jung & Tseng, Ming-Te & Hwang, Ming-Chorng, 2014. "Using detection of vehicular presence to estimate shockwave speed and upstream traffics for a signalized intersection," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 1151-1165.
    10. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.
    11. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    12. Tsung-Sheng Chang & Linda K. Nozick & Mark A. Turnquist, 2005. "Multiobjective Path Finding in Stochastic Dynamic Networks, with Application to Routing Hazardous Materials Shipments," Transportation Science, INFORMS, vol. 39(3), pages 383-399, August.
    13. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    14. Azadian, Farshid & Murat, Alper E. & Chinnam, Ratna Babu, 2012. "Dynamic routing of time-sensitive air cargo using real-time information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 355-372.
    15. Taesung Hwang & Yanfeng Ouyang, 2015. "Urban Freight Truck Routing under Stochastic Congestion and Emission Considerations," Sustainability, MDPI, vol. 7(6), pages 1-16, May.
    16. Zweers, Bernard G. & van der Mei, Rob D., 2022. "Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 178-188.
    17. Prakash, A. Arun, 2018. "Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 127-147.
    18. Shahabi, Mehrdad & Unnikrishnan, Avinash & Boyles, Stephen D., 2013. "An outer approximation algorithm for the robust shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 58(C), pages 52-66.
    19. Wen, Liang & Çatay, Bülent & Eglese, Richard, 2014. "Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge," European Journal of Operational Research, Elsevier, vol. 236(3), pages 915-923.
    20. Manseur, Farida & Farhi, Nadir & Nguyen Van Phu, Cyril & Haj-Salem, Habib & Lebacque, Jean-Patrick, 2020. "Robust routing, its price, and the tradeoff between routing robustness and travel time reliability in road networks," European Journal of Operational Research, Elsevier, vol. 285(1), pages 159-171.

    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:eee:transb:v:40:y:2006:i:7:p:543-562. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.