Skip to main content

A Hybrid Grouping Genetic Algorithm for the Multiple-Type Access Node Location Problem

  • Conference paper
Intelligent Data Engineering and Automated Learning - IDEAL 2009 (IDEAL 2009)

Abstract

This paper presents a new model for the access node location problem (ANLP) in communications networks, in which the access nodes (concentrators) can be chosen from different types (with different capacity and cost). The paper also proposes a hybrid grouping genetic algorithm which is able to efficiently solve the problem. In the paper, the main characteristics of the algorithm (encoding, operators and fitness function) are fully described, and its performance has been shown by solving different ANLP instances incorporating the new model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Salcedo-Sanz, S., Portilla-Figueras, J.A., Ortiz-García, E.G., Pérez-Bellido, A.M., Thraves, C., Fernandez-Anta, A., Yao, X.: Optimal switch location in mobile communication networks using hybrid genetic algorithms. Applied Soft Computing 8(4), 1486–1497 (2008)

    Article  Google Scholar 

  2. El-Alfy, E.S.: Applications of genetic algorithms to optimal multilevel design of MPLS-based networks. Computer Communications 30, 2010–2020 (2007)

    Article  Google Scholar 

  3. Krishnamachari, B., Wicker, S.: Base station location optimization in cellular wireless networks using heuristic search algorithms. In: Wang, L. (ed.) Soft Computing in Communications. Springer, Heidelberg (2003)

    Google Scholar 

  4. Menon, S., Gupta, R.: Assigning cells to switches in cellular networks by incorporating a pricing mechanism into simulated annealing. IEEE Trans. Syst. Man Cybern. B 34(1), 558–565 (2004)

    Article  Google Scholar 

  5. Abuali, F.N., Schoenefeld, D.A., Wainwright, R.L.: Terminal assignment in a communications network using genetic algorithms. In: Proc. 22nd Annual ACM Computer Science Conference, pp. 74–81. ACM Press, New York (1994)

    Google Scholar 

  6. Falkenauer, E.: The grouping genetic algorithm–widening the scope of the GAs. Proc. of the Belgian journal of operations research, statistics and computer science 33, 79–102 (1992)

    MATH  Google Scholar 

  7. Santos-Correa, E., Steiner, M.T., Freitas, A.A., Carnieri, C.: A genetic algorithm for solving a capacitated P-median problem. Numerical Algorithms 35(4), 373–388 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alonso-Garrido, O., Salcedo-Sanz, S., Agustín-Blas, L.E., Ortiz-García, E.G., Pérez-Bellido, A.M., Portilla-Figueras, J.A. (2009). A Hybrid Grouping Genetic Algorithm for the Multiple-Type Access Node Location Problem. In: Corchado, E., Yin, H. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2009. IDEAL 2009. Lecture Notes in Computer Science, vol 5788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04394-9_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04394-9_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04393-2

  • Online ISBN: 978-3-642-04394-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics