Genetic algorithm for satellite customer assignment

Authors:
S. S. Kim;H. J. Kim;V. Mani;C. H. Kim
Affiliations:
Department of Industrial Engineering, Kangwon National University, Chunchon, Korea;Department of Control and Instrumentation Engineering, Kangwon National University, Chunchon, Korea;Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India;Department of Industrial Engineering, Kangwon National University, Chunchon, Korea
Venue:
ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III
Year:
2006

Citing 5
Cited 1

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
A genetic algorithm for the generalised assignment problem

Computers and Operations Research
Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues

IEEE Transactions on Parallel and Distributed Systems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Open shop, satellite communication and a theorem by Egerváry (1931)

Operations Research Letters

Evolving distributed resource sharing for cubesat constellations

Proceedings of the 14th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

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.