Browse > Article

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)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.34, no.2, 2008 , pp. 205-215 More about this Journal
Abstract
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.
Keywords
Tabu Search; Converged Access Network Design; Quality of Service (QoS); Three-Level Capacitated Facility Location-Allocation Problem (CFLP);
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 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   DOI   ScienceOn
2 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   과학기술학회마을
3 Riedl, A. (2004), Routing Optimization and Capacity Assignment in Multi-Service IP Networks, Dissertation at Technische Universitat Munchen
4 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
5 Girard, A., B. Sansò, and L. Dadjo (2001), A Tabu Search Algorithm for Access Network Design, Annals of Operations Research, 106, 229-262   DOI
6 Kim, Y. (2007), Combinatorial Optimization Problems in Broadband Convergence Network (BcN) Design, Ph. D. Thesis at Korea University
7 Aardal, K., Pochet, Y., and Wolsey, L. A. (1995), Capacitated Facility Location : Valid Inequalities and Facets, Mathematics of Operations Research, 20, 562-582   DOI   ScienceOn
8 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
9 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   DOI   ScienceOn
10 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   DOI
11 Leung, J. M. Y., and Magnanti, T. L. (1989), Valid Inequalities and Facets of the Capacitated Plant Location Problem, Mathematical Programming, 44, 271-291   DOI
12 Rochat, Y., and E. D. Taillard (1995), Probabilistic Diversification and Intensification in Local Search for Vehicle Routing, Journal of Heuristics, 1, 147-167   DOI
13 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   DOI   ScienceOn
14 Nemhauser, G. L., and Wolsey, L. A. (1988), Interger and Combinatorial Optimization, Wiley & Sons, Inc., New York
15 Aardal, K. (1998), Reformulation of Capacitated Facility Location Problems: How Redundant Information Can Help, Annals of Operations Research, 82, 289-308   DOI