作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (21): 133-135. doi: 10.3969/j.issn.1000-3428.2011.21.045

• 人工智能及识别技术 • 上一篇    下一篇

基于混洗蛙跳算法的频率分配方法

何 迪1,贾振红1,覃锡忠1,常 春2,王 浩2   

  1. (1. 新疆大学信息科学与工程学院,乌鲁木齐 830046;2. 中国移动新疆分公司,乌鲁木齐 830063)
  • 收稿日期:2011-04-23 出版日期:2011-11-05 发布日期:2011-11-05
  • 作者简介:何 迪(1986-),男,硕士研究生,主研方向:移动通信,人工智能;贾振红,教授、博士生导师;覃锡忠,副教授;常 春、王 浩,高级工程师
  • 基金资助:
    中国移动新疆分公司研究发展基金资助项目

Frequency Allocation Approach Based on Shuffled Frog-leaping Algorithm

HE Di 1, JIA Zhen-hong 1, QIN Xi-zhong 1, CHANG Chun 2, WANG Hao 2   

  1. (1. Institute of Information Science and Engineering, Xinjiang University, Urumqi 830046, China; 2. Xinjiang Mobile Communication Company, Urumqi 830063, China)
  • Received:2011-04-23 Online:2011-11-05 Published:2011-11-05

摘要: 为提高蜂窝移动通信系统的频谱利用率,提出一种基于混洗蛙跳算法的频率分配方法。采用改进的最小间隔编码机制和选择性变异技术,加强全局最小搜索能力并提高算法收敛效率。实验结果表明,与微正则退火算法相比,该方法在频率分配问题上的搜索能力更强,在21小区系统中,能使可用频率数目从70个降至51个。

关键词: 混洗蛙跳算法, 固定信道分配, 组合优化, 共地约束, 邻信道约束

Abstract: In order to utilize the available frequencies efficiently in cellular mobile communication network, this paper proposes a frequency allocation approach based on Shuffled Frog-leaping Algorithm(SFLA). The improved minimum separation encoding scheme and selective mutation technique are put forward. It can take good advantage of the mutation to search the global minimum and enhance the convergence rate. Experimental results indicate that, compared with microcanonical annealing algorithm, the proposed approach has more powerful search capability in frequency allocation. In the 21-cell cellular network, the number of available frequencies are reduced to 51 from 70.

Key words: Shuffled Frog-leaping Algorithm(SFLA), Fixed Channel Allocation(FCA), combinatorial optimization, Co-site Constraint(CSC), Adjacent Channel Constraint(ACC)

中图分类号: