1998
DOI: 10.1109/4235.738972
|View full text |Cite
|
Sign up to set email alerts
|

An efficient evolutionary algorithm for channel resource management in cellular mobile systems

Abstract: Modern cellular mobile communications systems are characterized by a high degree of capacity. Consequently, they have to serve the maximum possible number of calls while the number of channels per cell is limited. The objective of channel allocation is to assign a required number of channels to each cell such that both efficient frequency spectrum utilization is provided and interference effects are minimized. Channel assignment is therefore an important operation of resource management and its efficient imple… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
30
0
2

Year Published

2001
2001
2013
2013

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 41 publications
(32 citation statements)
references
References 29 publications
0
30
0
2
Order By: Relevance
“…(2) On-line algorithms for dynamically assigning frequencies to users in a established network (mainly wireless communication networks) [5,6].…”
Section: Introductionmentioning
confidence: 99%
“…(2) On-line algorithms for dynamically assigning frequencies to users in a established network (mainly wireless communication networks) [5,6].…”
Section: Introductionmentioning
confidence: 99%
“…The most classical example of this characterization is the frequency assignment problem in a mobile communication network [3,5,7,15]. In this problem, every element of the matrix C; c ij , represents the minimum distance between frequencies in the communication network needed to avoid interferences, whereas f(X ) is the number of frequencies assigned, see [3,4] for details.…”
Section: Problem De每nition and Analysismentioning
confidence: 99%
“…Problems of this kind arise profusely in computational engineering and computer science 每elds. Scheduling problems [1,2], assignment problems [3][4][5][6]27] or problems of systems design [7][8][9], are some examples. In this paper, we refer to this kind of problems as constrained combinatorial optimization problems (CCOPs).…”
Section: Introductionmentioning
confidence: 99%
“…To overcome the difficulties associated with the deterministic methods other heuristic methods such as Simulated Annealing [5], Tabu Search [6], Neural Networks [7,8] and Genetic Algorithms [9,11,12] were used for the solution of FCA problem. Later, Feedforward Neural Networks [19], Hopfield Neural Networks [20,21], Genetic Algorithms [10,13], Combinatorial Evolution Strategy [22], and Particle Swarm Optimization [17] have been used for the solution of DCA problem. However, the ever increasing number of mobile cellular users and the increasing demand for bandwidth call for more and more efficient Dynamic Channel Assignment strategies.…”
Section: Introductionmentioning
confidence: 99%
“…Metaheuristic Search techniques prove effective in the solution of DCA problem. A number of approaches [5][6][7][8][9][10][11][12][13]17,19,20,21,22] have been proposed for the solution of Channel Assignment Problem. The initial efforts for the solution of FCA were based on deterministic methods but as the problem is NP-hard these methods proved ineffective and inefficient for practical implementation for the next generation of mobile systems in which higher traffic demand was expected.…”
Section: Introductionmentioning
confidence: 99%