IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v156y2021ics136655452100274x.html
   My bibliography  Save this article

Matching and routing for shared autonomous vehicles in congestible network

Author

Listed:
  • Ge, Qian
  • Han, Ke
  • Liu, Xiaobo

Abstract

The dispatch and routing problems of shared autonomous vehicle (DR-SAV) have been widely studied, and one of the key challenges is the modeling complexity and computational burden associated with network congestion. Existing studies on DR-SAV are limited in the sense that traffic congestion and demand–supply interaction, resulting from dispatch and routing decisions, are not fully integrated into the optimization framework. In this work, we explicitly consider the congestion effect of SAV operations in a mixed traffic environment, consisting of SAVs and conventional vehicles (CVs), by proposing a computationally tractable traffic assignment framework for optimal matching and routing of SAV trips, while allowing the sharing of vehicle by up to two trips simultaneously. This problem is formulated as a Stackelberg game where the upper level is inherently a matching and routing problem for SAVs, and the lower level involves a user equilibrium among CVs. Two strategies are proposed to improve the tractability of the proposed problem: (1) a novel convex programming formulation of the joint SAV matching–routing problem based on the system optimal traffic assignment principle, and (2) the invocation of shareability network to facilitate path set generation. Numerical experiments of the proposed method show that the proposed SAV matching and routing scheme could lead to significant reduction in total travel cost.

