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

Traffic signal timing optimisation based on genetic algorithm approach, including drivers' routing

Author

Listed:
  • Ceylan, Halim
  • Bell, Michael G. H.

Abstract

The genetic algorithm approach to solve traffic signal control and traffic assignment problem is used to tackle the optimisation of signal timings with stochastic user equilibrium link flows. Signal timing is defined by the common network cycle time, the green time for each signal stage, and the offsets between the junctions. The system performance index is defined as the sum of a weighted linear combination of delay and number of stops per unit time for all traffic streams, which is evaluated by the traffic model of TRANSYT [User guide to TRANSYT, version 8, TRRL Report LR888, Transport and Road Research Laboratory, Crowthorne, 1980]. Stochastic user equilibrium assignment is formulated as an equivalent minimisation problem and solved by way of the Path Flow Estimator (PFE). The objective function adopted is the network performance index (PI) and its use for the Genetic Algorithm (GA) is the inversion of the network PI, called the fitness function. By integrating the genetic algorithms, traffic assignment and traffic control, the GATRANSPFE (Genetic Algorithm, TRANSYT and the PFE), solves the equilibrium network design problem. The performance of the GATRANSPFE is illustrated and compared with mutually consistent (MC) solution using numerical example. The computation results show that the GA approach is efficient and much simpler than previous heuristic algorithm. Furthermore, results from the test road network have shown that the values of the performance index were significantly improved relative to the MC.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:transb:v:38:y:2004:i:4:p:329-342
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(03)00015-8
    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. Fisk, Caroline, 1980. "Some developments in equilibrium traffic assignment," Transportation Research Part B: Methodological, Elsevier, vol. 14(3), pages 243-255, September.
    2. Dickson, Thomas J., 1981. "A note on traffic assignment and signal timings in a signal-controlled road network," Transportation Research Part B: Methodological, Elsevier, vol. 15(4), pages 267-271, August.
    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. Rusul Abduljabbar & Hussein Dia & Sohani Liyanage & Saeed Asadi Bagloee, 2019. "Applications of Artificial Intelligence in Transport: An Overview," Sustainability, MDPI, vol. 11(1), pages 1-24, January.
    2. Haldenbilen, Soner & Ceylan, Halim, 2005. "The development of a policy for road tax in Turkey, using a genetic algorithm approach for demand estimation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(10), pages 861-877, December.
    3. Joseph Y. J. Chow & Amelia C. Regan, 2011. "Real Option Pricing of Network Design Investments," Transportation Science, INFORMS, vol. 45(1), pages 50-63, February.
    4. Yuncheng Zeng & Minhua Shao & Lijun Sun, 2023. "Network-Level Hierarchical Bottleneck Congestion Control Method for a Mixed Traffic Network," Sustainability, MDPI, vol. 15(23), pages 1-27, November.
    5. Ceylan, Halim & Bell, Michael G. H., 2005. "Genetic algorithm solution for the stochastic equilibrium transportation networks under congestion," Transportation Research Part B: Methodological, Elsevier, vol. 39(2), pages 169-185, February.
    6. Sen, Sugata & Sengupta, Soumya, 2017. "Neo-liberal globalization and caste based exclusion in India – Nature, Dimension and Policy : A Study through Genetic Algorithm and Bio-informatics," MPRA Paper 81036, University Library of Munich, Germany.
    7. Ozan, Cenk & Haldenbilen, Soner & Ceylan, Halim, 2011. "Estimating emissions on vehicular traffic based on projected energy and transport demand on rural roads: Policies for reducing air pollutant emissions and energy consumption," Energy Policy, Elsevier, vol. 39(5), pages 2542-2549, May.
    8. Haldenbilen, Soner, 2006. "Fuel price determination in transportation sector using predicted energy and transport demand," Energy Policy, Elsevier, vol. 34(17), pages 3078-3086, November.
    9. A. Assaf, 2011. "Accounting for technological differences in modelling the performance of airports: a Bayesian approach," Applied Economics, Taylor & Francis Journals, vol. 43(18), pages 2267-2275.
    10. Mohebifard, Rasool & Hajbabaie, Ali, 2019. "Optimal network-level traffic signal control: A benders decomposition-based solution algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 252-274.
    11. Liu, Shaonan & Wang, Mingzheng & Kong, Nan & Hu, Xiangpei, 2021. "An enhanced branch-and-bound algorithm for bilevel integer linear programming," European Journal of Operational Research, Elsevier, vol. 291(2), pages 661-679.
    12. Wang, Yu & Liu, Haoxiang & Fan, Yinchao & Ding, Jianxun & Long, Jiancheng, 2022. "Large-scale multimodal transportation network models and algorithms-Part II: Network capacity and network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    13. 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.
    14. Han, Ke & Gayah, Vikash V., 2015. "Continuum signalized junction model for dynamic traffic networks: Offset, spillback, and multiple signal phases," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 213-239.
    15. Ghatee, Mehdi & Hashemi, S. Mehdi, 2009. "Traffic assignment model with fuzzy level of travel demand: An efficient algorithm based on quasi-Logit formulas," European Journal of Operational Research, Elsevier, vol. 194(2), pages 432-451, April.
    16. Hong Ki An & Muhammad Awais Javeed & Gimok Bae & Nimra Zubair & Ahmed Sayed M. Metwally & Patrizia Bocchetta & Fan Na & Muhammad Sufyan Javed, 2022. "Optimized Intersection Signal Timing: An Intelligent Approach-Based Study for Sustainable Models," Sustainability, MDPI, vol. 14(18), pages 1-19, September.
    17. Rolando Armas & Hernán Aguirre & Fabio Daolio & Kiyoshi Tanaka, 2017. "Evolutionary design optimization of traffic signals applied to Quito city," PLOS ONE, Public Library of Science, vol. 12(12), pages 1-37, December.
    18. Wang, Guangmin & Gao, Ziyou & Xu, Meng & Sun, Huijun, 2014. "Joint link-based credit charging and road capacity improvement in continuous network design problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 1-14.
    19. Simoni, Michele D. & Claudel, Christian G., 2017. "A fast simulation algorithm for multiple moving bottlenecks and applications in urban freight traffic management," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 238-255.

    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. Ceylan, Halim & Bell, Michael G. H., 2005. "Genetic algorithm solution for the stochastic equilibrium transportation networks under congestion," Transportation Research Part B: Methodological, Elsevier, vol. 39(2), pages 169-185, February.
    2. Claudio Meneguzzer, 1998. "Stochastic user equilibrium assignment with traffic-responsive signal control," ERSA conference papers ersa98p337, European Regional Science Association.
    3. Ahipaşaoğlu, Selin Damla & Meskarian, Rudabeh & Magnanti, Thomas L. & Natarajan, Karthik, 2015. "Beyond normality: A cross moment-stochastic user equilibrium model," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 333-354.
    4. Kurmankhojayev, Daniyar & Li, Guoyuan & Chen, Anthony, 2024. "Link criticality index: Refinement, framework extension, and a case study," Reliability Engineering and System Safety, Elsevier, vol. 243(C).
    5. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    6. Maher, Mike, 1998. "Algorithms for logit-based stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 32(8), pages 539-549, November.
    7. Castillo, Enrique & Menéndez, José María & Sánchez-Cambronero, Santos, 2008. "Predicting traffic flow using Bayesian networks," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 482-509, June.
    8. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    9. Bell, Michael G. H., 1995. "Stochastic user equilibrium assignment in networks with queues," Transportation Research Part B: Methodological, Elsevier, vol. 29(2), pages 125-137, April.
    10. Hong, Sung-Pil & Kim, Kyung min & Byeon, Geunyeong & Min, Yun-Hong, 2017. "A method to directly derive taste heterogeneity of travellers’ route choice in public transport from observed routes," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 41-52.
    11. Jiayang Li & Zhaoran Wang & Yu Marco Nie, 2023. "Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice," Papers 2304.02500, arXiv.org, revised Feb 2024.
    12. Bliemer, Michiel C.J. & Raadsen, Mark P.H., 2020. "Static traffic assignment with residual queues and spillback," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 303-319.
    13. Paolo Delle Site, 2017. "On the Equivalence Between SUE and Fixed-Point States of Day-to-Day Assignment Processes with Serially-Correlated Route Choice," Networks and Spatial Economics, Springer, vol. 17(3), pages 935-962, September.
    14. Haibo Wang & Zhipeng Wu & Xiaolin Yan & Jincai Chen, 2023. "Impact Evaluation of Network Structure Differentiation on Traffic Noise during Road Network Design," Sustainability, MDPI, vol. 15(8), pages 1-20, April.
    15. Abdullah Alshehri & Mahmoud Owais & Jayadev Gyani & Mishal H. Aljarbou & Saleh Alsulamy, 2023. "Residual Neural Networks for Origin–Destination Trip Matrix Estimation from Traffic Sensor Information," Sustainability, MDPI, vol. 15(13), pages 1-21, June.
    16. Yang, Hai & Yagar, Sam, 1995. "Traffic assignment and signal control in saturated road networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 29(2), pages 125-139, March.
    17. Kobayashi, Kiyoshi & Do, Myungsik, 2005. "The informational impacts of congestion tolls upon route traffic demands," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(7-9), pages 651-670.
    18. Liu, Qi & Chow, Joseph Y.J., 2022. "Efficient and stable data-sharing in a public transit oligopoly as a coopetitive game," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 64-87.
    19. Honggang Zhang & Zhiyuan Liu & Yicheng Zhang & Weijie Chen & Chenyang Zhang, 2024. "A Distributed Computing Method Integrating Improved Gradient Projection for Solving Stochastic Traffic Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 24(2), pages 361-381, June.
    20. Hamid Reza Eftekhari & Mehdi Ghatee, 2017. "The lower bound for dynamic parking prices to decrease congestion through CBD," Operational Research, Springer, vol. 17(3), pages 761-787, October.

    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:38:y:2004:i:4:p:329-342. 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.