期刊文献+

一种新的ASON保护容量优化算法

Novel Algorithm to Optimize the Assignment of Protection Capacity for ASON
下载PDF
导出
摘要 针对ASON网络保护容量问题,建立了相应的数学模型,并提出一种基于分布估计的保护容量优化算法.与传统保护容量算法相比,该算法在可行解搜索空间及计算量上大大降低,为算法在工程上的实现提供了可行性.仿真实验结果表明,提出的新算法搜索效率高、求解速度快且能够获得高质量的全局近似最优解,具有较强的实用性. In order to solve the problem of ASON protection capacity assignment,the corresponding mathematical model is established,and a new optimization algorithm based on estimation of distribution algorithm is presented.Compared with liner programming optimization method,this algorithm reduces the calculation work significantly,which facilitates the application of algorithm on projects.Simulation results show that the near global optimal solution can be easily obtained and the solution is definitely satisfactory in engineering.
出处 《小型微型计算机系统》 CSCD 北大核心 2010年第8期1587-1589,共3页 Journal of Chinese Computer Systems
关键词 ASON 网络生存性 保护容量 分布估计算法 ASON network survivability protection capacity estimation of distribution
  • 相关文献

参考文献6

  • 1Caenegem B ,Parys W,Turck F,et al. Demensioning of survivable WDM networks [J]. IEEE J. Sel. Areas in Commun., Sep 1998,16:1146-1157.
  • 2Ramamurthy S, Sabasrabuddhe L, Mukherjee B. Survivable WDM mesh networks[J]. Journal of Lightwave Technology, Sep 1998, 21:870-883.
  • 3王志文,夏秦,李增智,李平均.WDM网络保护容量问题的遗传算法求解[J].光子学报,2002,31(11):1357-1362. 被引量:2
  • 4Larranaga P, Lozano J A. Estimation of distribution algorithms: a new tool for evolutionary computation[ M]. Norwell, MA: Kluwer, 2002.
  • 5周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:209
  • 6Baluja S. Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning [ R]. Technical Report CMU-CS-94-163, Pittsburgh, PA: Carnegie Mellon University, 1994.

二级参考文献91

  • 1叶大振,吴新余.计算机通信网中路由选择和容量分配问题的遗传算法求解[J].电子学报,1996,24(12):75-78. 被引量:13
  • 2Shapiro J L. Drift and scaling in estimation of distribution algorithms. Evolutionary Computation, 2005, 13(1):99-123
  • 3Zhang Q, Miihlenbein H. On the convergence of a class of estimation of distribution algorithms. IEEE Transactions on Evolutionary Computation, 2004, 8(2): 127-136
  • 4Zhang Q. On the convergence of a factorized distribution algorithm with truncation selection[Online], available: http://cswww.essex.ac.uk/staff/zhang/EDAWEB/,May 10, 2006
  • 5Zhang Q. On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm. IEEE Transactions on Evolutionary Computation, 2004, 8(1): 80-93
  • 6Rastegax R, Meybodi M Ft. A study on the global convergence time complexity of estimation of distribution algorithms. Lecture Notes in Computer Science, 2005, 3641:441-450
  • 7Gao Y, Culberson J. Space complexity of estimation of distribution algorithms. Evolutionary Computation, 2005,13(1): 125-143
  • 8Pelikan M, Sastry K, Goldberg D E. Scalability of the Bayesian optimization algorithm. International Journal of Approximate Reasoning, 2002, 31(3): 221-258
  • 9Muhlenbein H, HSns R. The estimation of distributions and the minimum relative entropy principle. Evolutionary Computation, 2005, 13(1): 1-27
  • 10Roberto S. Estimation of distribution algorithms with Kikuchi approximations. Evolutionary Computation, 2005,13(1): 67-97

共引文献209

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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