|
Title:
|
TABU SEARCH VS HYBRID GENETIC ALGORITHM TO SOLVE THE TERMINAL ASSIGNMENT PROBLEM |
|
Author(s):
|
Eugénia Moreira Bernardino , Anabela Moreira Bernardino , Juan M. Sánchez-pérez , Juan A. Gómez-pulido , Miguel A. Vega-rodríguez |
|
ISBN:
|
978-972-8924-56-0 |
|
Editors:
|
Nuno Guimarães and Pedro Isaías |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
Communication Networks, Terminal Assignment Problem, Genetic Algorithms, Tabu Search. |
|
Type:
|
Short Paper |
|
First Page:
|
404 |
|
Last Page:
|
409 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Terminal assignment (TA) is an important issue in telecommunication networks optimization to increase their capacity
and reducing the cost of them. The task here is to minimize the link cost to form a network by connecting a given set of
terminals to a given set of concentrators. In this paper, we propose a Tabu Search algorithm and a Hybrid Genetic
algorithm employing multiple mutation operators for solving the terminal assignment problem. Simulation results with
the different methods implemented are compared. |
|
|
|
|
|
|
