Genetic Algorithm for Satellite Customer Assignment
The problem of assigning customers to satellite channels is considered. Finding an optimal allocation of customers to satellite channels is a difficult combinatorial optimization problem and is shown to be NP-complete in an earlier study. We propose a genetic algorithm (GA) approach to search for the best/optimal assignment of customers to satellite channels. Various issues related to genetic algorithms such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. A comparison of this approach with the standard optimization method is presented to show the advantages of this approach in terms of computation time.
Unable to display preview. Download preview PDF.
- 1.Scoot, C.H., Skelton, O.G., Rolland, E.: Tactical and strategic models for satellite customer assignment. Journal of the Operational Research Society 51, 61–71 (2000)Google Scholar
- 6.Montgomery, D.C., Johnson, L.A.: Operations Research in Production Planning Scheduling and Inventory Control. John Wiely & Sons, Chichester (1974)Google Scholar
- 7.Holland, H.J.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
- 9.David, L.: Handbook of Genetic Algorithms. Van Nostrand Reingold, New York (1991)Google Scholar
- 13.Kidwell, M.D., Cook, D.J.: Genetic algorithm for dynamic task scheduling. In: Proceedings of the International Phoenix Conference on Computers and Communication, pp. 61–67 (1994)Google Scholar
- 14.Kim, S.S., Smith, A.E., Lee, J.H.: A memetic algorithm for channel assignment in wireless FDMA systems. Computers and Operations Research. Corrected proof available online (in press)Google Scholar