A Lamarckian Hybrid Grouping Genetic Algorithm with repair heuristics for resource assignment in WCDMA networks

详细信息    查看全文

• 作者：L. Cuadra^a ; A. Aybar-Ruí ; z^a ; M.A. del Arco^a ; J. Naví ; o-Marco^b ; J.A. Portilla-Figueras^a ; S. Salcedo-Sanz^a ; ^{sancho.salcedo@uah.es" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Lamarckian Hybrid Grouping Genetic Algorithm ; WCDMA networks ; Resource assignment
• 刊名：Applied Soft Computing
• 出版年：2016
• 出版时间：June 2016
• 年：2016
• 卷：43
• 期：Complete
• 页码：619-632
• 全文大小：3034 K

文摘

In this paper we propose a novel Lamarckian Hybrid Grouping Genetic Algorithm (LHGGA) with repair heuristics for a problem of resources assignment to mobile terminals (or, simply, users) in Wide-band Code Division Multiple Access (WCDMA) networks. We propose a novel problem formulation that takes into account all the interference terms, which strongly depend on the assignment to be done. The second contribution is a cost function (to be minimized) with weighted components, which is composed of not only the load factors (including the mentioned interference terms) but also other utilization ratios for aggregate capacity, codes, power, and users without service. The second group of contributions is related to the LHGGA approach. On the one hand, we propose a novel encoding scheme, suitable for the novel problem formulation. On the other hand, we present fully tailored operators. We emphasize the proposal of a repair operator of unphysical candidates (which are substituted by their repaired versions), and a crossover operator, able to acts on groups (users assigned to a base station) in a very efficient way. The proposed LHGGA exhibits a superior performance than that of the conventional method, since most of users receive the demanded services along with a more efficient use of resources per user. The LHGGA approach has been successfully applied to a variety of scenarios: different number of users, distributions, or users profiles.