Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints

This paper addresses the vehicle routing and driver scheduling problem of finding a low cost route and stoppage schedule for long-haul point-to-point full-load trips with intermediate stops due to refueling needs and driver hours-of-service regulatory restrictions. This is an important problem for long-haul truck drivers because in practice regulatory driving limits often do not coincide with availability of stoppage alternatives for quick rest, for meal, for overnight, or for weekly downtime required stops. The paper presents a methodology and algorithm to pick routes that optimize stoppages within the HOS constraints, an important factor of both highway safety and driver productivity. A solution for this variant of the vehicle routing and truck driver scheduling problem (VRTDS-HOS) that is fast enough to potentially be used in real time is proposed by modeling possible stoppage configurations as nodes in an iteratively built multi-dimensional state-space graph and by using heuristics to decrease processing time when searching for the lowest-cost path in that graph. Individual nodes in the graph are characterized by spatial, temporal, and stoppage attributes, and are expanded sequentially to search for low-cost paths between the origin and the destination. Within this multi-dimensional state-space graph, the paper proposes two heuristics applied to a shortest-path algorithmic solution based on the \(A^*\) algorithm to increase processing speed enough to potentially permit real-time usage. An illustrative application to Brazilian regulations is provided. Results were successful and are reported together with sensitivity analyses comparing alternative routes and different heuristics processing speeds.