IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v56y2022i2p404-435.html
   My bibliography  Save this article

Long-Haul Vehicle Routing and Scheduling with Biomathematical Fatigue Constraints

Author

Listed:
  • Jiawei Fu

    (Department of Industrial Engineering, Tsinghua University, 100084 Beijing, China)

  • Liang Ma

    (Department of Industrial Engineering, Tsinghua University, 100084 Beijing, China)

Abstract

Hours of service (HOS) regulations are among the conventional safety constraints that are compiled by long-haul truck drivers. These regulations have been considered in models and algorithms of vehicle routing problems to assign safe schedules to drivers. However, the HOS regulations neglect a few crucial fatigue risk factors and, at times, fail to generate fatigue-reducing schedules. In this study, a set of biomathematical fatigue constraints (BFCs) derived from biomathematical models are considered for a long-haul vehicle routing and scheduling problem. A BFC scheduling algorithm and a BFC-HOS scheduling algorithm have been developed and then embedded within a tabu search heuristic to solve the combined vehicle routing and scheduling problem. All the solution methods have been tested on modified Solomon instances and a real-life instance, and the computational results confirm the advantages of employing a sophisticated and fatigue-reducing scheduling procedure when planning long-haul transportation.

Suggested Citation

  • Jiawei Fu & Liang Ma, 2022. "Long-Haul Vehicle Routing and Scheduling with Biomathematical Fatigue Constraints," Transportation Science, INFORMS, vol. 56(2), pages 404-435, March.
    • Handle: RePEc:inm:ortrsc:v:56:y:2022:i:2:p:404-435
    DOI: 10.1287/trsc.2021.1089
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2021.1089
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2021.1089?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
    ---><---

    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:ortrsc:v:56:y:2022:i:2:p:404-435. 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 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.