Chapter

Neural Information Processing

Volume 4234 of the series Lecture Notes in Computer Science pp 964-973

Genetic Algorithm for Satellite Customer Assignment

  • S. S. KimAffiliated withCarnegie Mellon UniversityDepartment of Industrial Engineering, Kangwon National University
  • , H. J. KimAffiliated withCarnegie Mellon UniversityDepartment of Control and Instrumentation Engineering, Kangwon National University
  • , V. ManiAffiliated withCarnegie Mellon UniversityDepartment of Aerospace Engineering, Indian Institute of Science
  • , C. H. KimAffiliated withCarnegie Mellon UniversityDepartment of Industrial Engineering, Kangwon National University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.