Long-Haul Vehicle Routing and Scheduling with Biomathematical Fatigue Constraints

2021 ◽  
Author(s):  
Jiawei Fu ◽  
Liang Ma
Keyword(s):  
Vehicle Routing ◽  
Scheduling Algorithm ◽  
Real Life ◽  
Scheduling Problem ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling ◽  
Solution Methods ◽  
Safety Constraints ◽  
Fatigue Constraints ◽  
Haul Truck

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.

scholarly journals A Combinatorial Benders’ Cuts Algorithm for the Local Container Drayage Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Zhaojie Xue ◽  
Canrong Zhang ◽  
Peng Yang ◽  
Lixin Miao
Keyword(s):  
Vehicle Routing ◽  
Numerical Experiments ◽  
Operation Mode ◽  
Scheduling Problem ◽  
Temporal Constraints ◽  
Vehicle Routing And Scheduling ◽  
Routing And Scheduling ◽  
Empty Containers ◽  
Operation Cost

This paper examines the local container drayage problem under a special operation mode in which tractors and trailers can be separated; that is, tractors can be assigned to a new task at another location while trailers with containers are waiting for packing or unpacking. Meanwhile, the strategy of sharing empty containers between different customers is also considered to improve the efficiency and lower the operation cost. The problem is formulated as a vehicle routing and scheduling problem with temporal constraints. We adopt combinatorial benders’ cuts algorithm to solve this problem. Numerical experiments are performed on a group of randomly generated instances to test the performance of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document