상세정보
학술지
Design of Local Networks using USHRs
Cited 7 time in 
Download 1 time
Share 
Download 1 time
Share
- 저자
- 강동한, 이경식, 박성수, 박경철, 김상백
- 발행일
- 200008
- 출처
- Telecommunication Systems, v.14 no.1-4, pp.197-217
- ISSN
- 1018-4864
- 출판사
- Springer
- 협약과제
- 00MN1100, 통합 우정물류 실시간 관제시스템 개발, 김혜규
- 초록
- We consider the problem of designing a local network in a two-level telecommunication network. Given one or two hub nodes, central offices (COs) and conduits, the problem is to find a set of unidirectional self-healing rings (USHRs) which covers all COs and satisfies all demands at minimum cost. The solution approach used is the decomposition and column generation. Master problem and subproblem are modeled as integer programming models. After the optimal solution to linear programming relaxation of the master problem is obtained, a branch-and-bound algorithm is used to get an integer solution. A set of valid inequalities for a subproblem is given and a branch-and-cut algorithm is used to find an optimal solution to the subproblem. Computational results using real data are reported. © J.C. Baltzer AG, Science Publishers.
- KSP 제안 키워드
- Branch-and-bound algorithm, Integer Programming, Linear programming relaxation, Local networks, Master problem, Minimum cost, Optimal Solution, Programming models, Real data, Telecommunication Network, Two-level