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

A stochastic hub location and fleet assignment problem for the design of reconfigurable park-and-ride systems

Author

Listed:
  • Guillot, Matthieu
  • Rey, David
  • Furno, Angelo
  • El Faouzi, Nour-Eddin

Abstract

Park-and-ride systems have the potential to improve the efficiency of transportation networks by providing targeted shared mobility services. The design of a park-and-ride system depends on its role in regards to the broader transportation network. Reconfigurable park-and-ride systems aim to provide complementary shared mobility services in the context of varying travel demand scenarios, such as special events, network maintenance operations or non-recurrent perturbations. The design of reconfigurable park-and-ride systems involves the location of access and egress hubs for shared mobility services. We study an extended version of this hub location problem with integrated fleet assignment decisions. We consider stochastic scenarios representative of varying travel demand and traffic conditions on the network and propose a two-stage stochastic integer programming hub location formulation for this problem. First-stage variables represent hub location decision while second-stage variables represent both scenario-based transportation flows and fleet assignment decisions. The latter represent shared mobility service vehicles and they are modeled as integer variables. We develop solution methods to solve this two-stage stochastic integer programming hub location formulation. Exact approaches based on the L-shaped method are proposed with single- and multi-cut configurations. Valid inequalities along with a tight lower bound for the generation of optimality cuts are presented. We also develop a matheuristic to solve larger problem instances. We report numerical results on problem instances based on real data of the city of Lyon, France. We show how stochastic scenarios representative of varying demand and traffic conditions can be generated from such data. Our experiments demonstrate the benefits of this integrated modeling approach for designing efficient reconfigurable park-and-ride systems while considering fleet assignment decisions.

