Skip to main content
SpringerLink
Log in

Using the Bees Algorithm to Assign Terminals to Concentrators

  • Conference paper
Book cover Trends in Applied Intelligent Systems (IEA/AIE 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6097))

Abstract

With the recent growth of communication networks, a large variety of combinatorial optimization problems appeared. One of these problems is the Terminal Assignment Problem. The main objective is to assign a given set of terminals to a given set of concentrators. In this paper, we propose the Bees Algorithm to assign terminals to concentrators. The algorithm performs a kind of neighbourhood search and uses a local search method to locate the global minimum. The Bees Algorithm is a swam-based optimization algorithm that mimics the natural behaviour of honey bees. We show that the Bees Algorithm is able to achieve feasible solutions to Terminal Assignment instances, improving the results obtained by previous approaches.

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

Access this chapter

Log in via an institution
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. Khuri, S., Chiu, T.: Heuristic Algorithms for the Terminal Assignment Problem. In: Proc. of the ACM Symposium on Applied Computing, pp. 247–251. ACM Press, New York (1997)

    Google Scholar 

  2. Salcedo-Sanz, S., Yao, X.: A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem. IEEE Transaction On Systems, Man and Cybernetics, 2343–2353 (2004)

    Google Scholar 

  3. Yao, X., Wang, F., Padmanabhan, K., Salcedo-Sanz, S.: Hybrid evolutionary approaches to terminal assignment in communications networks. In: Recent Advances in Memetic Algorithms and related search technologies, vol. 166, pp. 129–159. Springer, Berlin (2005)

    Chapter  Google Scholar 

  4. Pham, D.T., Ghanbarzadeh, A., Koç, E., Otri, S., Rahim, S., Zaidi, M.: The Bees Algorithm. Technical Note, Manufacturing Engineering Centre, Cardiff University, UK (2005)

    Google Scholar 

  5. Pham, D.T., Afify, A.A., Koç, E.: Manufacturing cell formation using the Bees Algorithm. In: Innovative Production Machines and Systems Virtual Conference, Cardiff, UK (2007)

    Google Scholar 

  6. Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-Rodríguez, M., Gómez-Pulido, J.: A Hybrid Differential Evolution Algorithm for solving the Terminal assignment problem. In: International Symposium on Distributed Computing and Artificial Intelligence 2009, pp. 178–185. Springer, Heidelberg (2009)

    Google Scholar 

  7. Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm intelligence. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  8. Abuali, F., Schoenefeld, D., Wainwright, R.: Terminal assignment in a Communications Network Using Genetic Algorithms. In: Proc. of the 22nd Annual ACM Computer Science Conference, pp. 74–81. ACM Press, New York (1994)

    Google Scholar 

  9. Bees Algorithm Website, http://www.bees-algorithm.com/

  10. Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-Rodríguez, M., Gómez-Pulido, J.: Tabu Search vs Hybrid Genetic Algorithm to solve the terminal assignment problem. In: IADIS International Conference Applied Computing, pp. 404–409. IADIS Press (2008)

    Google Scholar 

  11. Xu, Y., Salcedo-Sanz, S., Yao, X.: Non-standard cost terminal assignment problems using tabu search approach. In: IEEE Conference in Evolutionary Computation, vol. 2, pp. 2302–2306 (2004)

    Google Scholar 

  12. Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-Rodríguez, M., Gómez-Pulido, J.: Solving the Terminal Assignment Problem Using a Local Search Genetic Algorithm. In: International Symposium on Distributed Computing and Artificial Intelligence, pp. 225–234. Springer, Heidelberg (2008)

    Google Scholar 

  13. Bernardino, E., Bernardino, A., Sánchez-Pérez, J., Vega-Rodríguez, M., Gómez-Pulido, J.: A Hybrid Ant Colony Optimization Algorithm for Solving the Terminal Assignment Problem. In: International Conference on Evolutionary Computation (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Center for Informatics and Communications, Department of Computer Science, School of Technology and Management, Polytechnic Institute of Leiria, 2411, Leiria, Portugal

    Eugénia Moreira Bernardino & Anabela Moreira Bernardino

  2. Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, 10071, Cáceres, Spain

    Juan Manuel Sánchez-Pérez, Juan Antonio Gómez-Pulido & Miguel Angel Vega-Rodríguez

Authors
  1. Eugénia Moreira Bernardino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anabela Moreira Bernardino
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Juan Manuel Sánchez-Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Juan Antonio Gómez-Pulido
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Miguel Angel Vega-Rodríguez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computing and Numerical Analysis, University of Cordoba, Campus Universitario de Rabanales, Einstein Building, 3rd floor,, 14071, Cordoba, Spain

    Nicolás García-Pedrajas

  2. Dept. of Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    Francisco Herrera

  3. School of Computing, University of the West of Scotland, PA1 2BE, Paisley, UK

    Colin Fyfe

  4. Dept. Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    José Manuel Benítez

  5. Department of Computer Science, Texas State University-San Marcos, 601 University Drive, TX 78666-4616, San Marcos, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moreira Bernardino, E., Moreira Bernardino, A., Sánchez-Pérez, J.M., Gómez-Pulido, J.A., Vega-Rodríguez, M.A. (2010). Using the Bees Algorithm to Assign Terminals to Concentrators. In: García-Pedrajas, N., Herrera, F., Fyfe, C., Benítez, J.M., Ali, M. (eds) Trends in Applied Intelligent Systems. IEA/AIE 2010. Lecture Notes in Computer Science(), vol 6097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13025-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13025-0_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13024-3

  • Online ISBN: 978-3-642-13025-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation