IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v9y1975i4p344-363.html
   My bibliography  Save this article

Optimization of Traffic Signal Settings by Mixed-Integer Linear Programming

Author

Listed:
  • Nathan H. Gartner

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

  • John D. C. Little

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

  • Henry Gabbay

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

Abstract

Remits obtained in Part I are extended to include offsets, splits at each intersection, and a common cycle time for the network as simultaneous decision variables. In addition to the deterministic link performance function, the stochastic effects of overflow queues from one cycle to the next are modeled by means of a saturation deterrence function that enters as an additive component in the objective function. Computational results demonstrate the feasibility of using mixed-integer linear programming on problems of realistic size. Sensitivity analysis of cycle time shows it to have a strong influence on network performance.

Suggested Citation

  • Nathan H. Gartner & John D. C. Little & Henry Gabbay, 1975. "Optimization of Traffic Signal Settings by Mixed-Integer Linear Programming," Transportation Science, INFORMS, vol. 9(4), pages 344-363, November.
    • Handle: RePEc:inm:ortrsc:v:9:y:1975:i:4:p:344-363
    DOI: 10.1287/trsc.9.4.344
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.9.4.344
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.9.4.344?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
    ---><---

    Citations

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


    Cited by:

    1. Coogan, Samuel & Kim, Eric & Gomes, Gabriel & Arcak, Murat & Varaiya, Pravin, 2017. "Offset optimization in signalized traffic networks via semidefinite relaxation," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 82-92.
    2. Little, John D. C. & Kelson, Mark D. & Gartner, Nathan H., 1981. "MAXBAND : a versatile program for setting signals on arteries and triangular networks," Working papers 1185-81., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Le, Tung & Vu, Hai L. & Walton, Neil & Hoogendoorn, Serge P. & Kovács, Péter & Queija, Rudesindo N., 2017. "Utility optimization framework for a distributed traffic control of urban road networks," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 539-558.
    4. Sadek, Bassel & Doig Godier, Jean & Cassidy, Michael J & Daganzo, Carlos F, 2022. "Traffic signal plans to decongest street grids," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 195-208.
    5. 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.
    6. Rey, David & Levin, Michael W., 2019. "Blue phase: Optimal network traffic control for legacy and autonomous vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 130(C), pages 105-129.
    7. Yao, Zhihong & Zhao, Bin & Qin, Lingqiao & Jiang, Yangsheng & Ran, Bin & Peng, Bo, 2020. "An efficient heterogeneous platoon dispersion model for real-time traffic signal control," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    8. Heydecker, B. G., 1996. "A decomposition approach for signal optimisation in road networks," Transportation Research Part B: Methodological, Elsevier, vol. 30(2), pages 99-114, April.
    9. Zhou, Xuesong, 2017. "Recasting and optimizing intersection automation as a connected-and-automated-vehicle (CAV) scheduling problem: A sequential branch-and-bound search approach in phase-time-traffic hypernetworkAuthor-N," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 479-506.

    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:inm:ortrsc:v:9:y:1975:i:4:p:344-363. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.