Method of task allocation of tactical communication support based on improved particle swarm optimization algorithm

被引：0
|
作者：
Hua N. [1 ]
Zhao Y.-L. [1 ]
Yu Z.-H. [1 ]
机构：
[1] College of Information and Navigation, Air Force Engineering University, Xi'an
来源：
Kongzhi yu Juece/Control and Decision | 2018年 / 33卷 / 09期
关键词：
Allocation probability; PSO; Tactical communication support; Task allocation; Twice search;
D O I：
10.13195/j.kzyjc.2017.0537
中图分类号：
学科分类号：
摘要：
For solving the problem of tactical communication support, a task allocation model is established, and a twice search particle swarm optimization(TSPSO) algorithm based on gradient descent is proposed. There are four parts added into the TSPSO algorithm, including determination of the extremum trap, particle twices search, set forbidden area, particle elimination and generated. The TSPSO algorithm and other four improved algorithms are applied to the optimization problem of four typical test functions. The results show that, the convergence accuracy of the TSPSO algorithm is higher, the convergence speed is faster. In the solution of the task allocation model, the probability distribution of the support units to communication places is used to encode and decode the particle swarm. The simulation results show that the proposed algorithm can quickly find the optimal allocation scheme of tactical communication support tasks. © 2018, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码：1575 / 1583
页数：8
相关论文
共 20 条
  • [1] Xia J., Pang Z.B., Zhang J., A 0-1 integer programming based approach for global data distribution, J of National University of Defense Technology, 31, 4, pp. 62-67, (2009)
  • [2] Li H., Jiao Y.C., Zhang L., Hybrid evolutionary algorithm for mixed-integer programming problems, Control and Decision, 23, 10, pp. 1098-1102, (2008)
  • [3] Wang H., Wei J.H., Liu C.J., A novel adaptive stochastic search algorithm based on group founding and joining behaviors, J of Xi'an Jiaotong University, 47, 12, pp. 43-49, (2013)
  • [4] Jia L.P., Wang Y.P., Fan L., An improved uniform design-based genetic algorithm for multi-objective bilevel convex programming, Int J Computation Science and Engineering, 12, 1, pp. 38-46, (2016)
  • [5] Ben M., Patricia R., Cameron S., Evaluating the seeding genetic algorithm, Lecture Notes in Computer Science, 8272, 1, pp. 228-233, (2013)
  • [6] Fang L., Zhan J., Xu X.Y., Energy saving management system of distribution network based on multi-agent genetic algorithm, J of Hu'nan University:Natural Science, 43, 4, pp. 105-112, (2016)
  • [7] Liao T.J., Thomas S., A unied ant colony optimization algorithm for continuous optimization, European J of Operational Research, 234, 3, pp. 597-609, (2014)
  • [8] Ma R.G., Cui H., Xue S.J., Improved ant colony algorithm for the optimal-quality-path routing problem with multi-constraints, J of Xidian University:Natural Science, 43, 3, pp. 185-189, (2016)
  • [9] Wang S.S., Yang J.J., Chai S., Artificial bee colony algorithm with chaotic catfish effect and its application, Acta Electronica Sinica, 42, 9, pp. 1731-1737, (2014)
  • [10] Kennedy J., Eberhart R., Particle swarm optimization, Proc of the 4th Int Conf on Neural Networks, pp. 1942-1948, (1995)
12