Genetic algorithm for satellite customer assignment

S. S. Kim, Hyong Joong Kim, V. Mani, C. H. Kim

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

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages964-973
Number of pages10
Volume4234 LNCS - III
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)03029743
ISSN (Electronic)16113349

Other

Other13th International Conference on Neural Information Processing, ICONIP 2006
CountryChina
CityHong Kong
Period06/10/306/10/6

Fingerprint

Assignment
Customers
Genetic algorithms
Genetic Algorithm
Satellites
Genetic Operators
Combinatorial optimization
Optimal Allocation
Combinatorial Optimization Problem
Repair
Optimization Methods
NP-complete problem
Standards

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kim, S. S., Kim, H. J., Mani, V., & Kim, C. H. (2006). Genetic algorithm for satellite customer assignment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4234 LNCS - III, pp. 964-973). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4234 LNCS - III). Springer Verlag.

Genetic algorithm for satellite customer assignment. / Kim, S. S.; Kim, Hyong Joong; Mani, V.; Kim, C. H.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4234 LNCS - III Springer Verlag, 2006. p. 964-973 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4234 LNCS - III).

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

Kim, SS, Kim, HJ, Mani, V & Kim, CH 2006, Genetic algorithm for satellite customer assignment. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4234 LNCS - III, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4234 LNCS - III, Springer Verlag, pp. 964-973, 13th International Conference on Neural Information Processing, ICONIP 2006, Hong Kong, China, 06/10/3.
Kim SS, Kim HJ, Mani V, Kim CH. Genetic algorithm for satellite customer assignment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4234 LNCS - III. Springer Verlag. 2006. p. 964-973. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Kim, S. S. ; Kim, Hyong Joong ; Mani, V. ; Kim, C. H. / Genetic algorithm for satellite customer assignment. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4234 LNCS - III Springer Verlag, 2006. pp. 964-973 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1b43e3004a09404eab37bf06189e7ead,
title = "Genetic algorithm for satellite customer assignment",
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.",
author = "Kim, {S. S.} and Kim, {Hyong Joong} and V. Mani and Kim, {C. H.}",
year = "2006",
language = "English",
isbn = "3540464840",
volume = "4234 LNCS - III",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "964--973",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Genetic algorithm for satellite customer assignment

AU - Kim, S. S.

AU - Kim, Hyong Joong

AU - Mani, V.

AU - Kim, C. H.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33750736034&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750736034&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33750736034

SN - 3540464840

SN - 9783540464846

VL - 4234 LNCS - III

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 964

EP - 973

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -