IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v36y2024i4d10.1007_s10696-023-09527-5.html
   My bibliography  Save this article

A variable neighborhood search algorithm for the location problem of platoon formation center

Author

Listed:
  • Zhaojie Xue

    (Shenzhen University
    Key Laboratory of Coastal Urban Resilient Infrastructures (Shenzhen University), Ministry of Education
    Underground Polis Academy, Shenzhen University)

  • Wenxiang Peng

    (Shenzhen University
    Key Laboratory of Coastal Urban Resilient Infrastructures (Shenzhen University), Ministry of Education
    Underground Polis Academy, Shenzhen University)

  • Haipeng Cui

    (Shenzhen University
    Key Laboratory of Coastal Urban Resilient Infrastructures (Shenzhen University), Ministry of Education
    Underground Polis Academy, Shenzhen University)

Abstract

Autonomous platooning technology has been considered a promising solution for reducing costs in the trucking industry. In trucking networks, the operation of autonomous truck platoons is constrained by many factors such as network topology, travel distance, and demand distribution, indicating the importance of deciding when and where to form and decompose platoons. This study investigates a novel location problem for platoon formation center (PFC) in a trucking network, which plays an important role in platooning operations. PFCs are specifically constructed as infrastructures for the formation and decomposition of truck platoons. Semi-automated truck platoons traveling between PFCs save labor and fuel. Therefore, each origin–destination (OD) pair in the trucking network can choose a beneficial transportation route via PFCs. This study aims to find the optimal PFC location scheme and OD demand routing scheme to minimize the total cost, which includes PFC construction, driver labor, and truck fuel costs. Accordingly, a mixed-integer linear programming model is developed. To effectively solve large-scale problems in practical applications, a variable neighborhood search algorithm embedded with a heuristic routing allocation algorithm is designed. We construct 20 instances with different characteristics, such as the number and distribution of customer nodes and PFC candidate nodes; construction cost of PFC candidate nodes; and amount and distribution of OD demand. We evaluate the efficiency of the algorithm based on the experimental results. Furthermore, the benefits of the new transportation mode are quantified, and planners are provided with insights into PFC construction.

Suggested Citation

  • Zhaojie Xue & Wenxiang Peng & Haipeng Cui, 2024. "A variable neighborhood search algorithm for the location problem of platoon formation center," Flexible Services and Manufacturing Journal, Springer, vol. 36(4), pages 1292-1323, December.
    • Handle: RePEc:spr:flsman:v:36:y:2024:i:4:d:10.1007_s10696-023-09527-5
    DOI: 10.1007/s10696-023-09527-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-023-09527-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10696-023-09527-5?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. Bhoopalam, Anirudh Kishore & Agatz, Niels & Zuidwijk, Rob, 2018. "Planning of truck platoons: A literature review and directions for future research," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 212-228.
    2. You, Jintao & Miao, Lixin & Zhang, Canrong & Xue, Zhaojie, 2020. "A generic model for the local container drayage problem using the emerging truck platooning operation mode," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 181-209.
    3. Cui, Haipeng & Chen, Shukai & Chen, Rui & Meng, Qiang, 2022. "A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition," European Journal of Operational Research, Elsevier, vol. 299(2), pages 468-482.
    4. Boysen, Nils & Briskorn, Dirk & Schwerdfeger, Stefan, 2018. "The identical-path truck platooning problem," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 26-39.
    5. Chen, Shukai & Wang, Hua & Meng, Qiang, 2021. "Autonomous truck scheduling for container transshipment between two seaport terminals considering platooning and speed optimization," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 289-315.
    6. Xue, Zhaojie & Lin, Hui & You, Jintao, 2021. "Local container drayage problem with truck platooning mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    7. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    8. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    9. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    10. S. Sivanandham & M. S. Gajanand, 2020. "Platooning for sustainable freight transportation: an adoptable practice in the near future?," Transport Reviews, Taylor & Francis Journals, vol. 40(5), pages 581-606, July.
    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. Yan, Xiaoyuan & Xu, Min & Xie, Chi, 2023. "Local container drayage problem with improved truck platooning operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    2. Chen, Shukai & Wang, Hua & Meng, Qiang, 2023. "Cost allocation of cooperative autonomous truck platooning: Efficiency and stability analysis," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 119-141.
    3. Bouchery, Yann & Hezarkhani, Behzad & Stauffer, Gautier, 2022. "Coalition formation and cost sharing for truck platooning," Transportation Research Part B: Methodological, Elsevier, vol. 165(C), pages 15-34.
    4. Chen, Rui & Meng, Qiang & Jia, Peng, 2022. "Container port drayage operations and management: Past and future," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    5. Bustos-Coral, Daniel & Costa, Alysson M., 2022. "Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    6. You, Jintao & Wang, Yuan & Xue, Zhaojie, 2023. "An exact algorithm for the multi-trip container drayage problem with truck platooning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    7. Chen, Shukai & Wang, Hua & Meng, Qiang, 2021. "Autonomous truck scheduling for container transshipment between two seaport terminals considering platooning and speed optimization," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 289-315.
    8. Boshuai Zhao & Roel Leus, 2022. "An improved decomposition-based heuristic for truck platooning," Papers 2210.05562, arXiv.org, revised Feb 2023.
    9. Scholl, Joachim & Boysen, Nils & Scholl, Armin, 2023. "E-platooning: Optimizing platoon formation for long-haul transportation with electric commercial vehicles," European Journal of Operational Research, Elsevier, vol. 304(2), pages 525-542.
    10. Hu, Qiaolin & Gu, Weihua & Wu, Lingxiao & Zhang, Le, 2024. "Optimal autonomous truck platooning with detours, nonlinear costs, and a platoon size constraint," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    11. Xue, Zhaojie & Lin, Hui & You, Jintao, 2021. "Local container drayage problem with truck platooning mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    12. Liatsos, Vasileios & Golias, Mihalis & Hourdos, John & Mishra, Sabyasachee, 2024. "The capacitated hybrid truck platooning network design problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 181(C).
    13. Barua, Limon & Zou, Bo & Choobchian, Pooria, 2023. "Maximizing truck platooning participation with preferences," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    14. Chen, Rui & Jia, Shuai & Meng, Qiang, 2023. "Dynamic container drayage booking and routing decision support approach for E-commerce platforms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    15. Ramirez Ibarra, Monica & Saphores, Jean-Daniel M., 2023. "1,000 HP electric drayage trucks as a substitute for new freeway lanes construction," Transportation Research Part A: Policy and Practice, Elsevier, vol. 171(C).
    16. Vitalii Naumov & Olha Shulika & Oleksandra Orda & Hanna Vasiutina & Marek Bauer & Myroslav Oliskevych, 2022. "Shaping the Optimal Technology for Servicing the Long-Distance Deliveries of Packaged Cargo by Road Transport," Sustainability, MDPI, vol. 14(12), pages 1-17, June.
    17. Guan, Hao & Wang, Hua & Meng, Qiang & Mak, Chin Long, 2023. "Markov chain-based traffic analysis on platooning effect among mixed semi- and fully-autonomous vehicles in a freeway lane," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 176-202.
    18. Dukkanci, Okan & Campbell, James F. & Kara, Bahar Y., 2024. "Facility location decisions for drone delivery: A literature review," European Journal of Operational Research, Elsevier, vol. 316(2), pages 397-418.
    19. Roy, Debjit & van Ommeren, Jan-Kees & de Koster, René & Gharehgozli, Amir, 2022. "Modeling landside container terminal queues: Exact analysis and approximations," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 73-102.
    20. Xiong, Xi & Sha, Junyi & Jin, Li, 2021. "Optimizing coordinated vehicle platooning: An analytical approach based on stochastic dynamic programming," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 482-502.

    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:spr:flsman:v:36:y:2024:i:4:d:10.1007_s10696-023-09527-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.