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

A link-node reformulation of ridesharing user equilibrium with network design

Author

Listed:
  • Di, Xuan
  • Ma, Rui
  • Liu, Henry X.
  • Ban, Xuegang (Jeff)

Abstract

Though the conventional network design is extensively studied, the network design problem for ridesharing, in particular, the deployment of high-occupancy toll (HOT) lanes, remains understudied. This paper focuses on one type of network design problem as to whether existing roads should be retrofit into HOT lanes. It is a continuous bi-level mathematical program with equilibrium constraints. The lower level problem is ridesharing user equilibrium (RUE). To reduce the problem size and facilitate computation, we reformulate RUE in the link-node representation. Then we extend the RUE framework to accommodate the presence of HOT lanes and tolls. Algorithms are briefly discussed and numerical examples are illustrated on the Braess network and the Sioux Falls network, respectively. Results show that carefully selecting the deployment of HOT lanes can improve the overall system travel time.

Suggested Citation

  • Di, Xuan & Ma, Rui & Liu, Henry X. & Ban, Xuegang (Jeff), 2018. "A link-node reformulation of ridesharing user equilibrium with network design," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 230-255.
    • Handle: RePEc:eee:transb:v:112:y:2018:i:c:p:230-255
    DOI: 10.1016/j.trb.2018.04.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261517304861
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2018.04.006?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
    ---><---

    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. 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. Poorzahedy, Hossain & Turnquist, Mark A., 1982. "Approximate algorithms for the discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 16(1), pages 45-55, February.
    3. Lihui Zhang & Siriphong Lawphongpanich & Yafeng Yin, 2009. "An Active-set Algorithm for Discrete Network Design Problems," Springer Books, in: William H. K. Lam & S. C. Wong & Hong K. Lo (ed.), Transportation and Traffic Theory 2009: Golden Jubilee, chapter 0, pages 283-300, Springer.
    4. Xu, Huayu & Pang, Jong-Shi & Ordóñez, Fernando & Dessouky, Maged, 2015. "Complementarity models for traffic equilibrium with ridesharing," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 161-182.
    5. Drezner, Zvi & Wesolowsky, George O., 2003. "Network design: selection and design of links and facility location," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(3), pages 241-256, March.
    6. Larsson, Torbjörn & Patriksson, Michael, 1999. "Side constrained traffic equilibrium models-- analysis, computation and applications," Transportation Research Part B: Methodological, Elsevier, vol. 33(4), pages 233-264, May.
    7. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    8. 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.
    9. Larry J. Leblanc, 1975. "An Algorithm for the Discrete Network Design Problem," Transportation Science, INFORMS, vol. 9(3), pages 183-199, August.
    10. Yang, Hai & Bell, Michael G. H., 2001. "Transport bilevel programming problems: recent methodological advances," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 1-4, January.
    11. D E Boyce, 1984. "Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects," Environment and Planning A, , vol. 16(11), pages 1445-1474, November.
    12. Poorzahedy, Hossain & Rouhani, Omid M., 2007. "Hybrid meta-heuristic algorithms for solving network design problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 578-596, October.
    13. Hossain Poorzahedy & Farhad Abulghasemi, 2005. "Application of Ant System to network design problem," Transportation, Springer, vol. 32(3), pages 251-273, May.
    14. Yang, Hai & Huang, Hai-Jun, 1999. "Carpooling and congestion pricing in a multilane highway with high-occupancy-vehicle lanes," Transportation Research Part A: Policy and Practice, Elsevier, vol. 33(2), pages 139-155, February.
    15. Xuegang (Jeff)Ban & Shu Lu & Michael Ferris & Henry X. Liu, 2009. "Risk Averse Second Best Toll Pricing," Springer Books, in: William H. K. Lam & S. C. Wong & Hong K. Lo (ed.), Transportation and Traffic Theory 2009: Golden Jubilee, chapter 0, pages 197-218, Springer.
    16. Di, Xuan & Liu, Henry X. & Ban, Xuegang (Jeff), 2016. "Second best toll pricing within the framework of bounded rationality," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 74-90.
    17. Gao, Ziyou & Wu, Jianjun & Sun, Huijun, 2005. "Solution algorithm for the bi-level discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 39(6), pages 479-495, July.
    18. Di, Xuan & He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2014. "Braess paradox under the boundedly rational user equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 86-108.
    19. Hai-Jun Huang & Hai Yang & Michael G.H. Bell, 2000. "The models and economics of carpools," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 34(1), pages 55-68.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Luathep, Paramet & Sumalee, Agachai & Lam, William H.K. & Li, Zhi-Chun & Lo, Hong K., 2011. "Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(5), pages 808-827, June.
    3. Wang, Shuaian & Meng, Qiang & Yang, Hai, 2013. "Global optimization methods for the discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 50(C), pages 42-60.
    4. Elnaz Miandoabchi & Reza Farahani & W. Szeto, 2012. "Bi-objective bimodal urban road network design using hybrid metaheuristics," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(4), pages 583-621, December.
    5. Wang, David Z.W. & Liu, Haoxiang & Szeto, W.Y., 2015. "A novel discrete network design problem formulation and its global optimization solution algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 213-230.
    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. Khooban, Zohreh & Farahani, Reza Zanjirani & Miandoabchi, Elnaz & Szeto, W.Y., 2015. "Mixed network design using hybrid scatter search," European Journal of Operational Research, Elsevier, vol. 247(3), pages 699-710.
    8. Hosseininasab, Seyyed-Mohammadreza & Shetab-Boushehri, Seyyed-Nader & Hejazi, Seyed Reza & Karimi, Hadi, 2018. "A multi-objective integrated model for selecting, scheduling, and budgeting road construction projects," European Journal of Operational Research, Elsevier, vol. 271(1), pages 262-277.
    9. 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.
    10. Hosseininasab, Seyyed-Mohammadreza & Shetab-Boushehri, Seyyed-Nader, 2015. "Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 762-771.
    11. Elnaz Miandoabchi & Reza Farahani & Wout Dullaert & W. Szeto, 2012. "Hybrid Evolutionary Metaheuristics for Concurrent Multi-Objective Design of Urban Road and Public Transit Networks," Networks and Spatial Economics, Springer, vol. 12(3), pages 441-480, September.
    12. Bastiaan Possel & Luc J. J. Wismans & Eric C. Berkum & Michiel C. J. Bliemer, 2018. "The multi-objective network design problem using minimizing externalities as objectives: comparison of a genetic algorithm and simulated annealing framework," Transportation, Springer, vol. 45(2), pages 545-572, March.
    13. Liu, Jiangtao & Zhou, Xuesong, 2016. "Capacitated transit service network design with boundedly rational agents," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 225-250.
    14. Poorzahedy, Hossain & Rouhani, Omid M., 2007. "Hybrid meta-heuristic algorithms for solving network design problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 578-596, October.
    15. Fontaine, Pirmin & Minner, Stefan, 2014. "Benders Decomposition for Discrete–Continuous Linear Bilevel Problems with application to traffic network design," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 163-172.
    16. Karimi Dehnavi, Hadi & Rezvan, Mohammad Taghi & Shirmohammadli, Abdolmatin & Vallée, Dirk, 2013. "A solution for urban road selection and construction problem using simulation and goal programming—Case study of the city of Isfahan," Transport Policy, Elsevier, vol. 29(C), pages 46-53.
    17. Sun, S. & Szeto, W.Y., 2021. "Multi-class stochastic user equilibrium assignment model with ridesharing: Formulation and policy implications," Transportation Research Part A: Policy and Practice, Elsevier, vol. 145(C), pages 203-227.
    18. Di, Xuan & Ban, Xuegang Jeff, 2019. "A unified equilibrium framework of new shared mobility systems," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 50-78.
    19. Yamada, Tadashi & Febri, Zukhruf, 2015. "Freight transport network design using particle swarm optimisation in supply chain–transport supernetwork equilibrium," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 164-187.
    20. Di, Xuan & Liu, Henry X. & Ban, Xuegang (Jeff), 2016. "Second best toll pricing within the framework of bounded rationality," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 74-90.

    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:112:y:2018:i:c:p:230-255. 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.