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

Access control on networks with unique origin-destination paths

Author

Listed:
  • Lovell, David J.
  • Daganzo, Carlos F.

Abstract

This paper presents improved time-dependent control strategies for small freeway networks with bottlenecks and unique origin-destination paths. It is assumed that there are no spill-overs from any of the freeway exits so that freeway queues and delays can be completely avoided by regulating access to the system so as to maintain bottleneck flows strictly below capacity. It is also assumed that the time-dependent origin-destination table and the time-dependent bottleneck capacities are known, although not always a priori. The proposed control strategies attempt to minimize the total delay (including both system delay and access delay) while avoiding queues inside the system. The problem is formulated as a constrained calculus of variations exercise that can be cast in the conventional form of optimal control theory and can also be discretized as a mathematical program. Although the first-in-first-out (FIFO) requirement for the access queues introduces undesirable non-linearities, exact solutions for four important special cases can be obtained easily. More specifically, for networks with (1) a single origin or (2) a single bottleneck, a myopic strategy which requires the solution of a sequence of simple linear programs is optimal. For networks with (3) a single destination the non-linearities disappear and the problem becomes a large-scale linear program. This is also true for general networks if (4) the fractional distribution of flow across destinations for every origin is independent of time. A greedy heuristic algorithm is proposed for the general case. It has been programmed for a personal computer running Windows. The algorithm is non-anticipative in that it regulates access at the current time without using future information. As a result, it is computationally efficient and can be bolstered with dynamically-updated information. Globally optimal for cases (1) and (2), the heuristic has been developed with slow-varying O-D tables in mind. Significant improvements will likely require anticipatory information. An illustrative example is given.

Suggested Citation

  • Lovell, David J. & Daganzo, Carlos F., 2000. "Access control on networks with unique origin-destination paths," Transportation Research Part B: Methodological, Elsevier, vol. 34(3), pages 185-202, April.
    • Handle: RePEc:eee:transb:v:34:y:2000:i:3:p:185-202
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(99)00020-X
    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. Yang, Hai & Yagar, Sam & Iida, Yasunori & Asakura, Yasuo, 1994. "An algorithm for the inflow control problem on urban freeway networks with user-optimal flows," Transportation Research Part B: Methodological, Elsevier, vol. 28(2), pages 123-139, April.
    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. So, Stella Kin-Mang, 2010. "Managing City Evacuations," University of California Transportation Center, Working Papers qt5257005q, University of California Transportation Center.
    2. So, Stella K. & Daganzo, Carlos F., 2010. "Managing evacuation routes," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 514-520, May.
    3. Zhang, Lei & Levinson, David, 2004. "Optimal freeway ramp control without origin-destination information," Transportation Research Part B: Methodological, Elsevier, vol. 38(10), pages 869-887, December.
    4. So, Stella Kin-Mang, 2010. "Managing City Evacuations," University of California Transportation Center, Working Papers qt23w302h9, University of California Transportation Center.
    5. Itani, Ibrahim & Cassidy, Michael J. & Daganzo, Carlos, 2021. "Synergies of combining demand- and supply-side measures to manage congested streets," Transportation Research Part A: Policy and Practice, Elsevier, vol. 151(C), pages 172-179.
    6. Gomes, Gabriel C., 2004. "Optimization and Microsimulation of On-ramp Metering for Congested Freeways," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt95k1q411, Institute of Transportation Studies, UC Berkeley.
    7. Wu, Wen-Xiang & Huang, Hai-Jun, 2019. "A combined, adaptive strategy for managing evacuation routes," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 182-198.
    8. Shen, Wei & Zhang, H.M., 2010. "Pareto-improving ramp metering strategies for reducing congestion in the morning commute," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(9), pages 676-696, November.
    9. So, Stella K. & Daganzo, Carlos F., 2009. "Managing Evacuation Routes," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt75d4j8fm, Institute of Transportation Studies, UC Berkeley.
    10. Daganzo, Carlos F. & Laval, Jorge & Munoz, Juan Carlos, 2002. "Ten Strategies for Freeway Congestion Mitigation with Advanced Technologies," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt4kd6v6qf, Institute of Transportation Studies, UC Berkeley.
    11. Laval, Jorge A. & Munoz, Juan Carlos, 2002. "System Optimum Diversion of Congested Freeway Traffic," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt8ps30578, Institute of Transportation Studies, UC Berkeley.
    12. Daganzo, Carlos F. & So, Stella K., 2011. "Managing evacuation networks," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1424-1432.
    13. Zhang, H.M. & Shen, Wei, 2010. "Access control policies without inside queues: Their properties and public policy implications," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 1132-1147, September.

    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, Hai, 1997. "Sensitivity analysis for the elastic-demand network equilibrium problem with applications," Transportation Research Part B: Methodological, Elsevier, vol. 31(1), pages 55-70, February.
    2. Ziyou, Gao & Yifan, Song, 2002. "A reserve capacity model of optimal signal control with user-equilibrium route choice," Transportation Research Part B: Methodological, Elsevier, vol. 36(4), pages 313-323, May.
    3. Yang, Hai, 1995. "Heuristic algorithms for the bilevel origin-destination matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 231-242, August.
    4. Yang, Hai & Bell, Michael G. H. & Meng, Qiang, 2000. "Modeling the capacity and level of service of urban transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 34(4), pages 255-275, May.
    5. Yin, Yafeng & Madanat, Samer M. & Lu, Xiao-Yun, 2009. "Robust improvement schemes for road networks under demand uncertainty," European Journal of Operational Research, Elsevier, vol. 198(2), pages 470-479, October.
    6. Clark, Stephen D. & Watling, David P., 2002. "Sensitivity analysis of the probit-based stochastic user equilibrium assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 36(7), pages 617-635, August.
    7. Chan, K. S. & Lam, William H. K., 2002. "Optimal speed detector density for the network with travel time information," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(3), pages 203-223, March.
    8. Yafeng Yin, 2006. "Optimal Fleet Allocation of Freeway Service Patrols," Networks and Spatial Economics, Springer, vol. 6(3), pages 221-234, September.
    9. Zhang, Fang & Lu, Jian & Hu, Xiaojian, 2022. "Integrated path controlling and subsidy scheme for mobility and environmental management in automated transportation networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    10. Clegg, Janet & Smith, Mike & Xiang, Yanling & Yarrow, Robert, 2001. "Bilevel programming applied to optimising urban transportation," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 41-70, January.
    11. Gomes, Gabriel C., 2004. "Optimization and Microsimulation of On-ramp Metering for Congested Freeways," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt95k1q411, Institute of Transportation Studies, UC Berkeley.
    12. Meng, Q. & Yang, H. & Bell, M. G. H., 2001. "An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 83-105, January.
    13. Yan, Hai & Lam, William H. K., 1996. "Optimal road tolls under conditions of queueing and congestion," Transportation Research Part A: Policy and Practice, Elsevier, vol. 30(5), pages 319-332, September.
    14. Josefsson, Magnus & Patriksson, Michael, 2007. "Sensitivity analysis of separable traffic equilibrium equilibria with application to bilevel optimization in network design," Transportation Research Part B: Methodological, Elsevier, vol. 41(1), pages 4-31, January.

    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:34:y:2000:i:3:p:185-202. 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.