Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations

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 c...

Full description

Saved in:
Bibliographic Details
Published in:Transportation research. Part E, Logistics and transportation review Vol. 168; p. 102922
Main Authors: Bustos-Coral, Daniel, Costa, Alysson M.
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.12.2022
Subjects:
Compatibility constraint
Drayage routing
Heterogeneous fleet
Mixed-integer programming
Truck load configuration
Heterogeneous fleet
Compatibility constraint
Truck load configuration
Drayage routing
Mixed-integer programming
ISSN:1366-5545, 1878-5794
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. •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.
ISSN:1366-5545
1878-5794
DOI:10.1016/j.tre.2022.102922