Name
Abstract | ||
|---|---|---|
In this paper we describe the application of different heuristics to optimise large communication networks. We use Iterated Local Search (ILS), Tabu Search (TS), Simulated Annealing (SA) and Genetic Algorithm (GA) to minimise the link cost to form balanced communication networks. This paper makes a comparison among the effectiveness of ILS, TS, SA and GA on solving large communication networks. Simulation results verify the effectiveness of these algorithms. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1145/2093698.2093822 | ISABEL |
Keywords | Field | DocType |
local search,different heuristics,genetic algorithm,balanced communication network,simulation result,simulated annealing,tabu search,link cost,large communication network,genetics,assignment problem,communication networks,iterated local search,local search algorithm | Simulated annealing,Hill climbing,Mathematical optimization,Search algorithm,Guided Local Search,Computer science,Algorithm,Local search (optimization),Genetic algorithm,Tabu search,Iterated local search | Conference |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eugénia Moreira Bernardino | 1 | 75 | 9.44 |
| Anabela Moreira Bernardino | 2 | 75 | 9.44 |
| Juan Manuel Sánchez-Pérez | 3 | 278 | 30.84 |
| Juan A. Gómez-Pulido | 4 | 202 | 21.36 |
| Miguel A. Vega-Rodríguez | 5 | 741 | 113.05 |