Genetic Algorithm for Satellite Customer Assignment

  • S. S. Kim
  • H. J. Kim
  • V. Mani
  • C. H. Kim
Conference paper

DOI: 10.1007/11893295_106

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4234)
Cite this paper as:
Kim S.S., Kim H.J., Mani V., Kim C.H. (2006) Genetic Algorithm for Satellite Customer Assignment. In: King I., Wang J., Chan LW., Wang D. (eds) Neural Information Processing. ICONIP 2006. Lecture Notes in Computer Science, vol 4234. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • S. S. Kim
    • 1
  • H. J. Kim
    • 2
  • V. Mani
    • 3
  • C. H. Kim
    • 1
  1. 1.Department of Industrial EngineeringKangwon National UniversityChunchonKorea
  2. 2.Department of Control and Instrumentation EngineeringKangwon National UniversityChunchonKorea
  3. 3.Department of Aerospace EngineeringIndian Institute of ScienceBangaloreIndia

Personalised recommendations