Suggested Citation

  • Ge, Qian & Han, Ke & Liu, Xiaobo, 2021. "Matching and routing for shared autonomous vehicles in congestible network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    • Handle: RePEc:eee:transe:v:156:y:2021:i:c:s136655452100274x
    DOI: 10.1016/j.tre.2021.102513
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S136655452100274X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2021.102513?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. Dimitris Bertsimas & Patrick Jaillet, & Sébastien Martin, 2019. "Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications," Operations Research, INFORMS, vol. 67(1), pages 143-162, January.
    2. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 14(2), pages 130-154, May.
    3. Gerardo Berbeglia & Jean-François Cordeau & Gilbert Laporte, 2012. "A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 343-355, August.
    4. Garaix, Thierry & Artigues, Christian & Feillet, Dominique & Josselin, Didier, 2010. "Vehicle routing problems with alternative paths: An application to on-demand transportation," European Journal of Operational Research, Elsevier, vol. 204(1), pages 62-75, July.
    5. Correia, Gonçalo Homem de Almeida & van Arem, Bart, 2016. "Solving the User Optimum Privately Owned Automated Vehicles Assignment Problem (UO-POAVAP): A model to explore the impacts of self-driving vehicles on urban mobility," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 64-88.
    6. Arnott, R. & de Palma, A. & Lindsey, R., 1990. "Departure time and route choice for the morning commute," Transportation Research Part B: Methodological, Elsevier, vol. 24(3), pages 209-228, June.
    7. Schilde, M. & Doerner, K.F. & Hartl, R.F., 2014. "Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 18-30.
    8. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Rejoinder on: Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 45-47, July.
    9. Li, Yuanyuan & Liu, Yang & Xie, Jun, 2020. "A path-based equilibrium model for ridesharing matching," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 373-405.
    10. R M Jorgensen & J Larsen & K B Bergvinsdottir, 2007. "Solving the Dial-a-Ride problem using genetic algorithms," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(10), pages 1321-1331, October.
    11. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    12. Chen, T. Donna & Kockelman, Kara M. & Hanna, Josiah P., 2016. "Operations of a shared, autonomous, electric vehicle fleet: Implications of vehicle & charging infrastructure decisions," Transportation Research Part A: Policy and Practice, Elsevier, vol. 94(C), pages 243-254.
    13. 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.
    14. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    15. Chaisak Suwansirikul & Terry L. Friesz & Roger L. Tobin, 1987. "Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem," Transportation Science, INFORMS, vol. 21(4), pages 254-263, November.
    16. Terry L. Friesz & Hsun-Jung Cho & Nihal J. Mehta & Roger L. Tobin & G. Anandalingam, 1992. "A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints," Transportation Science, INFORMS, vol. 26(1), pages 18-26, February.
    17. Shenglong Zhou & Alain B. Zemkoho & Andrey Tin, 2020. "BOLIB: Bilevel Optimization LIBrary of Test Problems," Springer Optimization and Its Applications, in: Stephan Dempe & Alain Zemkoho (ed.), Bilevel Optimization, chapter 0, pages 563-580, Springer.
    18. Harilaos N. Psaraftis, 1983. "An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows," Transportation Science, INFORMS, vol. 17(3), pages 351-357, August.
    19. Thomas Hanne & Teresa Melo & Stefan Nickel, 2009. "Bringing Robustness to Patient Flow Management Through Optimized Patient Transports in Hospitals," Interfaces, INFORMS, vol. 39(3), pages 241-255, June.
    20. Nie, Yu (Marco) & Zhang, H.M., 2008. "A variational inequality formulation for inferring dynamic origin-destination travel demands," Transportation Research Part B: Methodological, Elsevier, vol. 42(7-8), pages 635-662, August.
    21. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    22. Xiang, Zhihai & Chu, Chengbin & Chen, Haoxun, 2008. "The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments," European Journal of Operational Research, Elsevier, vol. 185(2), pages 534-551, March.
    23. Yang, Hai & Zhang, Xiaoning & Meng, Qiang, 2007. "Stackelberg games and multiple equilibrium behaviors on networks," Transportation Research Part B: Methodological, Elsevier, vol. 41(8), pages 841-861, October.
    24. Abdulaal, Mustafa & LeBlanc, Larry J., 1979. "Continuous equilibrium network design models," Transportation Research Part B: Methodological, Elsevier, vol. 13(1), pages 19-32, March.
    25. Fabien Lehuédé & Renaud Masson & Sophie N Parragh & Olivier Péton & Fabien Tricoire, 2014. "A multi-criteria large neighbourhood search for the transportation of disabled people," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(7), pages 983-1000, July.
    26. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    27. Paquette, Julie & Cordeau, Jean-François & Laporte, Gilbert & Pascoal, Marta M.B., 2013. "Combining multicriteria analysis and tabu search for dial-a-ride problems," Transportation Research Part B: Methodological, Elsevier, vol. 52(C), pages 1-16.
    28. Song, Wenjing & Han, Ke & Wang, Yiou & Friesz, Terry L. & del Castillo, Enrique, 2018. "Statistical metamodeling of dynamic network loading," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 740-756.
    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. Najmi, Ali & Waller, Travis & Rashidi, Taha H., 2023. "Equity in network design and pricing: A discretely-constrained MPEC problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 176(C).
    2. Fan, Qiaochu & van Essen, J. Theresia & Correia, Gonçalo H.A., 2024. "A bi-level framework for heterogeneous fleet sizing of ride-hailing services considering an approximated mixed equilibrium between automated and non-automated traffic," European Journal of Operational Research, Elsevier, vol. 315(3), pages 879-898.
    3. Levin, Michael W., 2022. "A general maximum-stability dispatch policy for shared autonomous vehicle dispatch with an analytical characterization of the maximum throughput," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 258-280.
    4. Chen, Yao & Liu, Yang & Bai, Yun & Mao, Baohua, 2024. "Real-time dispatch management of shared autonomous vehicles with on-demand and pre-booked requests," Transportation Research Part A: Policy and Practice, Elsevier, vol. 181(C).

    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. Sharif Azadeh, Sh. & Atasoy, Bilge & Ben-Akiva, Moshe E. & Bierlaire, M. & Maknoon, M.Y., 2022. "Choice-driven dial-a-ride problem for demand responsive mobility service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 128-149.
    2. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    3. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    4. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    5. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    6. Gaul, Daniela & Klamroth, Kathrin & Stiglmayr, Michael, 2022. "Event-based MILP models for ridepooling applications," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1048-1063.
    7. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
    8. Tafreshian, Amirmahdi & Abdolmaleki, Mojtaba & Masoud, Neda & Wang, Huizhu, 2021. "Proactive shuttle dispatching in large-scale dynamic dial-a-ride systems," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 227-259.
    9. Hosni, Hadi & Naoum-Sawaya, Joe & Artail, Hassan, 2014. "The shared-taxi problem: Formulation and solution methods," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 303-318.
    10. Lian, Ying & Lucas, Flavien & Sörensen, Kenneth, 2024. "Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system," European Journal of Operational Research, Elsevier, vol. 312(1), pages 338-356.
    11. Häme, Lauri, 2011. "An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows," European Journal of Operational Research, Elsevier, vol. 209(1), pages 11-22, February.
    12. LIAN, Ying & LUCAS, Flavien & SÖRENSEN, Kenneth, 2022. "On-demand bus routing problem with dynamic stochastic requests and prepositioning," Working Papers 2022004, University of Antwerp, Faculty of Business and Economics.
    13. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    14. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    15. Lu, Chang & Wu, Yuehui & Yu, Shanchuan, 2022. "A Sample Average Approximation Approach for the Stochastic Dial-A-Ride Problem on a Multigraph with User Satisfaction," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1031-1044.
    16. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    17. Dai, Rongjian & Ding, Chuan & Gao, Jian & Wu, Xinkai & Yu, Bin, 2022. "Optimization and evaluation for autonomous taxi ride-sharing schedule and depot location from the perspective of energy consumption," Applied Energy, Elsevier, vol. 308(C).
    18. Psaraftis, Harilaos N., 2011. "A multi-commodity, capacitated pickup and delivery problem: The single and two-vehicle cases," European Journal of Operational Research, Elsevier, vol. 215(3), pages 572-580, December.
    19. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    20. Andrew Lim & Zhenzhen Zhang & Hu Qin, 2017. "Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals," Transportation Science, INFORMS, vol. 51(2), pages 688-705, May.

    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:transe:v:156:y:2021:i:c:s136655452100274x. 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/600244/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.