.png){kind=icon}
.png){kind=icon}
Return
Multi-Trip Multi-Trailer Drop-and-Pull Container Drayage Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TITS.2022.3156547.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses a novel and interesting container drayage problem in which a tractor can pull multiple trailers and can perform multiple trips during a working day. A state-based method and an IF-THEN method are proposed to model the multi-trip feature. The problem is mathematically formulated as two mixed-integer programming models. Three families of valid inequalities are introduced to strengthen the models. An adaptive large neighborhood search (ALNS) algorithm with an embedded decoding mathematical model is proposed to solve realistic-sized instances of the problem. Numerical experiments based on a large number of benchmark instances indicate that the inequalities are valid and that the model based on IF-THEN constraints shows excellent performance. The ALNS algorithm outperforms the strengthened mathematical model considering large-sized instances. The multi-trailer mode is more suitable if customers are clustered in the area far away from the depot when compared to the single-trailer mode.
Keywords:
Transportation
Containers
Agricultural machinery
Routing
Mathematical models
Task analysis
Numerical models
Container drayage
multi-trip multi-trailer drop-and-pull transportation
valid inequality
adaptive large neighborhood search
Journal
IF:
8.4
Papers:
9.5K
Citations:
6.3W