IE interfaces (산업공학)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

Optimal Design of Satellite Customer Assignment using Genetic Algorithm

유전자알고리즘을 적용한 위성고객할당 최적 설계

  • Kim, Sung-Soo (Department of Industrial Engineering, Kangwon National University) ;
  • Kim, Choong-Hyun (Ainsolution Co.) ;
  • Kim, Ki-Dong (Department of Industrial Engineering, Kangwon National University) ;
  • Lee, Sun-Yeob (Department of Radiology, Hallym University Chuncheon Sacred Heart Hospital)
  • 김성수 (강원대학교 산업공학과) ;
  • 김중현 (아인솔루션(주)솔루션사업부) ;
  • 김기동 (강원대학교 산업공학과) ;
  • 이선엽 (한림대춘천성심병원 방사선과)
  • Received : 20060600
  • Accepted : 20061000
  • Published : 2006.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

The problem of assigning customers to satellite channels is considered in this paper. 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 GA with CPLEX8.1 is presented to show the advantages of this approach in terms of computation time and solution quality.

Keywords

References

  1. Beckmann, D. and Killat, U.(1999), A new strategy for the application of genetic algorithms to the channel-assignment problem, IEEE Transactions on Vehicular Technology, 48(4), 1261-1269 https://doi.org/10.1109/25.775374
  2. Cartrysse, D. and Wassenhove, L. N. Van(1992), A survey of algorithms for the generalized assignment problem, European Journal of Operational Research, 60, 260-272 https://doi.org/10.1016/0377-2217(92)90077-M
  3. CPLEX 8.1(2003), CPLEX Optimization Inc
  4. Chu, P. C. and Beasley, J. E.(1997), A genetic algorithm for the generalized assignment problem, Computers and Operations Research, 24, 17-23 https://doi.org/10.1016/S0305-0548(96)00032-9
  5. Dell' Amico, M. and Martello, S.(1996), Open shop satellite communication and a theorem by Egervary, Operations Research Letters, 18. 209-211
  6. Etiler, O., Toklu, B., Atak, M., and Wilson, J.(2004), A genetic algorithm for flow shop scheduling problems, Journal of the Operational Research Society, 55, 830-835 https://doi.org/10.1057/palgrave.jors.2601766
  7. Ghosh, S. C. and Sinha, B. P.(2003), Channel Assignment using Genetic Algorithm based on Geometric Symmetry, IEEE Transactions on Vehicular Technology, 52(4), 860-875 https://doi.org/10.1109/TVT.2003.808806
  8. Goldberg, D. E.(1989), Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley publishing company, Inc
  9. Holland, J. H.(1975), Adaptation in Natural and Artificial Systems, The University of Michigan Press, Michigan
  10. Lai, W. K. and Coghill, G. G.(1996), Channel Assignment through Evolutionary Optimization, IEEE Transactions on Vehicular Technology, 45(1), 91-96 https://doi.org/10.1109/25.481825
  11. Lee, H., Ahn, D. H., and Kim, S.(2003), Optimal routing in non-geostationary satellite ATM networks with intersatellite link capacity constraints, Journal of Operational Research Society, 54, 401-409 https://doi.org/10.1057/palgrave.jors.2601489
  12. Michalewicz, Z.(1996), Genetic Algorithms+Data Structures = Evolution Programs, Springer
  13. Ngo, C. Y. and Li, V.(1998), Fixed Channel Assignment in Cellular Radio Networks using a Modified Genetic Algorithm, IEEE Transactions on Vehicular Technology, 47(1), 163-172 https://doi.org/10.1109/25.661043
  14. Prins, C.(1994), An overview of scheduling problems arising in satellite communications, Journal of the Operational Research Society, 45, 611-623 https://doi.org/10.1057/jors.1994.99
  15. Rote, G. and Vogel, A(1993), A Heuristic for Decomposing Traffic Matrices in TDMA Satellite Communication, ZOR, 38, 281-307
  16. Scott, C. H., Skelton, O. G., and Rolland, E.(2000), Tactical and strategic models for satellite customer assignment, Journal of the Operational Research Society, 51, 61-71 https://doi.org/10.1057/palgrave.jors.2600860