BcN 서비스 가입자 망 설계를 위한 타부서치 휴리스틱 알고리즘 개발Tabu Search Heuristic Algorithm for Designing Broadband Convergence Networks
- Other Titles
- Tabu Search Heuristic Algorithm for Designing Broadband Convergence Networks
- Authors
- 이영호; 윤현정; 이순석; 박노익
- Issue Date
- 2008
- Publisher
- 대한산업공학회
- Keywords
- Tabu Search; Converged Access Network Design; Quality of Service (QoS); Three-Level Capacitated Facility Location-Allocation Problem (CFLP); Tabu Search; Converged Access Network Design; Quality of Service (QoS); Three-Level Capacitated Facility Location-Allocation Problem (CFLP)
- Citation
- 대한산업공학회지, v.34, no.2, pp.205 - 215
- Indexed
- KCI
- Journal Title
- 대한산업공학회지
- Volume
- 34
- Number
- 2
- Start Page
- 205
- End Page
- 215
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/124881
- ISSN
- 1225-0988
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Industrial and Management Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.