The Sequential Sharing Problem in the Future City Logistics by the Multi - purpose Vehicles : An adaptive large neighbourhood search heuristic and formulations for the multi-depot pick-up and delivery problem with time windows, partial-recharging strategi

Sammanfattning: There are different transportations in the city logistics (e.g., passengers, freights, and wastes), which are handled respectively by single-purpose vehicles (SVs) of the corresponding type. The multi-purpose vehicle (MV) is a future concept whose load modules can be changed for different urban transportations. MVs enable the sequential sharing of different mobilities, thus theoretically improving the efficacy of the city logistics by higher utilization of vehicles. A variant model of the Pick-up and Delivery Problem with Time Windows is established to describe the sequential sharing problem considering both MVs and SVs with the features of multiple depots, partial recharging strategies, and fleet sizing. In the problem, MVs can change their load modules for all types of objects carried by SVs. An adaptive large neighborhood algorithm (ALNS) is developed with new mechanisms for MVs. The proposed ALNS is tested by 15 artificial data cases and compared with the MIP solver. The results show the proposed ALNS is time-effective and validated to find good solutions.