Abstract This paper addresses drayage routing problems with heterogeneous fleets, compatibility constraints, and truck load configurations. In these problems, containers can be of any size and cargo category. In addition, compatibility and load configuration constraints define which and how many containers can be transported by each truck. We propose a state transition logic to model these constraints. Based on this logic, we develop two mixed-integer programming models for this family of problems. The first model is a compact formulation that can be input into a black-box solver. The second model combines partial routes in a space–time network and is solved with a tailored branch-and-cut approach. To analyze the efficiency of the proposed models, we conduct extensive computational tests on instances with different numbers of requests, geographical distributions of locations, time-window lengths, and fleet compositions. Moreover, we discuss how our modeling approach can assist decision-making in three different drayage routing applications.
Highlights We consider a drayage routing problem with heterogeneous containers and trucks. A state transition logic sets the trucks’ load capacities and compatible containers. We propose a three-index mixed-integer programming formulation of the problem. We develop a branch-and-cut approach that combines route fragments. We conduct computational experiments on instances with different characteristics.
Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations
2022-09-27
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Feasibility of Operating a Heavy-Duty Battery Electric Truck Fleet for Drayage Applications
Transportation Research Record | 2020
|Local container drayage problem with truck platooning mode
Elsevier | 2020
|Approaches to Improving Drayage in Rail-Truck Intermodal Service
British Library Conference Proceedings | 1995
|