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.