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

A Constraint Qualification for a Dynamic Traffic Assignment Model

Author

Listed:
  • Malachy Carey

    (Carnegie-Mellon University, Pittsburgh, Pennsylvania)

Abstract

This note resolves a hitherto open question as to whether a dynamic traffic assignment model, which was developed and analyzed in earlier issues of this journal, satisfies a “constraint qualification.” It is shown that the model does in fact satisfy a constraint qualification, which establishes the validity of the optimality analysis presented by previous authors.

Suggested Citation

  • Malachy Carey, 1986. "A Constraint Qualification for a Dynamic Traffic Assignment Model," Transportation Science, INFORMS, vol. 20(1), pages 55-58, February.
    • Handle: RePEc:inm:ortrsc:v:20:y:1986:i:1:p:55-58
    DOI: 10.1287/trsc.20.1.55
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.20.1.55
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.20.1.55?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. Li, Jun & Fujiwara, Okitsugu & Kawakami, Shogo, 2000. "A reactive dynamic user equilibrium model in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 605-624, November.
    2. Bar-Gera, Hillel & Carey, Malachy, 2017. "Representation requirements for perfect first-in-first-out verification in continuous flow dynamic models," Transportation Research Part B: Methodological, Elsevier, vol. 100(C), pages 284-301.
    3. Duanmu, Jun & Chowdhury, Mashrur & Taaffe, Kevin & Jordan, Craig, 2012. "Buffering in evacuation management for optimal traffic demand distribution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 684-700.
    4. Tong, C. O. & Wong, S. C., 2000. "A predictive dynamic traffic assignment model in congested capacity-constrained road networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(8), pages 625-644, November.
    5. Wen-Long Jin, 2021. "A Link Queue Model of Network Traffic Flow," Transportation Science, INFORMS, vol. 55(2), pages 436-455, March.
    6. Lam, William H. K. & Huang, Hai-Jun, 1995. "Dynamic user optimal traffic assignment model for many to one travel demand," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 243-259, August.
    7. Makoto Tanaka, 2007. "Extended Price Cap Mechanism for Efficient Transmission Expansion under Nodal Pricing," Networks and Spatial Economics, Springer, vol. 7(3), pages 257-275, September.
    8. Cantelmo, Guido & Viti, Francesco, 2019. "Incorporating activity duration and scheduling utility into equilibrium-based Dynamic Traffic Assignment," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 365-390.
    9. Chen, Huey-Kuo & Hsueh, Che-Fu, 1998. "A model and an algorithm for the dynamic user-optimal route choice problem," Transportation Research Part B: Methodological, Elsevier, vol. 32(3), pages 219-234, April.
    10. Luo, Shiaw-Shyan & Wang, Chung-Yung & Sung, Yi-Wei, 2018. "Time-dependent trip-chain link travel time estimation model with the first-in–first-out constraint," European Journal of Operational Research, Elsevier, vol. 267(2), pages 415-427.
    11. S. Waller & Athanasios Ziliaskopoulos, 2006. "A Combinatorial user optimal dynamic traffic assignment algorithm," Annals of Operations Research, Springer, vol. 144(1), pages 249-261, April.
    12. Ghali, M. O. & Smith, M. J., 1995. "A model for the dynamic system optimum traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(3), pages 155-170, June.
    13. Zhao, Chunxue & Fu, Baibai & Wang, Tianming, 2014. "Braess paradox and robustness of traffic networks under stochastic user equilibrium," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 135-141.
    14. Moore, II, James E. & Kim, Geunyoung & Cho, Seongdil & Hu, Hsi-hwa & Xu, Rong, 1997. "Evaluating System ATMIS Technologies Via Rapid Estimation Of Network Flows: Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt5c70f3d9, Institute of Transportation Studies, UC Berkeley.

    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:20:y:1986:i:1:p:55-58. 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.