Suggested Citation

  • Guillot, Matthieu & Rey, David & Furno, Angelo & El Faouzi, Nour-Eddin, 2024. "A stochastic hub location and fleet assignment problem for the design of reconfigurable park-and-ride systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    • Handle: RePEc:eee:transe:v:184:y:2024:i:c:s1366554524000590
    DOI: 10.1016/j.tre.2024.103469
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554524000590
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2024.103469?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. 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.
    2. Zetina, Carlos Armando & Contreras, Ivan & Cordeau, Jean-François & Nikbakhsh, Ehsan, 2017. "Robust uncapacitated hub location," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 393-410.
    3. Parkhurst, Graham, 1995. "Park and ride: Could it lead to an increase in car traffic?," Transport Policy, Elsevier, vol. 2(1), pages 15-23, January.
    4. Shahabi, Mehrdad & Unnikrishnan, Avinash, 2014. "Robust hub network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 356-373.
    5. Sanci, Ece & Daskin, Mark S., 2021. "An integer L-shaped algorithm for the integrated location and network restoration problem in disaster relief," Transportation Research Part B: Methodological, Elsevier, vol. 145(C), pages 152-184.
    6. Aros-Vera, Felipe & Marianov, Vladimir & Mitchell, John E., 2013. "p-Hub approach for the optimal park-and-ride facility location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 277-285.
    7. Gustavo Angulo & Shabbir Ahmed & Santanu S. Dey, 2016. "Improving the Integer L-Shaped Method," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 483-499, August.
    8. Du, Bo & Wang, David Z.W., 2014. "Continuum modeling of park-and-ride services considering travel time reliability and heterogeneous commuters – A linear complementarity system approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 71(C), pages 58-81.
    9. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    10. Henry, Elise & Furno, Angelo & Faouzi, Nour-Eddin El & Rey, David, 2022. "Locating park-and-ride facilities for resilient on-demand urban mobility," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    11. Meraklı, Merve & Yaman, Hande, 2016. "Robust intermodal hub location under polyhedral demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 86(C), pages 66-85.
    12. Hu, Qing-Mi & Hu, Shaolong & Wang, Jian & Li, Xiaoping, 2021. "Stochastic single allocation hub location problems with balanced utilization of hub capacities," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 204-227.
    13. Mariem Fekih & Tom Bellemans & Zbigniew Smoreda & Patrick Bonnel & Angelo Furno & Stéphane Galland, 2021. "A data-driven approach for origin–destination matrix construction from cellular network signalling data: a case study of Lyon region (France)," Transportation, Springer, vol. 48(4), pages 1671-1702, August.
    14. Parkhurst, G., 2000. "Influence of bus-based park and ride facilities on users' car traffic," Transport Policy, Elsevier, vol. 7(2), pages 159-172, April.
    15. Wang, Judith Y. T. & Yang, Hai & Lindsey, Robin, 2004. "Locating and pricing park-and-ride facilities in a linear monocentric city with deterministic mode choice," Transportation Research Part B: Methodological, Elsevier, vol. 38(8), pages 709-731, September.
    16. Gokalp, Can & Patil, Priyadarshan N. & Boyles, Stephen D., 2021. "Post-disaster recovery sequencing strategy for road networks," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 228-245.
    17. Songyot Kitthamkesorn & Anthony Chen & Sathaporn Opasanon & Suwicha Jaita, 2021. "A P-Hub Location Problem for Determining Park-and-Ride Facility Locations with the Weibit-Based Choice Model," Sustainability, MDPI, vol. 13(14), pages 1-16, July.
    18. Joana Cavadas & António Pais Antunes, 2019. "Optimization-based study of the location of park-and-ride facilities," Transportation Planning and Technology, Taylor & Francis Journals, vol. 42(3), pages 201-226, April.
    19. Liu, Zhiyuan & Chen, Xinyuan & Meng, Qiang & Kim, Inhi, 2018. "Remote park-and-ride network equilibrium model and its applications," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 37-62.
    20. Contreras, Ivan & Cordeau, Jean-François & Laporte, Gilbert, 2011. "Stochastic uncapacitated hub location," European Journal of Operational Research, Elsevier, vol. 212(3), pages 518-528, August.
    21. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2012. "Hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 529-543.
    22. Holguı´n-Veras, José & Yushimito, Wilfredo F. & Aros-Vera, Felipe & Reilly, John (Jack), 2012. "User rationality and optimal park-and-ride location under potential demand maximization," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 949-970.
    23. John Penuel & J. Cole Smith & Yang Yuan, 2010. "An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(5), pages 391-402, August.
    24. Escudero, L.F. & Garín, M.A. & Merino, M. & Pérez, G., 2010. "An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspects," European Journal of Operational Research, Elsevier, vol. 204(1), pages 105-116, July.
    25. Mark Horner & Tony Grubesic, 2001. "A GIS-based planning approach to locating urban rail terminals," Transportation, Springer, vol. 28(1), pages 55-77, February.
    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. Ghaffarinasab, Nader & Çavuş, Özlem & Kara, Bahar Y., 2023. "A mean-CVaR approach to the risk-averse single allocation hub location problem with flow-dependent economies of scale," Transportation Research Part B: Methodological, Elsevier, vol. 167(C), pages 32-53.
    2. Domínguez-Bravo, Carmen-Ana & Fernández, Elena & Lüer-Villagra, Armin, 2024. "Hub location with congestion and time-sensitive demand," European Journal of Operational Research, Elsevier, vol. 316(3), pages 828-844.
    3. Ghaffarinasab, Nader & Kara, Bahar Y., 2022. "A conditional β-mean approach to risk-averse stochastic multiple allocation hub location problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    4. Jairo Ortega & János Tóth & Tamás Péter & Sarbast Moslem, 2020. "An Integrated Model of Park-And-Ride Facilities for Sustainable Urban Mobility," Sustainability, MDPI, vol. 12(11), pages 1-15, June.
    5. Andaryan, Abdullah Zareh & Mousighichi, Kasra & Ghaffarinasab, Nader, 2024. "A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands," European Journal of Operational Research, Elsevier, vol. 312(3), pages 954-968.
    6. Zhalechian, M. & Torabi, S. Ali & Mohammadi, M., 2018. "Hub-and-spoke network design under operational and disruption risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 20-43.
    7. Rahmati, Reza & Neghabi, Hossein & Bashiri, Mahdi & Salari, Majid, 2023. "Stochastic regional-based profit-maximizing hub location problem: A sustainable overview," Omega, Elsevier, vol. 121(C).
    8. Hu, Qing-Mi & Hu, Shaolong & Wang, Jian & Li, Xiaoping, 2021. "Stochastic single allocation hub location problems with balanced utilization of hub capacities," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 204-227.
    9. Farid Momayezi & S. Kamal Chaharsooghi & Mohammad Mehdi Sepehri & Ali Husseinzadeh Kashan, 2021. "The capacitated modular single-allocation hub location problem with possibilities of hubs disruptions: modeling and a solution algorithm," Operational Research, Springer, vol. 21(1), pages 139-166, March.
    10. Zhang, Haifeng & Yang, Kai & Gao, Yuan & Yang, Lixing, 2022. "Accelerating Benders decomposition for stochastic incomplete multimodal hub location problem in many-to-many transportation and distribution systems," International Journal of Production Economics, Elsevier, vol. 248(C).
    11. Islem Snoussi & Nadia Hamani & Nassim Mrabti & Lyes Kermad, 2021. "A Robust Mixed-Integer Linear Programming Model for Sustainable Collaborative Distribution," Mathematics, MDPI, vol. 9(18), pages 1-27, September.
    12. Yusuke Kono & Kenetsu Uchida & Katia Andrade, 2014. "Economical welfare maximisation analysis: assessing the use of existing Park-and-Ride services," Transportation, Springer, vol. 41(4), pages 839-854, July.
    13. Gao, Ge & Sun, Huijun & Wu, Jianjun & Liu, Xinmin & Chen, Weiya, 2018. "Park-and-ride service design under a price-based tradable credits scheme in a linear monocentric city," Transport Policy, Elsevier, vol. 68(C), pages 1-12.
    14. Kitthamkesorn, Songyot & Chen, Anthony & Ryu, Seungkyu & Opasanon, Sathaporn, 2024. "Maximum capture problem based on paired combinatorial weibit model to determine park-and-ride facility locations," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    15. Tianqi Liu & Francisco Saldanha-da-Gama & Shuming Wang & Yuchen Mao, 2022. "Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2776-2803, September.
    16. Zetina, Carlos Armando & Contreras, Ivan & Cordeau, Jean-François & Nikbakhsh, Ehsan, 2017. "Robust uncapacitated hub location," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 393-410.
    17. Rostami, Borzou & Kämmerling, Nicolas & Naoum-Sawaya, Joe & Buchheim, Christoph & Clausen, Uwe, 2021. "Stochastic single-allocation hub location," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1087-1106.
    18. Azizi, Nader & Salhi, Said, 2022. "Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor," European Journal of Operational Research, Elsevier, vol. 298(3), pages 834-854.
    19. Henry, Elise & Furno, Angelo & Faouzi, Nour-Eddin El & Rey, David, 2022. "Locating park-and-ride facilities for resilient on-demand urban mobility," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    20. Marc Janschekowitz & Gita Taherkhani & Sibel A. Alumur & Stefan Nickel, 2023. "An alternative approach to address uncertainty in hub location," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(2), pages 359-393, June.

    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:184:y:2024:i:c:s1366554524000590. 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.