Metaheuristics for optimization problems in computer communications

  • Authors:

  • Celso C. Ribeiro;Simone L. Martins;Isabel Rosseti

  • Affiliations:

  • Universidade Federal Fluminense, Department of Computer Science, Rua Passo da Pátria 156, Niterói, RJ 24210-240, Brazil;Universidade Federal Fluminense, Department of Computer Science, Rua Passo da Pátria 156, Niterói, RJ 24210-240, Brazil;Universidade Federal Fluminense, Pólo Universitário de Rio das Ostras, Rua Recife, Quadra 7, Rio das Ostras, RJ 28890-000, Brazil

  • Venue:
  • Computer Communications
  • Year:
  • 2007

Quantified Score

Hi-index 0.24

Visualization

Abstract

Recent years have witnessed huge advances in computer technology and communication networks, entailing hard optimization problems in areas such as network design and routing. Metaheuristics are general high-level procedures that coordinate simple heuristics and rules to find good approximate solutions to computationally difficult combinatorial optimization problems. They are among the most effective solution strategies for solving optimization problems in practice and have been applied to a very large variety of problems in telecommunications, computer communications, and network design and routing. In this paper, we review the principles associated with some of the main metaheuristics and we give templates for basic implementations of them: simulated annealing, tabu search, GRASP, VNS, genetic algorithms, and path-relinking. The main strategies underlying the development of parallel implementations of metaheuristics are also reviewed. Finally, we present an account of some successful applications of metaheuristics to optimization problems in telecommunications, computer communications, and network design and routing.