关键词: 交通运输工程；船舶分配；子海域；概率；时间期望；优先队列算法；遗传算法

Abstract: Maritime search is an important part in the process of maritime search and rescue (SAR). In order to complete the search and cover task in a given sea area with the least vessel resources in the shortest time, the allocation of search vessels in multiple sub-sea areas with different probability distributions was studied. According to the probability distribution of the target in each sub-sea area, the time when the ship arrived in each sub-sea area, the ship search ability and other parameter characteristics, a ship allocation model was constructed with the goal of minimizing the expected sum of time to complete the search coverage of each sub-sea area. According to the characteristics of relevant parameters involved in the proposed model, a priority queue algorithm was designed to solve the model, and the genetic optimization algorithm was used to find the optimal solution. The research results show that the proposed model can allocate reasonable search vessels for multiple sub-sea areas with different probability distribution based on the algorithm, and make efficient, reasonable and scientific search vessel allocation scheme for decision makers in the first time.

Key words: traffic and transportation engineering; distribution of vessel; sub-area; probability; time expectation; priority queue algorithm; genetic algorithm (GA)