Solving a hybrid mixed fleet heterogeneous dial-a-ride problem in delay-sensitive container transportation
- The intensity of local truck container transport results from the ubiquitous development of container shipping. Optimal routing of container trucks contributes to cost savings of the service provider but also the reduction of traffic and detrimental emissions. In this paper, a variant of a Mixed Fleet Heterogeneous Dial-a-Ride Problem is proposed for a container truck routing problem. Our aim is an optimal routing of trucks carrying full and empty 20-foot and 40-foot containers, with multiple pick-ups and deliveries. Transportation is performed by alternatively fuelled vehicles (AFVs) for environmental reasons. The AFVs have a limited driving range and are allowed to refuel in any alternative fuel station. The main objective is minimising the total distance subject to matching the empty container demand and supply, necessary refuelling of the trucks, and service time windows.
Document Type: | Article |
---|---|
Language: | English |
Author: | Erwin Pesch, Sezgi Tekil-Ergün, Katarzyna Anna Kuzmicz |
Center: | Center for Advanced Studies in Management (CASiM) |
DOI: | https://doi.org/10.1080/00207543.2021.2000658 |
Parent Title (English): | International journal of production research |
ISSN: | 0020-7543 |
Volume: | 60 |
Issue: | 1 |
Year of Completion: | 2021 |
First Page: | 297 |
Last Page: | 323 |
Tag: | Full and empty container transportation; Green vehicle routing problem; Heterogeneous dial-a-ride problem; Lagrange relaxation; Mixed-integer programming |
Content Focus: | Academic Audience |
Peer Reviewed: | Yes |
Rankings: | AJG Ranking / 3 |
VHB Ranking / B | |
SJR Ranking / Q1 | |
Licence (German): | ![]() |