| 基于启发式算法的复杂军事网络路径优化 |
| |
| 引用本文： | 陈晔,赵金超,张勇明. 基于启发式算法的复杂军事网络路径优化[J]. 火力与指挥控制, 2012, 37(5): 172-174 |
| |
| 作者姓名： | 陈晔 赵金超 张勇明 |
| |
| 作者单位： | 海军工程大学,武汉,430033 |
| |
| 摘 要： | 使用一种启发式算法,使得复杂网络中最大介数最小化,可以达到接近最优化的路径,以改善复杂网络的信息容量。针对海上编队作战系统复杂网络的平均介数、最大介数与网络大小、迭代次数、介数分布情况的仿真发现,复杂网络容量超出比对文献中理论预测的最大值,这对于解决复杂军事网络的拥塞,提高复杂军事网络容量和作战效能重大意义。
|
| 关 键 词： | 复杂军事网络 启发式算法 路径优化 介数 |
Routing Optimization of the Complex Military Networks Based on the Heuristic Algorithm |
| |
| CHEN Ye , ZHAO Jin-chao , ZHANG Yong-ming. Routing Optimization of the Complex Military Networks Based on the Heuristic Algorithm[J]. Fire Control & Command Control, 2012, 37(5): 172-174 |
| |
| Authors: | CHEN Ye ZHAO Jin-chao ZHANG Yong-ming |
| |
| Affiliation: | (Naval Univ.of Engineering,Wuhan 430033,China) |
| |
| Abstract: | The article presents the heuristic algorithm,which can minimize the maximum node betweenness,achieve nealy optimal routing in the complex military networks to improve the information capacity of the network.The paper analyzes the maximum and average betweenness and network nodes、the number of iterations,distribution of node betweennesses in the navy fleet combat system,in the results show that complex information capacity exceeds for its maximum value of the analytical estimate given in the compared article.It is useful to solve the jamming of the complex military network,increase the capacity of the military network and enhance its operational efficiency. |
| |
| Keywords: | complex military network heuristic algorithm routing optimization betweenness |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
