摘要
海上搜寻工作是海上搜救过程中的重要环节,为使得在最短时间内,以最少的船舶资源完成对给定海域的搜寻覆盖任务,研究目标在概率分布不同的多个子海域上的搜寻船舶分配问题。研究是根据目标在各子海域内的概率分布情况、船舶到达各子海域的时间及船舶搜寻能力等参数特征,构建以完成各子海域搜寻覆盖的时间期望总和最小为目标的船舶分配模型。针对模型涉及的相关参数特征,设计基于优先队列算法实现其模型的求解,并利用遗传优化算法找出最优解。研究结果表明:该模型在所设计的算法上实现了为概率分布不同的多个子海域分配合理的搜寻船舶,为决策者在第一时间做出高效、合理、科学的搜寻船舶分配方案提供依据。
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.
作者
王军
杨春林
王美蓉
WANG Jun;YANG Chunlin;WANG Meirong(College of Transportation Engineering,Dalian Maritime University,Dalian 116026,Liaoning,China)
出处
《重庆交通大学学报（自然科学版）》
CAS
CSCD
北大核心
2022年第3期18-24,共7页
Journal of Chongqing Jiaotong University(Natural Science)
关键词
交通运输工程
船舶分配
子海域
概率
时间期望
优先队列算法
遗传算法
traffic and transportation engineering
distribution of vessel
sub-area
probability
time expectation
priority queue algorithm
genetic algorithm(GA)
