원문정보
A Genetic Algorithm for Assignments of Dual Homing Cell-To-Switch under Mobile Communication Networks
초록
영어
There has been a tremendous need for dual homing cell switch assignment problems where calling volume and patterns are different at different times of the day. This problem of assigning cells to switches in the planning phase of mobile networks consists in finding an assignment plan which minimizes the communication costs taking into account some constraints such as capacity of switches. This optimization problem is known to be difficult to solve, such that heuristic methods are usually utilized to find good solutions in a reasonable amount of time. In this paper, we propose an evolutionary approach, based on the genetic algorithm paradigm, for solving this problem. Simulation results confirm the appropriateness and effectiveness of this approach which yields solutions of good quality.
목차
1. 서론
2. 문제 정의
3. 유전자 알고리듬
3.1 염색체 표현
3.2 생식 규칙
3.3 교차 연산자
3.4 돌연변이 연산자
4. 실험 및 분석
5. 결론
참고문헌