IDEAS home Printed from https://ideas.repec.org/a/sae/envira/v18y1986i4p485-489.html
   My bibliography  Save this article

Integration of Supply and Demand Models in Transportation and Location: Problem Formulations and Research Questions

Author

Listed:
  • D E Boyce

    (Department of Civil Engineering, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA)

Abstract

The formulation of integrated supply and demand models of transportation and location problems as bilevel programming problems is considered. The status of solution algorithms is summarized and the prospects for future research are examined.

Suggested Citation

  • D E Boyce, 1986. "Integration of Supply and Demand Models in Transportation and Location: Problem Formulations and Research Questions," Environment and Planning A, , vol. 18(4), pages 485-489, April.
    • Handle: RePEc:sae:envira:v:18:y:1986:i:4:p:485-489
    DOI: 10.1068/a180485
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/a180485
    Download Restriction: no
    File URL: https://libkey.io/10.1068/a180485?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
    ---><---

    References listed on IDEAS

    as
    1. LeBlanc, Larry J. & Abdulaal, Mustafa, 1984. "A comparison of user-optimum versus system-optimum traffic assignment in transportation network design," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 115-121, April.
    2. LeBlanc, Larry J. & Boyce, David E., 1986. "A bilevel programming algorithm for exact solution of the network design problem with user-optimal flows," Transportation Research Part B: Methodological, Elsevier, vol. 20(3), pages 259-265, June.
    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. Michael Wegener & Franz Fuerst, 2004. "Land-Use Transport Interaction: State of the Art," Urban/Regional 0409005, University Library of Munich, Germany.
    2. García-Ródenas, Ricardo & Marín, Ángel, 2009. "Simultaneous estimation of the origin-destination matrices and the parameters of a nested logit model in a combined network equilibrium model," European Journal of Operational Research, Elsevier, vol. 197(1), pages 320-331, 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. Solanki, Rajendra S. & Gorti, Jyothi K. & Southworth, Frank, 1998. "Using decomposition in large-scale highway network design with a quasi-optimization heuristic," Transportation Research Part B: Methodological, Elsevier, vol. 32(2), pages 127-140, February.
    2. T. Kim & Sunduck Suh, 1988. "Toward developing a national transportation planning model: A bilevel programming approach for Korea," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 22(1), pages 65-80, February.
    3. Sun, Yanshuo & Schonfeld, Paul, 2015. "Stochastic capacity expansion models for airport facilities," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 1-18.
    4. Chen, Yuh-Wen & Tzeng, Gwo-Hshiung, 2001. "Using fuzzy integral for evaluating subjectively perceived travel costs in a traffic assignment model," European Journal of Operational Research, Elsevier, vol. 130(3), pages 653-664, May.
    5. David Rey & Hillel Bar-Gera & Vinayak V. Dixit & S. Travis Waller, 2019. "A Branch-and-Price Algorithm for the Bilevel Network Maintenance Scheduling Problem," Transportation Science, INFORMS, vol. 53(5), pages 1455-1478, September.
    6. Hamid Farvaresh & Mohammad Sepehri, 2013. "A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem," Networks and Spatial Economics, Springer, vol. 13(1), pages 67-106, March.
    7. Polyxeni-Margarita Kleniati & Claire Adjiman, 2014. "Branch-and-Sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part I: Theoretical development," Journal of Global Optimization, Springer, vol. 60(3), pages 425-458, November.
    8. Anny B. Wang & W. Y. Szeto, 2020. "Bounding the Inefficiency of the Reliability-Based Continuous Network Design Problem Under Cost Recovery," Networks and Spatial Economics, Springer, vol. 20(2), pages 395-422, June.
    9. Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y. & Rashidi, Hannaneh, 2013. "A review of urban transportation network design problems," European Journal of Operational Research, Elsevier, vol. 229(2), pages 281-302.
    10. Cohn, Amy & Davey, Melinda & Schkade, Lisa & Siegel, Amanda & Wong, Caris, 2008. "Network design and flow problems with cross-arc costs," European Journal of Operational Research, Elsevier, vol. 189(3), pages 890-901, September.
    11. Puchit Sariddichainunta & Masahiro Inuiguchi, 2017. "Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function," Annals of Operations Research, Springer, vol. 256(2), pages 285-304, September.
    12. Sullivan, Edward C. & Wong, Sun, 1989. "Development Of A Dynamic Equilibrium Assignment Procedure For Network-level Analysis Of New Technology," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt9ns859v6, Institute of Transportation Studies, UC Berkeley.
    13. Ferrari, Paolo, 1999. "A model of urban transport management," Transportation Research Part B: Methodological, Elsevier, vol. 33(1), pages 43-61, February.
    14. Teodorović Dušan & Nikolić Miloš, 2023. "Work Zone Scheduling Problem in the Urban Traffic Networks," Economic Themes, Sciendo, vol. 61(1), pages 1-18, March.
    15. Gallo, Mariano & D'Acierno, Luca & Montella, Bruno, 2010. "A meta-heuristic approach for solving the Urban Network Design Problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 144-157, February.
    16. Wei Huang & Guangming Xu & Hong K. Lo, 2020. "Pareto-Optimal Sustainable Transportation Network Design under Spatial Queuing," Networks and Spatial Economics, Springer, vol. 20(3), pages 637-673, September.
    17. Tam, M. L. & Lam, William H. K., 2000. "Maximum car ownership under constraints of road capacity and parking space," Transportation Research Part A: Policy and Practice, Elsevier, vol. 34(3), pages 145-170, April.
    18. A. Kimms & K. Seekircher, 2016. "Network design to anticipate selfish evacuation routing," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(3), pages 271-298, September.
    19. Dung-Ying Lin & Avinash Unnikrishnan & S. Waller, 2011. "A Dual Variable Approximation Based Heuristic for Dynamic Congestion Pricing," Networks and Spatial Economics, Springer, vol. 11(2), pages 271-293, June.
    20. J. Glackin & J. G. Ecker & M. Kupferschmid, 2009. "Solving Bilevel Linear Programs Using Multiple Objective Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 140(2), pages 197-212, February.

    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:sae:envira:v:18:y:1986:i:4:p:485-489. 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: SAGE Publications (email available below). General contact details of provider: .

    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.