Genetic and local search algorithms applied to balanced communication networks

Bernardino, Eugénia; Moreira Bernardino, Anabela; Sánchez-Pérez, Juan M.; Gómez-Pulido, Juan A.; Vega-Rodríguez, Miguel A.

http://hdl.handle.net/10400.8/14490

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
14.pdf		395.76 KB	Adobe PDF	Download

Send Feedback

Authors

Bernardino, Eugénia

Moreira Bernardino, Anabela

Sánchez-Pérez, Juan M.

Gómez-Pulido, Juan A.

Vega-Rodríguez, Miguel A.

Abstract(s)

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.

Keywords

Communication Networks Iterated Local Search Tabu Search Simulated Annealing Genetic Algorithm Terminal Assignment Problem.

URI

http://hdl.handle.net/10400.8/14490

Citation

Bernardino, Eugénia & Bernardino, Anabela Moreira & Sánchez-Pérez, Juan & Gómez-Pulido, Juan A. & Vega-Rodríguez, Miguel A.. (2011). Genetic and local search algorithms applied to balanced communication networks. ACM International Conference Proceeding Series. 10.1145/2093698.2093822.