2010
DOI: 10.1007/s00500-010-0653-4
|View full text |Cite
|
Sign up to set email alerts
|

Optimization algorithms for large-scale real-world instances of the frequency assignment problem

Abstract: Nowadays, mobile communications are experiencing a strong growth, being more and more indispensable. One of the key issues in the design of mobile networks is the Frequency Assignment Problem (FAP). This problem is crucial at present and will remain important in the foreseeable future. Real world instances of FAP typically involve very large networks, which can only be handled by heuristic methods. In the present work, we are interested in optimizing frequency assignments for problems described in a mathematic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(15 citation statements)
references
References 54 publications
0
15
0
Order By: Relevance
“…We propose an automatic search for the number of clusters that optimizes classification success and localization estimation accuracy following a similar approach as that presented in [24]. Each one of the generated clusters is a vector of mean values of the magnetic field features forming the centroid of the cluster, and a vector of deviation values associated to the clusters.…”
Section: ) Data Collectionmentioning
confidence: 99%
“…We propose an automatic search for the number of clusters that optimizes classification success and localization estimation accuracy following a similar approach as that presented in [24]. Each one of the generated clusters is a vector of mean values of the magnetic field features forming the centroid of the cluster, and a vector of deviation values associated to the clusters.…”
Section: ) Data Collectionmentioning
confidence: 99%
“…Heuristics for FAP fall either in pure local search [10] or more efficient local search as simulated annealing [11] and tabu search [12]. Beyond local search, heuristics based on ant colonies paradigm have also been adapted for FAP [13].…”
Section: Related Workmentioning
confidence: 99%
“…NP-hard problems have been solved by most recent metaheuristic algorithms such as job scheduling problem [6], task assignment problems [7], quadratic assignment [8], travel salesman person [9], vehicle routing problem [10], home health care scheduling problem [11] and frequency assignment problem [12]. The most common algorithms are namely Evolutionary Algorithm (specifically GA) [13], Particle Swarm Optimizer (PSO) [14], Artificial Bee Colony (ABC) [15] Whale Optimization Algorithm (WOA) [16] and Grey Wolf Optimizer (GWO) [17].…”
Section: Introductionmentioning
confidence: 99%