Research on Collaborative Task Planning Method for Split Delivery Vehicle Routing Problem

In order to solve the problem of post disaster collaborative rescue of multiple unmanned vehicles, a task planning model is designed for vehicle routing with nonlinear costs and decomposable demands. The model considers the deteriorating health condition of the awaiting victims over time and the ability of multiple vehicles to participate in the rescue. The paper proposes a hybrid heuristic algorithm that combines variable neighborhood search and tabu search to solve the problem efficiently. In the framework of the variable neighborhood search algorithm, the approach utilizes a mixed neighborhood structure to expand the search space. Additionally, a tabu table mechanism is introduced to mitigate the issue of repetitive searches in variable neighborhood searches, preventing the algorithm from getting trapped in local optima. This augmentation enhances the algorithm's optimization capabilities. The results of simulation experiments verify the feasibility and progressiveness of the algorithm.