Genetic algorithm for satellite customer assignment


Autoria(s): Kim, SS; Kim, HJ; Mani, V; Kim, CH
Data(s)

2006

Resumo

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

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/30770/1/fulltext.pdf

Kim, SS and Kim, HJ and Mani, V and Kim, CH (2006) Genetic algorithm for satellite customer assignment. In: 13th International Conference on Neural Informational Processing,, OCT 03-06, 2006, Hong Kong, PEOPLES R CHINA,, pp. 964-973.

Publicador

Springer

Relação

http://www.springerlink.com/content/n4ur0223rp856210/

http://eprints.iisc.ernet.in/30770/

Palavras-Chave #Aerospace Engineering (Formerly, Aeronautical Engineering)
Tipo

Conference Paper

PeerReviewed