Get 20M+ Full-Text Papers For Less Than $1.50/day. Subscribe now for You or Your Team.

Learn More →

Solving a hybrid mixed fleet heterogeneous dial-a-ride problem in delay-sensitive container transportation

Solving a hybrid mixed fleet heterogeneous dial-a-ride problem in delay-sensitive container... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Production Research Taylor & Francis

Solving a hybrid mixed fleet heterogeneous dial-a-ride problem in delay-sensitive container transportation

Solving a hybrid mixed fleet heterogeneous dial-a-ride problem in delay-sensitive container transportation

International Journal of Production Research , Volume 60 (1): 27 – Jan 2, 2022

Abstract

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.

Loading next page...
 
/lp/taylor-francis/solving-a-hybrid-mixed-fleet-heterogeneous-dial-a-ride-problem-in-OnlZR9FCy3

References (84)

Publisher
Taylor & Francis
Copyright
© 2021 Informa UK Limited, trading as Taylor & Francis Group
ISSN
1366-588X
eISSN
0020-7543
DOI
10.1080/00207543.2021.2000658
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

International Journal of Production ResearchTaylor & Francis

Published: Jan 2, 2022

Keywords: Heterogeneous dial-a-ride problem; full and empty container transportation; green vehicle routing problem; mixed-integer programming; Lagrange relaxation

There are no references for this article.