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

The capacitated hybrid truck platooning network design problem

Author

Listed:
  • Liatsos, Vasileios
  • Golias, Mihalis
  • Hourdos, John
  • Mishra, Sabyasachee

Abstract

In this paper, we introduce and formulate the capacitated hybrid truck platooning network design problem. The scope of this research is to benchmark the various parameters that affect the implementation of the hybrid truck platoon concept and the quantification of (any) monetary savings under the assumption that technological advancements and new or updated infrastructure (e.g., dedicated truck corridors) will allow implementation. Cost savings considered in this research are easily verifiable as they are solely derived from driver compensation savings (i.e., fuel savings, emissions reduction, and insurance savings are not considered). The proposed model further considers monetary penalties from truck late arrivals at the destinations. Multiple network instances are developed and used to evaluate the proposed model. Results indicate that significant cost savings can be achieved from the platooning network when compared to the shortest path origin–destination counterpart and suggest that the optimal hybrid truck platoon capacity is between four and six.

Suggested Citation

  • 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).
    • Handle: RePEc:eee:transa:v:181:y:2024:i:c:s0965856424000478
    DOI: 10.1016/j.tra.2024.103999
    as

    Download full text from publisher

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

    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:transa:v:181:y:2024:i:c:s0965856424000478. 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.

    We have no bibliographic references for this item. You can help adding them by using 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/547/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.