LAUSR

The vehicle rescue process for individuals in residential areas in disaster scenarios is a typical vehicle routing problem (VRP). However, most studies do not consider the factor of individual mobility. In residential areas, there are two types of individuals: individuals with high mobility and individuals with low mobility, such as the elderly. To improve the evacuation efficiency, besides ordinary vehicles, special vehicles equipped with wheelchairs and volunteers are also in great need. Thus, evacuation vehicles should consist of a heterogeneous fleet. Vehicles depart from parking lots, arrive at residential areas to pick up individuals, and then transport them to shelters. In other words, the origin and destination are different, but they are viewed as the same in classical VRP. Each residential area can be served directly by vehicles departing from parking lots or by vehicles that have already served others, which means demands can be split. All these make the VRP in emergency rescue more complicated than classical VRP. Therefore, we propose an integer liner program model – multi-parking lot and shelter heterogeneous vehicle routing problem with split pickup (MPSHVRPSP) model, which includes matching constraints of individuals and vehicles to satisfy the demands of different types of individuals, and considers the selectivity of parking lots and shelters too. We provide a Tabu Search (TS) algorithm with diversification strategy to solve the model and ensure the high quality of solution. A lot of experiments are carried out on various instances. Our results show that MPSHVRPSP can be applied to efficient evacuation of complicated scenarios that satisfies the demands of all individuals in residential areas. Besides, it is more reasonable compared with classical VRP, and TS can also obtain a satisfactory solution in less time. Furthermore, sensitivity analysis is conducted on factors that may affect the result of objective function.