TY - GEN
T1 - A grouping harmony search algorithm for assigning resources to users in WCDMA mobile networks
AU - Aybar-Ruiz, Adrian
AU - Cuadra, Lucas
AU - Del Ser, Javier
AU - Portilla-Figueras, Jose Antonio
AU - Salcedo-Sanz, Sancho
N1 - Publisher Copyright:
© Springer Nature Singapore Pte Ltd. 2017.
PY - 2017
Y1 - 2017
N2 - This paper explores the feasibility of a particular implementation of a Grouping Harmony Search (GHS) algorithm to assign resources (codes, aggregate capacity, power) to users in Wide-band Code Division Multiple Access (WCDMA) networks. We use a problem formulation that takes into account a detailed modeling of loads factors, including all the interference terms, which strongly depend on the assignment to be done. The GHS algorithm aims at minimizing a weighted cost function, which is composed of not only the detailed load factors but also resource utilization ratios (for aggregate capacity, codes, power), and the fraction of users without service. The proposed GHS is based on a particular encoding scheme (suitable for the problem formulation) and tailored Harmony Memory Considering Rate and Pitch Adjusting Rate processes. The experimental work shows that the proposed GHS algorithm exhibits a superior performance than that of the conventional approach, which minimizes only the load factors.
AB - This paper explores the feasibility of a particular implementation of a Grouping Harmony Search (GHS) algorithm to assign resources (codes, aggregate capacity, power) to users in Wide-band Code Division Multiple Access (WCDMA) networks. We use a problem formulation that takes into account a detailed modeling of loads factors, including all the interference terms, which strongly depend on the assignment to be done. The GHS algorithm aims at minimizing a weighted cost function, which is composed of not only the detailed load factors but also resource utilization ratios (for aggregate capacity, codes, power), and the fraction of users without service. The proposed GHS is based on a particular encoding scheme (suitable for the problem formulation) and tailored Harmony Memory Considering Rate and Pitch Adjusting Rate processes. The experimental work shows that the proposed GHS algorithm exhibits a superior performance than that of the conventional approach, which minimizes only the load factors.
KW - Grouping harmony Search
KW - Harmony search
KW - Wide-band code division multiple access mobile networks
UR - https://www.scopus.com/pages/publications/85012159903
U2 - 10.1007/978-981-10-3728-3_19
DO - 10.1007/978-981-10-3728-3_19
M3 - Conference contribution
AN - SCOPUS:85012159903
SN - 9789811037276
T3 - Advances in Intelligent Systems and Computing
SP - 190
EP - 199
BT - Harmony Search Algorithm - Proceedings of the 3rd International Conference on Harmony Search Algorithm (ICHSA 2017)
A2 - Del Ser, Javier
PB - Springer Verlag
T2 - Proceedings of the 3rd International Conference on Harmony Search Algorithm, ICHSA 2017
Y2 - 22 February 2017 through 24 February 2017
ER -