解决移动计算位置管理的离散差分进化算法

计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (12): 113-117.

解决移动计算位置管理的离散差分进化算法

王文宏¹,王凤蕊²,潘全科¹

1.聊城大学计算机学院，山东聊城 252059
2.聊城大学教育传播技术学院，山东聊城 252059

收稿日期:2007-12-13 修回日期:2008-02-25 出版日期:2008-04-21 发布日期:2008-04-21
通讯作者: 王文宏

New discrete differential evolution algorithm for location management problem of mobile computing

WANG Wen-hong¹,WANG Feng-rui²,PAN Quan-ke¹

1.School of Computer Science，Liaocheng University，Liaocheng，Shandong 252059，China
2.School of Educational Technology and Massmedium，Liaocheng University，Liaocheng，Shandong 252059，China

Received:2007-12-13 Revised:2008-02-25 Online:2008-04-21 Published:2008-04-21
Contact: WANG Wen-hong

摘要/Abstract

摘要： 位置管理问题是移动计算环境中的一个重要问题。提出了一种解决位置管理问题的离散差分进化算法，给出了种群的离散编码方法和一种新的变异操作机制，提出了基于问题特性的种群初始化启发式方法，以及早熟收敛问题的解决策略。基于随机生成的数据对算法进行了模拟实验，将该算法的结果与遗传算法、禁忌搜索算法及蚁群算法进行了对比。

关键词: 移动计算, 移动网络, 位置管理, 离散差分进化算法, 种群初始化, 早熟收敛, 优化, ,

Abstract: Location management is an important problem in mobile computing environment.A discrete differential evolution algorithm for location management problem was proposed.A discrete coding method for population individuals and a new mutation operation were put forward.An effective heuristic population initialization technology based on problem characteristic and solutions to overcome the premature convergence problem of the algorithm were studied.The proposed algorithm was simulated with random produced input data.The experiment result of the proposed algorithm was compared with the results of Genetic Algorithm，Tabu Search Algorithm and Ant Colony Algorithm.

Key words: mobile computing, mobile network, location management, discrete differential evolution algorithm, population initialization, premature convergence, optimization

王文宏¹,王凤蕊²,潘全科¹. 解决移动计算位置管理的离散差分进化算法[J]. 计算机工程与应用, 2008, 44(12): 113-117.

WANG Wen-hong¹,WANG Feng-rui²,PAN Quan-ke¹. New discrete differential evolution algorithm for location management problem of mobile computing[J]. Computer Engineering and Applications, 2008, 44(12): 113-117.