Channel assignment through evolutionary optimization

A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university

“…The two-phase heuristic algorithm is described in Section 3.1, whereas the characteristics of the EA used are described in Section 3.2. Note that the structure of our algorithm (a priority list evolved with an evolutionary algorithm together with a scheduling engine (the two-phase heuristic in our case)) is well known in scheduling problems, see for example the work by Fang et al [26] for the open-shop scheduling problem, a problem quite close to timetabling, and the work by Lai et al [27] for the frequency assignment problem.…”

“…One technique that has been used extensively to avoid similar problems, is to use a more sophisticated crossover operator, known as partially matched crossover (PMX) [27]. In PMX, once the individuals have been coupled at random, two points in a string are randomly chosen, and the portions of individuals are exchanged.…”

Analytical Approach for Channel Assignments in Cellular Networks

“…For a large-scale system an approach for the optimal solution is impractical. Thus a simplification of the problem or an approximation technique have been used, such as neural network based algorithms [16,17,18], simulations [19,20], and genetic algorithms [9,21,22,23]. Many authors have studied lower bounds for SM.…”

Channel assignment optimisation using a hyper-heuristic

“…A genetic algorithm approach was proposed by Lai and Coghill [15] who investigated the channel assignment problem using a computational technique that mimics the evolutionary process. The primary goal in solving CAP is to satisfy cosite and cochannel constraints and satisfy all channel demands required by each cell.…”

“…Previous approaches to solve CAP can be categorised as approaches using graph theory [6], heuristics [1,7,8,9], local search [10], neural networks [11, 12 ,13], the utilisation of simulated annealing [14] and genetic algorithms [15].…”