대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제34권2호
  • /
  • Pages.205-215
  • /
  • 2008
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

BcN 서비스 가입자 망 설계를 위한 타부서치 휴리스틱 알고리즘 개발

Tabu Search Heuristic Algorithm for Designing Broadband Convergence Networks

  • 이영호 (고려대학교 정보경영공학부) ;
  • 윤현정 (고려대학교 정보경영공학부) ;
  • 이순석 (한국전자통신연구원 광대역통합망연구단) ;
  • 박노익 (한국전자통신연구원 광대역통합망연구단)
  • Lee, Youngho (Division of Information Management Engineering, Korea University) ;
  • Yun, Hyunjung (Division of Information Management Engineering, Korea University) ;
  • Lee, Sunsuk (Electronics and Telecommunications Research Institute) ;
  • Park, Noik (Electronics and Telecommunications Research Institute)
  • 발행 : 2008.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  1. Aardal, K. (1998), Reformulation of Capacitated Facility Location Problems: How Redundant Information Can Help, Annals of Operations Research, 82, 289-308 https://doi.org/10.1023/A:1018966804496
  2. Aardal, K., Pochet, Y., and Wolsey, L. A. (1995), Capacitated Facility Location : Valid Inequalities and Facets, Mathematics of Operations Research, 20, 562-582 https://doi.org/10.1287/moor.20.3.562
  3. Carello, G., F.D. Croce, M. Ghirardi, and R. Tadei (2004), Solving the Hub Location Problem in Telecommunication Network Design: A Local Search Approach, Networks, 44(2), 94-105 https://doi.org/10.1002/net.20020
  4. Dilek, T., and I. B. Laura (1998), A Two-Phase Tabu Search Approach to the Location Routing Problem, European Journal of Operational Research, 116, 87-99
  5. Gendron, B., J. Y. Potrin, and P. Soriano (2003), A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements, Annals of Operations Research, 122, 193-217 https://doi.org/10.1023/A:1026102724889
  6. Ghiani, G., F. Guerriero, G. Laporte, and R. Musmanno (2004), Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions, Journal of Mathematical Modelling and Algorithms, 3, 209-233 https://doi.org/10.1023/B:JMMA.0000038618.37710.f8
  7. Girard, A., B. Sansò, and L. Dadjo (2001), A Tabu Search Algorithm for Access Network Design, Annals of Operations Research, 106, 229-262 https://doi.org/10.1023/A:1014517910427
  8. Laguna, M., J. P. Kelly, J. L. Gonzalez-Velarde, and F. Glover (1995), Tabu Search for the Multilevel Generalized Assignment Problem, European Journal of Operation Research, 82, 176-189 https://doi.org/10.1016/0377-2217(93)E0174-V
  9. Lee, Y., J. Jung, Y. Kim, S. Lee, N. Park, K. Kang (2006), A New Optimization System for Designing Broadband Convergence Network Access Networks, Korean Management Science Review, 23(2), 161-174
  10. Leung, J. M. Y., and Magnanti, T. L. (1989), Valid Inequalities and Facets of the Capacitated Plant Location Problem, Mathematical Programming, 44, 271-291 https://doi.org/10.1007/BF01587093
  11. Kim, Y. (2007), Combinatorial Optimization Problems in Broadband Convergence Network (BcN) Design, Ph. D. Thesis at Korea University
  12. Nemhauser, G. L., and Wolsey, L. A. (1988), Interger and Combinatorial Optimization, Wiley & Sons, Inc., New York
  13. Riedl, A. (2004), Routing Optimization and Capacity Assignment in Multi-Service IP Networks, Dissertation at Technische Universitat Munchen
  14. Rochat, Y., and E. D. Taillard (1995), Probabilistic Diversification and Intensification in Local Search for Vehicle Routing, Journal of Heuristics, 1, 147-167 https://doi.org/10.1007/BF02430370
  15. Zhao, Z., Q. Liu, and H. Guan (2003), A Method and Simulation Study : Network Dimensioning of the Broadband Residential Ethernetbased Access Network, Multimedia Communication and Network Engineering Research Center