期刊文献+

光网络流量工程优化计算的适应度函数研究 被引量:1

Research on Fitness Function of Traffic Engineering Optimum Calculation in Optical Networks
在线阅读 下载PDF
导出
摘要 研究了光网络流量工程优化计算中的适应度函数,其实质是为相互制约的多个单目标寻找一个合理的综合评价的数学表达式。使用了主分量分析的方法,该方法可以消除多个单目标之间的相互制约的关系、信息重叠以及量纲的差异,可以计算出综合评价的有效的数学表达式。仿真试验表明,该方法是可行的。 This paper focuses on the fitness function of traffic engineering optimum calculation in optical networks, whose essential is to find a reasonable mathematical expression of comprehensive estimation for many interrestrictive single objects. Principal Component Analysis is used, which can eliminate the interrestriction of the object, clear up the information superposition, and avoid the difference of dimension, to obtain the efficient mathematical expression of comprehensive estimation. Simulation testifies the feasibility of this novel method.
出处 《计算机应用》 CSCD 北大核心 2004年第2期41-43,共3页 journal of Computer Applications
关键词 光网络 流量工程 适应度函数 主分量 optical networks traffic engineering fitness function principal component anlysis
  • 相关文献

参考文献6

二级参考文献26

  • 1唐焕文,张立卫,王雪华.一类约束不可微优化问题的极大熵方法[J].计算数学,1993,15(3):268-275. 被引量:75
  • 2王雪华,秦学志.多目标规划的极大熵方法[J].计算数学,1996,18(3):305-308. 被引量:21
  • 3韦乐平.光同步数字传送网[M].北京:人民邮电出版社,1998..
  • 4Cormen TH Leiserson CE Rive8 RL.算法导论(英文版)[M].北京:高等教育出版社,2002..
  • 5[1]Oja E. A simplified neuron model as a principal component analyzer. J Math Biol, 1982, 15:267 ~ 273
  • 6[2]Oja E. Principal components, minor components, and linear neural networks. Neural Networks, 1992, 5:927 ~ 935
  • 7[3]Diamantaras K I, Kung S Y. Principal Component Networks-Theory and Applications. New York: Wiley, 1996
  • 8[4]Yang B. Projection approximation subspace tracking. IEEE Trans Signal Processing, 1995, 43(1): 95 ~ 107
  • 9[5]Golub G H, Van Loan C F. Matrix Computations. 2nd edition. MD: Johns Hopkins University Press, 1989
  • 10[6]Sanger T D. Optimal unsupervised learning in a single-layer linear feedforward neural network. Neural Networks, 1989, 2:459 ~ 473

共引文献29

同被引文献9

  • 1许向勇,殷红成,李春雷,韦笑.无定向拓扑连接的并行遗传算法及其变异算子改进[J].系统工程与电子技术,2005,27(5):900-905. 被引量:1
  • 2DE Jong.An analysis of the behavior of a class of genetic adaptive systems[D].USA:The University of Michigan,1975.
  • 3GREFENSTETTE J.Optimization of control parameters for genetic algorithms[J].IEEE Transactions on Systems,Man and Cybernetics,1986,16 (1):122-128.
  • 4GOLDBERG D E.Sizing populations for sserial and parallel genetic algorithms[C]//.Schaffer J.Proceedings of the Third International Conference on Genetic Algorithms.Los Angles,USA:Morgan Kaufmann Publishers,1989.
  • 5DAVIS L D.Adapting operator probabilities in genetic algorithms[C]//.Schaffer J.Proceedings of the Third International Conference on Genetic Algorithms.Los Angles,USA:Morgan Kaufmann Publishers,1989.
  • 6DAVIS L D.Handbook of genetic algorithms[M].New York:Van Nostrand Reinhold,1991.
  • 7REEVES C R.A genetic algorithm for flowshop sequencing[J].Computers and Ops Res.,1995,22(1):5-13.
  • 8SRINIVAS M P,ATNAIK L M.Adaptive probabilities of crossover and mutation in genetic algorithms[J].IEEE Transactions on Systems,Man and Cybernetics,1994,24 (4):656-667.
  • 9周明,孙树栋.遗传算法原理及其应用[M].北京:国防工业出版社,2004.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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