Review of the Algorithms Used in Electric Vehicle Routing Problems for Last Mile Logistics and Shared Mobility Options
摘要
Vehicle routing problems (VRP) are one of the most widely studied problems in combinatorial optimisation. The Electric VRP (EVRP) is an extension of the VRP that has added constraints due to the restrictions of electric vehicles (EV). Transport emissions amount to around one fifth of global carbon emissions. Electrification of transport provides promising solutions to minimising transport carbon emissions. Both last mile logistics and shared mobility options show promising potential as solutions to reduce transport emissions through electrification. This paper presents a review of the algorithms used in EVRPs in last mile and shared mobility options. The algorithms used to solve these problems are analysed and discussed.