A new strategy for the application of genetic algorithms to the channel-assignment problem

Hybrid Ant Colony Optimization for the Channel Assignment Problem in Wireless Communication

“…The lower bound for each of the problems is also listed. It is seen that the methods proposed by Ghosh et al (2003) and Beckmann & Killat (1999) are able to solve each of the benchmark problems optimally. Both of the two approaches are based on genetic algorithms, manifesting the promising direction of solving CAP using metaheuristics.…”

“…Nonetheless, the HACO spent 10 min for solving either problem 2 or problem 6, the GA-based method in Ghosh et al (2003) spent 12-80 h for solving the two problems. The method in Beckmann & Killat (1999) starts with a lower bound and increases one channel at a time if a feasible channel assignment cannot be found by their algorithm, however, a reachable lower bound is not available in the general cases. The rest of the competing algorithms are based on heuristics, their performances are not comparable to those based on metaheuristics such as GA or ACO.…”

A Proposal of a Quasi-Solution State Evolution Algorithm for Channel Assignment Problems

“…On the other hand, the existing algorithms require several versions of procedures and/or many repeated runs with different random numbers to reach the optimum solution. For example, the genetic algorithm in [12] can reach the lower bound solution for the hard instance 10 by Sivarajan in only 1 run among 50 runs with different random numbers. Besides, it takes several thousand of iteration steps for convergence.…”

Simulated Quenching Algorithm for Frequency Planning in Cellular Systems

“…Notice that, it can not be guaranteed that a valid solution is found in a finite number of iterations. Besides, the time required to compute an optimal solution increases exponentially with the size of the problem (Beckmann, 1999;Kunz, 1991;Funabiki, 1992). Thus, it is necessary to develop approximate methods capable of finding at least a near-optimum solution within a reasonable amount of time.…”