Authors : S. Sakthivel and R. Suresh
Abstract: In this study, a Broadcast Scheduling Problem (BSP), a finite set of wireless radio-frequency stations are to be scheduled in a time division multiple access frame. The objective is to provide a collision free broadcast schedule which minimizes the total frame length and maximizes the slot utilization within in frame. The BSP is a combinatorial optimization problem and it is an NP-hard problem. Well-known in the literature as an NP-hard combinatorial optimization problem, this problem requires recourse to heuristic methods in order to obtain good (not necessarily optimal) solutions within a practical amount of time, In this context, heuristic approaches a Genetic Algorithm (GA) can be used. This study proposes a genetic algorithm to solve this problem. The implementation of this algorithm has been subject to extensive tests. The result obtained confirms the efficiency and the effectiveness of GA to provide good solutions to practical sized problems. The goals and the present status of our research are also discussed.
Sakthivel, S. and R. Suresh , 2006. A Genetic Algorithm Approach to Solve Broadcast Scheduling Problem. International Journal of Soft Computing, 1: 170-174.