Two-Sided Matching on Comprehensive Transportation Network Emergency Vehicles’ Allocation

Abstract

In emergency rescue, the allocation of comprehensive transportation network emergency vehicles often affects the efficiency of the whole rescue process. In the context of disasters, this paper researches the one-to-many two-sided matching problem between the emergency vehicles and the materials to be transported. Firstly, based on the needs of both parties involved in the matching, the satisfaction evaluation systems are constructed; with the goal of maximizing the weighted satisfaction of the affected areas and vehicles, the optimization model of the materials and emergency vehicles matching is established; then, an improved National Intern Matching Program (NIMP) algorithm is designed to solve the model, which is based on the k: 1 experimental pairing and updating ideas, and can take into account the capacity and destination constraints of vehicles in the matching process. Finally, through the calculation of an example, the matching scheme can make the satisfaction of material transportation reach 0.7392, and the simulation analysis proves that the scheme keeps certain stability in risky conditions.