셀룰러 네트워크에서 셀-스위치 할당문제를 위한 유전자와 국부 탐색 알고리듬의 적용

• 영문명: An Application of Genetic and Local Search Algorithms for Cell-to-Switch Assignment Problem in Cellular Mobile Networks
• 발행기관: 한국산업경영시스템학회
• 저자명: 임동순
• 간행물 정보: 『한국산업경영시스템학회 학술대회』2004년 춘계학술대회 논문집, 306~309쪽, 전체 4쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2004.04.01

영문 초록

  In designing and operating cellular networks, it is assumed that the area of coverage is geographically divided into hexagonal cells. Among these cells, a certain number of cells are chosen to install switches that serve as relays for communications between any pair of cells. Then, each cell is assigned to a switch to complete the cellular network. This decision regarding assignment of cells to switches is known as a CSA (Cell-to-Switch Assignment) problem. Since this problem is so-called NP hard problem, many researches have proposed heuristic-based algorithms to provide near-optimal solutions with a reasonable computation time. Considering these characteristics of the CSA problem, this work develops a genetic algorithm and a local search algorithm. Throughout a number of experiments, the performance of the proposed algorithms are evaluated, and compared with existing heuristic method.

목차

Abstract
1. 서론
2. CSA 문제
3. 유전자와 국부 최적화 알고리듬
4. 실험 및 분석
5. 결론
참고문헌

키워드

cellular mobile networks genetic algorithm CSA problem