http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
BcN 서비스 가입자 망 설계를 위한 타부서치 휴리스틱 알고리즘 개발
이영호(Youngho Lee),윤현정(Hyunjung Yun),이순석(Sunsuk Lee),박노익(Noik Park) 대한산업공학회 2008 대한산업공학회지 Vol.34 No.2
In this paper, we deal with an access network design problem arising from the deployment of broadband convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.
그물구조 WDM 망 설계 알고리즘과 망 설계 시스템 연구
이영호,장용원,박노익,이순석,김영부,조기성 한국경영과학회 2005 韓國經營科學會誌 Vol.30 No.1
In this paper, we deal with a mesh network design problem arising form the deployment of WDM for the optical internet. The mesh network consists of mesh topology for satisfying traffic demand while minimizing the cost of WDM, OXC, and fiber cables. The problem seeks to find an optimal routing of traffic demands in the network such that the total cost is minimized. We formulated the problem as a mixed-integer programming model and devise a tabu search heuristic procedure. Also we develop an optical internet design system that implements the proposed tabu search heuristic procedure. We demonstrate the computational efficacy of the proposed algorithm, compared with CPLEX 8.0.