期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
多业务CDMA网络参数优化模型与算法
1
作者 施永贵 王洪峰 +1 位作者 唐加福 何晶晶 《信息与控制》 CSCD 北大核心 2012年第4期499-503,共5页
在考虑覆盖率、软切换率、业务信道拥塞率和功率损耗等网络质量指标的基础上,建立多业务CDMA网络参数优化问题的数学模型.通过分析模型的特点,设计了一种基于约束优化遗传算法(COGA)的求解方法,并给出了算法实现的各种关键技术.对一个... 在考虑覆盖率、软切换率、业务信道拥塞率和功率损耗等网络质量指标的基础上,建立多业务CDMA网络参数优化问题的数学模型.通过分析模型的特点,设计了一种基于约束优化遗传算法(COGA)的求解方法,并给出了算法实现的各种关键技术.对一个实际算例进行实验研究,仿真结果表明算法能够有效地配置各种网络参数,网络性能得到提升,优于实际DT(driver test)的优化效果,从而表明所建模型和算法能够为多业务CDMA网络参数优化问题提供快速的解决方案,有效地指导实际的网络管理工作. 展开更多
关键词 CDMA网络 多业务 参数优化 约束优化遗传算法
原文传递
A DERIVATIVE-FREE ALGORITHM FOR UNCONSTRAINED OPTIMIZATION 被引量:1
2
作者 Peng Yehui Liu Zhenhai 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2005年第4期491-498,共8页
In this paper a hybrid algorithm which combines the pattern search method and the genetic algorithm for unconstrained optimization is presented. The algorithm is a deterministic pattern search algorithm,but in the sea... In this paper a hybrid algorithm which combines the pattern search method and the genetic algorithm for unconstrained optimization is presented. The algorithm is a deterministic pattern search algorithm,but in the search step of pattern search algorithm,the trial points are produced by a way like the genetic algorithm. At each iterate, by reduplication,crossover and mutation, a finite set of points can be used. In theory,the algorithm is globally convergent. The most stir is the numerical results showing that it can find the global minimizer for some problems ,which other pattern search algorithms don't bear. 展开更多
关键词 unconstrained optimization pattern search method genetic algorithm global minimizer.
下载PDF
Network coding resources optimization with transmission delay constraint in multicast networks 被引量:2
3
作者 曲志坚 Fu Jia +1 位作者 Liu Xiaohong Li Caihong 《High Technology Letters》 EI CAS 2017年第1期30-37,共8页
Minimizing network coding resources of multicast networks,such as the number of coding nodes or links,has been proved to be NP-hard,and taking propagation delay into account makes the problem more complicated. To reso... Minimizing network coding resources of multicast networks,such as the number of coding nodes or links,has been proved to be NP-hard,and taking propagation delay into account makes the problem more complicated. To resolve this optimal problem,an integer encoding routing-based genetic algorithm( REGA) is presented to map the optimization problem into a genetic algorithm( GA)framework. Moreover,to speed up the search process of the algorithm,an efficient local search procedure which can reduce the searching space size is designed for searching the feasible solution.Compared with the binary link state encoding representation genetic algorithm( BLSGA),the chromosome length of REGA is shorter and just depends on the number of sinks. Simulation results show the advantages of the algorithm in terms of getting the optimal solution and algorithmic convergence speed. 展开更多
关键词 network coding genetic algorithm (GA) search space muhicast network
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部