IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i11p3819-3834.html
   My bibliography  Save this article

An efficient system of incentivizing truck drivers to accept night loads

Author

Listed:
  • Yoshinori Suzuki
  • Meltem Denizel

Abstract

Night deliveries are increasingly used by motor carriers to cut costs, but many carriers struggle to secure night truck drivers because many drivers dislike night driving. Monetary incentives are offered to drivers to accept night loads, but the incentive system currently used in practice is inefficient, as it not only pays more incentives than necessary but also does not incentivize the right drivers, both of which increase costs. This paper develops a new incentive system that allows carriers to secure night drivers at lower costs. Based on the interviews conducted with seven motor carriers, as well as the analysis of large night delivery data, we propose a bi-level programming approach that (1) generates a unique incentive for each driver based on his/her night driving performance, and (2) implicitly aligns the incentive paid to each driver with his/her reservation price. Simulation experiments conducted with real-world data showed that by using our approach carriers can not only avoid over-incentivizing drivers, but also (1) incentive only the right set of drivers who can bring cost savings and (2) encourage other drivers to improve night driving. Results also showed that our approach may give cost savings of up to 2.5% over the current system.

Suggested Citation

  • Yoshinori Suzuki & Meltem Denizel, 2024. "An efficient system of incentivizing truck drivers to accept night loads," International Journal of Production Research, Taylor & Francis Journals, vol. 62(11), pages 3819-3834, June.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:11:p:3819-3834
    DOI: 10.1080/00207543.2023.2250008
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2250008
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2023.2250008?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:62:y:2024:i:11:p:3819-3834. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.