Solving a hybrid mixed fleet heterogeneous dial-a-ride problem in delay-sensitive container transportation
Sezgi Tekil-Ergün,
Erwin Pesch and
Katarzyna Anna Kuzmicz
International Journal of Production Research, 2022, vol. 60, issue 1, 297-323
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.
Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2021.2000658 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:60:y:2022:i:1:p:297-323
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20
DOI: 10.1080/00207543.2021.2000658
Access Statistics for this article
International Journal of Production Research is currently edited by Professor A. Dolgui
More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().