期刊文献+

基于均值聚类的KMCPSO舰载机出库调度算法 被引量:1

The KMCPSO Aircraft Carrier Outbound Schedule Optimization Based On Mean Clustering
下载PDF
导出
摘要 航母舰载机的出库调度效率,在很大程度上决定了整个航母的战斗力生成。通过研究K均值聚类算法的基本原理,提出基于均值聚类的KMCPSO舰载机出库调度算法。该算法针对粒子群算法在进化过程中易出现早熟和寻优结果不稳定的缺陷,通过在迭代过程对种群进行分群,以提高种群多样性,从而克服原算法的不足。基于俄罗斯“库兹涅佐夫”号航母舰载机出库任务,建立舰载机调度模型,并用KMCPSO算法进行求解。结果表明,KMCPSO算法能克服上述缺陷,模型有较好的应用价值。 The combat effectiveness of aircraft carrier is largely determined by the Outbound- Scheduling efficiency of the air-craft. After researching the basic principle of K-Means cluster Optimization,the KMCPSO Aircraft Outbound Schedule Optimization has been put forward based on it.The shortcomes of Particle Swarm Optimization have been solved in the evolutionary process of the new Optimization,such as Proning to premature,the optimization result is not stable.The population diversity has been enhanced by dividing populations in the Optimization. The Aircraft scheduling model has been established based on the outbound task of the aircraft carrier "admiral kuznetsov" in Russia. The model is solved by the K-Means Cluster Particle Swarm Optimization. The results show that the optimization can solvel the above defects and the model has good application value.
作者 彭业飞 张维继 邵明臣 冯智鑫 PENG Ye-fei, ZHANG Wei-ji, SHAO Ming-chen, FENG Zhi-xin (Naval University of Engineering, Wuhan 430033, China)
出处 《电脑知识与技术》 2016年第1期9-12,共4页 Computer Knowledge and Technology
关键词 舰载机 出库调度 均值聚类 粒子群 种群多样性 Aircraft Carrier Outbound Schedule Means Cluster Particle Swarm population diversity
  • 相关文献

参考文献4

二级参考文献39

  • 1王来军,史忠科,雷秀娟.Dynamic Tabu Search Algorithm for Solving Departure Scheduling Problem[J].Journal of Southwest Jiaotong University(English Edition),2007,15(2):132-137. 被引量:1
  • 2Maegegor M H,Grover W D.OPtimized k-shortest paths algorithm for faeitity restoration.Software Praetice and Experienee,1994,24(9); 823-828.
  • 3Eppstein D.Finding the k shortest paths.SIAM Joumal on ComPuting,1999;28(2):652-673.
  • 4Liu K G,*Prune Ramakrishnan K G.algorithm for finding K shortest paths subject to multiple constraints.In:Proeeeding sof the INFO-COM 2001 Confereee,IEEE,Anehorage,Alaska,2001;743-749.
  • 5Hershberger J,Maxely M,Suriz S.Finding the K shortest paths:A new algorithm and implementation.ALENEX Baltimore,2003.
  • 6Adams J, Balas E, Zawack D. The shifting bottleneck procedure for job shop scheduling [J]. Management Science, 1988, 34:391-401.
  • 7Kolonko M. Some new results on simulated annealing applied to the job shop scheduling problem [J].European Journal of Operational Research, 1999,113:123-136.
  • 8Pezzella F, Merelli E. A tabu search method guided by shifting bottleneck for the job shop scheduling problem [ J ]. European Journal of Operational Research, 2000, 120:297-310.
  • 9Aiex R M, Binato S, Resende M G C. Parallel GRASP with path-relinking for job shop scheduling [J]. Parallel Computing, 2003, 29: 393-430.
  • 10Shi Y, Eberhart R. Empirical study of particle swarm optimization [A]. Proceedings of Congress on Evolutionary Computation [C]. Washington DC, USA:[s.n.], 1999, 3:1945-1950.

共引文献57

同被引文献6

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部