Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ericsson Company: Ericsson Mobility Report. On the Pulse of the Networked Society. Technical Paper (2016). https://www.ericsson.com/
Holma, H., Toskala, A.: WCDMA for UMTS: HSPA Evolution and LTE. Wiley, New York (2010)
Cuadra, L., Aybar-Ruiz, A., Del Arco, M.A., Navío-Marco, J., Portilla-Figueras, J.A., Salcedo-Sanz, S.: A Lamarckian hybrid grouping genetic algorithm with repair heuristics for resource assignment in WCDMA networks. Appl. Soft Comput. 43, 619–632 (2016)
Cuadra, L., Salcedo-Sanz, S., Carnicer, A.D., Del Arco, M.A., Portilla-Figueras, J.A.: A novel grouping genetic algorithm for assigning resources to users in WCDMA networks. In: Mora, A.M., Squillero, G. (eds.) EvoApplications 2015. LNCS, vol. 9028, pp. 42–53. Springer, Heidelberg (2015). doi:10.1007/978-3-319-16549-3_4
Gil-Lopez, S., Del Ser, J., Landa-Torres, I., Garcia-Padrones, L., Salcedo-Sanz, S., Portilla-Figueras, J.A.: On the application of a novel grouping harmony search algorithm to the switch location problem. In: Chatzimisios, P., Verikoukis, C., Santamaría, I., Laddomada, M., Hoffmann, O. (eds.) Mobilight 2010. LNICSSITE, vol. 45, pp. 662–672. Springer, Heidelberg (2010). doi:10.1007/978-3-642-16644-0_57
Manjarres, D., Landa-Torres, I., Gil-Lopez, S., Del Ser, J., Bilbao, M.N., Salcedo-Sanz, S., Geem, Z.W.: A survey on applications of the harmony search algorithm. Eng. Appl. Artif. Intell. 26(8), 1818–1831 (2013)
Acknowledgments
This work has been partially supported by projects TIN2014-54583-C2-2-R (Spanish Ministerial Commission of Science and Technology) and S2013ICE-2933_02 (Comunidad Autónoma de Madrid).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Aybar-Ruiz, A., Cuadra, L., Del Ser, J., Portilla-Figueras, J.A., Salcedo-Sanz, S. (2017). A Grouping Harmony Search Algorithm for Assigning Resources to Users in WCDMA Mobile Networks. In: Del Ser, J. (eds) Harmony Search Algorithm. ICHSA 2017. Advances in Intelligent Systems and Computing, vol 514. Springer, Singapore. https://doi.org/10.1007/978-981-10-3728-3_19
Download citation
DOI: https://doi.org/10.1007/978-981-10-3728-3_19
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3727-6
Online ISBN: 978-981-10-3728-3
eBook Packages: EngineeringEngineering (R0)