Genetic algorithm for satellite customer assignment

S. S. Kim, H. J. Kim, V. Mani, C. H. Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationNeural Information Processing - 13th International Conference, ICONIP 2006, Proceedings
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540464840, 9783540464846
Publication statusPublished - 2006
Externally publishedYes
Event13th International Conference on Neural Information Processing, ICONIP 2006 - Hong Kong, China
Duration: 2006 Oct 32006 Oct 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4234 LNCS - III
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other13th International Conference on Neural Information Processing, ICONIP 2006
CityHong Kong

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Genetic algorithm for satellite customer assignment'. Together they form a unique fingerprint.

Cite this