Using the bees algorithm to assign terminals to concentrators

  • Authors:
  • Eugénia Moreira Bernardino;Anabela Moreira Bernardino;Juan Manuel Sánchez-Pérez;Juan Antonio Gómez-Pulido;Miguel Angel Vega-Rodríguez

  • Affiliations:
  • Research Center for Informatics and Communications, Department of Computer Science, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal;Research Center for Informatics and Communications, Department of Computer Science, School of Technology and Management, Polytechnic Institute of Leiria, Leiria, Portugal;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain;Department of Technologies of Computers and Communications, Polytechnic School, University of Extremadura, Cáceres, Spain

  • Venue:
  • IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.