IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v35y2023i6p1242-1260.html
   My bibliography  Save this article

Platoon Optimization Based on Truck Pairs

Author

Listed:
  • Anirudh Kishore Bhoopalam

    (Rotterdam School of Management, Erasmus University, 3062 PA Rotterdam, Netherlands)

  • Niels Agatz

    (Rotterdam School of Management, Erasmus University, 3062 PA Rotterdam, Netherlands)

  • Rob Zuidwijk

    (Rotterdam School of Management, Erasmus University, 3062 PA Rotterdam, Netherlands)

Abstract

Truck platooning technology allows trucks to drive at short headways to save fuel and associated emissions. However, fuel savings from platooning are relatively small, so forming platoons should be convenient and associated with minimum detours and delays. In this paper, we focus on developing optimization technology to form truck platoons. We formulate a mathematical program for the platoon routing problem with time windows (PRP-TW) based on a time–space network. We provide polynomial-time algorithms to solve special cases of PRP-TW with two-truck platoons. Based on these special cases, we build several fast heuristics. An extensive set of numerical experiments shows that our heuristics perform well. Moreover, we show that simple two-truck platoons already capture most of the potential savings of platooning.

Suggested Citation

  • Anirudh Kishore Bhoopalam & Niels Agatz & Rob Zuidwijk, 2023. "Platoon Optimization Based on Truck Pairs," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1242-1260, November.
    • Handle: RePEc:inm:orijoc:v:35:y:2023:i:6:p:1242-1260
    DOI: 10.1287/ijoc.2020.0302
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2020.0302
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2020.0302?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. Nowakowski, Christopher & Shladover, Steven E & Lu, Xiao-Yun & Thompson, Deborah & Kailas, Aravind, 2015. "Cooperative Adaptive Cruise Control (CACC) for Truck Platooning: Operational Concept Alternatives," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt7jf9n5wm, Institute of Transportation Studies, UC Berkeley.
    2. Natashia Boland & Mike Hewitt & Luke Marshall & Martin Savelsbergh, 2017. "The Continuous-Time Service Network Design Problem," Operations Research, INFORMS, vol. 65(5), pages 1303-1321, October.
    3. Hani S. Mahmassani, 2016. "50th Anniversary Invited Article—Autonomous Vehicles and Connected Vehicle Systems: Flow and Operations Considerations," Transportation Science, INFORMS, vol. 50(4), pages 1140-1162, November.
    4. George B. Dantzig, 1960. "On the Shortest Route Through a Network," Management Science, INFORMS, vol. 6(2), pages 187-190, January.
    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. Kishore Bhoopalam, A. & Agatz, N.A.H. & Zuidwijk, R.A., 2020. "Spatial and Temporal Synchronization of Truck Platoons," ERIM Report Series Research in Management ERS-2020-014-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. Scherr, Yannick Oskar & Hewitt, Mike & Neumann Saavedra, Bruno Albert & Mattfeld, Dirk Christian, 2020. "Dynamic discretization discovery for the service network design problem with mixed autonomous fleets," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 164-195.
    3. Scherr, Yannick Oskar & Neumann Saavedra, Bruno Albert & Hewitt, Mike & Mattfeld, Dirk Christian, 2019. "Service network design with mixed autonomous fleets," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 124(C), pages 40-55.
    4. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    5. Wu, Xin (Bruce) & Lu, Jiawei & Wu, Shengnan & Zhou, Xuesong (Simon), 2021. "Synchronizing time-dependent transportation services: Reformulation and solution algorithm using quadratic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 140-179.
    6. Lara, Cristiana L. & Koenemann, Jochen & Nie, Yisu & de Souza, Cid C., 2023. "Scalable timing-aware network design via lagrangian decomposition," European Journal of Operational Research, Elsevier, vol. 309(1), pages 152-169.
    7. Wang, Zujian & Qi, Mingyao, 2019. "Service network design considering multiple types of services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 1-14.
    8. Zhang, Fang & Lu, Jian & Hu, Xiaojian & Meng, Qiang, 2023. "Integrated deployment of dedicated lane and roadside unit considering uncertain road capacity under the mixed-autonomy traffic environment," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    9. Lee, Jisun & Joung, Seulgi & Lee, Kyungsik, 2022. "A fully polynomial time approximation scheme for the probability maximizing shortest path problem," European Journal of Operational Research, Elsevier, vol. 300(1), pages 35-45.
    10. Naoto Katayama, 2020. "MIP neighborhood search heuristics for a service network design problem with design-balanced requirements," Journal of Heuristics, Springer, vol. 26(4), pages 475-502, August.
    11. Liu, Chuanju & Lin, Shaochong & Shen, Zuo-Jun Max & Zhang, Junlong, 2023. "Stochastic service network design: The value of fixed routes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
    12. Zhou, Yang & Ahn, Soyoung, 2019. "Robust local and string stability for a decentralized car following control strategy for connected automated vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 175-196.
    13. 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.
    14. Tengilimoglu, Oguz & Carsten, Oliver & Wadud, Zia, 2023. "Implications of automated vehicles for physical road environment: A comprehensive review," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    15. Escobar-Vargas, David & Crainic, Teodor Gabriel, 2024. "Multi-attribute two-echelon location routing: Formulation and dynamic discretization discovery approach," European Journal of Operational Research, Elsevier, vol. 314(1), pages 66-78.
    16. Belieres, Simon & Hewitt, Mike & Jozefowiez, Nicolas & Semet, Frédéric, 2021. "A time-expanded network reduction matheuristic for the logistics service network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    17. Kishore Bhoopalam, A. & van den Berg, R. & Agatz, N.A.H. & Chorus, C.G., 2021. "The long road to automated trucking: Insights from driver focus groups," ERIM Report Series Research in Management ERS-2021-003-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    18. Lu, Jiawei & Nie, Qinghui & Mahmoudi, Monirehalsadat & Ou, Jishun & Li, Chongnan & Zhou, Xuesong Simon, 2022. "Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 143-182.
    19. Osório, António (António Miguel) & Pinto, Alberto Adrego, 2019. "Information, uncertainty and the manipulability of artifcial intelligence autonomous vehicles systems," Working Papers 2072/376028, Universitat Rovira i Virgili, Department of Economics.
    20. Roberto Battistini & Luca Mantecchini & Maria Nadia Postorino, 2020. "Users’ Acceptance of Connected and Automated Shuttles for Tourism Purposes: A Survey Study," Sustainability, MDPI, vol. 12(23), pages 1-17, December.

    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:inm:orijoc:v:35:y:2023:i:6:p:1242-1260. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.