Abstract: In view of the urgency of the maritime search mission and the different probability distribution of the target in the sea area to be searched, the sea area to be searched was divided into several sub-areas according to the probability distribution, and the probability distribution of the target in different sea areas was also studied. Considering that the probability of different location of the target in the sea area was different, so the ships search priority for each sub-area was different, the optimal selection problem of dispatching ships to multiple regions was studied. The maritime search ship selection optimization model with the minimum expected time of each sub-region to finish the search was proposed, which fully considered the search ability and maximum speed of the search ship, the initial distance from each sub region and other factors, and designed the algorithm. The effectiveness of the proposed model was verified by an example. The research results show that: considering the probability of different sub-areas, choosing the right ship and designating the search ship to rush to the right sub-area can save the search task completion time.

Key words: traffic and transportation engineering, sub-area, probability, time expectation, search ship

摘要： 鉴于海上搜寻任务时间紧迫及目标在待搜寻海域内的概率分布不同的特点，根据概率分布将待搜寻海域划定为若干个子区域，并对目标在不同海域的概率分布进行研究。考虑到目标在海域内不同位置概率不同，故各子区域对优质搜寻资源的调用优先级不同，研究了向多个区域派遣船舶的最优选择问题；构建了以各子区域搜寻完毕的时间期望总和最小为目标的海上搜寻船舶选择优化模型，该模型充分考虑到搜寻船舶的搜寻能力、最大航速、距各子区域初始距离等因素；并设计算法通过引入算例验证了该模型的有效性。研究结果表明：在考虑不同子区域的概率基础上来选择合适的船舶，指定搜寻船舶赶往合适的子区域，能够节省搜寻任务完成时间。

关键词: 交通运输工程, 子区域, 概率, 时间期望, 搜寻船舶