2011
DOI: 10.1016/j.comnet.2011.05.008
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of different meta-heuristics to solve the global planning problem of UMTS networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0
3

Year Published

2012
2012
2016
2016

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 33 publications
0
5
0
3
Order By: Relevance
“…Although the proposed model allows to obtain quite good results, it does not include the concepts of service quality and network survivability. The global planning of wireless networks has been little studied in the literature, and its applications are mainly in UMTS networks [21], [23], [24].…”
Section: A Network Planning Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…Although the proposed model allows to obtain quite good results, it does not include the concepts of service quality and network survivability. The global planning of wireless networks has been little studied in the literature, and its applications are mainly in UMTS networks [21], [23], [24].…”
Section: A Network Planning Problemmentioning
confidence: 99%
“…Considering the difficulty of the problem, these results can be described as excellent. Indeed, an average gap of less than 5% is considered good for this type of problem [24]. that a time limit has been set for the ILP algorithm.…”
Section: Generation Of Lower Bounds and Comparison To Gpp4g-ilsmentioning
confidence: 99%
“…Se trata de un problema de optimización que en términos de complejidad computacional es de clase NP-complejo [24]. Simulated Annealing (SA) es un método probabilístico de búsqueda meta-heurística que se utiliza muy a menudo para resolver problemas de optimización complejos y, concretamente, es muy utilizado en planificación y optimización automática de redes móviles [24][25][26]. Sin embargo, existe una gran variedad de propuestas alternativas de resolución de este problema, como la utilización del método de Taguchi [27,28] o de teoría de juegos [29].…”
Section: Estado Del Arteunclassified
“…Sin embargo, existe una gran variedad de propuestas alternativas de resolución de este problema, como la utilización del método de Taguchi [27,28] o de teoría de juegos [29]. Además, existen estudios donde se comparan las prestaciones de SA con respecto a Genetic Algorithm (GA) y Tabu Search (TS) [24].…”
Section: Estado Del Arteunclassified
See 1 more Smart Citation