A real-time heuristic search technique for fixed channel allocation (FCA) in mobile cellular communications

Simulated Quenching Algorithm for Frequency Planning in Cellular Systems

“…In our problem formulation we assume that the total number of available channels is given −it can be determined by either the available radio spectrum or the lower bound estimated by a graph-theoretic method (Mandal, 2004;Smith, 2000). Without loss of generality, channels can be assumed to be evenly spaced in the radio frequency spectrum.…”

“…Figure 7 shows the execution times for three different algorithms: (i) the IDA (Iterative Deepening A) algorithm (Nilsson, 1998), which offers a quite simple algorithm that can solve large problems with a small computer memory, (ii) the so-called BDFS (Block Depth-Fist Search) real-time heuristic search method proposed in (Mandal, 2004), (iii) the proposed GA, and (iv) the proposed SQ method. For the sake of comparison, we have chosen the same number of cells and number of channels than in (Mandal, 2004).…”

“…For instance, (Mandal, 2004) and (Smith, 2000) address this problem when proposing solutions to the CAP.…”

A new adaptive genetic algorithm for fixed channel assignment

“…Table 4 shows the execution times for three different algorithms: (i) the IDA (iterative deepening A) algorithm [33], which offers a quite simple algorithm that can solve large problems with a small computer memory, (ii) the so-called BDFS (block depth-first search) real-time heuristic search method proposed in [28], and (iii) the DGlGA. For the sake of comparison, we have chosen the same number of cells and number of channels than in [28]. It can be seen first that the BDFS algorithm produces an increasing average speedup over the IDA method.…”

Genetic Tabu search for robust fixed channel assignment under dynamic traffic data

“…The classical FCA is known to be a very difficult optimization problem [1,6,13,17,27,30]. The presence of additional optimization criteria in the new model makes the problem even harder.…”