Paper Info
Title
Solving the Terminal Assignment Problem Using a Local Search Genetic Algorithm
Abstract
Terminal assignment is an important issue in telecommunication networks optimization. The task here is to assign a given collection of terminals to a given collection of concentrators. The main objective is to minimize the link cost to form a network. This optimization task is an NP-complete problem. The intractability of this problem is a motivation for the pursuits of a local search genetic algorithm that produces approximate, rather than exact, solutions. In this paper, we explore one of the most successful emerging ideas combining local search with population-based search. Simulation results verify the effectiveness of the proposed method. The results show that our algorithm provides good solutions in a better running time.
Year
DOI
Venue
2008
10.1007/978-3-540-85863-8_27
INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE 2008
Keywords
Field
DocType
Terminal Assignment Problem,Genetic Algorithm,Local Search Algorithm
Hill climbing,Mathematical optimization,Search algorithm,Guided Local Search,Computer science,Generalized assignment problem,Beam search,Local search (optimization),Best-first search,Iterated local search
Conference
Volume
ISSN
Citations 
50
1615-3871
7
PageRank 
References 
Authors
0.55
7
5
Name
Order
Citations
PageRank
Eugénia Moreira Bernardino1759.44
Anabela Moreira Bernardino2759.44
Juan Manuel Sánchez-Pérez321928.40
Juan Antonio Gómez-Pulido433443.02
Miguel A. Vega-Rodríguez5741113.05