摘要
针对战时侦察路径选取存在盲目性和随意性缺点,研究了侦察路径的优化选取问题;建立了侦察路径优化的数学模型;利用AHP对侦察路径选取问题各个因素量化归一;基于遗传算法,设计了自然数编码方式,提出了对初始种群进行判断处理,针对侦察时间的限制加入了惩罚系数;最后利用Matlab进行了编程实验,验证了模型和算法的有效性,能够为战时提供迅速有效的侦察路径选取指导。
To solve the blindness and random of scout routing during the wartime,the problem of scout routing optimizing is studied.The model of this problem is constructed.The factors of this problem are evaluated in number and treated unitarily in analytic hierarchy process.Based on genetic algorithms,the coding is designed in natural number and initial chromosome are predisposed with estimate matrix.Punishment coefficient is introduced in order to satisfy the restriction of time.Finally,some in Matlab experiments show that the models and algorithms are effective,and offer some guidance about speedy and effective patrol's routing in wartime.
出处
《控制工程》
CSCD
北大核心
2009年第S1期76-79,共4页
Control Engineering of China
关键词
侦察分队
路径优化
遗传算法
层次分析法
多目标决策
scout unit
routing optimizing
genetic algorithms
analytic hierarchy process
multi-objective decision making
