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. Throu호out a number of experiments, the performance of the proposed algorithms are evaluated, and compared with existing heuristic method

Abstract
 1. 서론
 2. CSA 문제
 3. 유전자와 국부 최적화 알고리듬
  3.1 경험적 방법의 해석이 필요한 순열 표현방법
  3.2 유전 연산자
  3.3 국부 탐색 알고리듬
 4. 실험 및 분석
 5. 결론
 참고문헌

• 임동순(한남대학교 산업시스템공학)