Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2007.14-A.5.317

A Proposal of Heuristic Using Zigzag Steiner Point Locating Strategy for GOSST Problem  

Kim, In-Bum (김포대학 인터넷정보과)
Kim, Chae-Kak (김포대학 인터넷정보과)
Publication Information
The KIPS Transactions:PartA / v.14A, no.5, 2007 , pp. 317-326 More about this Journal
Abstract
We propose more enhanced heuristic for the GOSST(Grade of Services Steiner Minimum Tree) problem in this paper. GOSST problem is a variation of Steiner Tree problem and to find a network topology satisfying the G-Condition with minimum network construction cost. GOSST problem is known as one of NP-Hard or NP-Complete problems. In previous our research, we proposed a heuristic employing Direct Steiner Point Locating strategy with Distance Preferring MST building strategy. In this paper, we propose new Steiner point locating strategy, Zigzag Steiner point Locating strategy. Through the results of out experiments, we can assert this strategy is better than our previous works. The Distance Zigzag GOSST method which hires the Distance Preferring MST building strategy and Zigzag Steiner point Locating strategy defrays the least network construction cost and brings 31.5% cost saving by comparison to G-MST, the experimental control and 2.2% enhancement by comparison to the Distance Direct GOSST method, the best GOSST method in our previous research.
Keywords
GOSST(Grade of Services Stainer Minimum Tree); Steiner Point; Minimum Spanning Tree; MST; Steiner Point Locating Strategy; MST Building Strategy; Zigzag Locating; Distance Preferring; G-Condition; G-MST;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D.Z, Du and F.K. Hwang, 'An Approach for Providing Lower Bounds; Solution of Gilbert-Pollak Conjecture on Steiner Ratio', Proceedings of IEEE 31sy FOCS, pp.76-85, 1990   DOI
2 S. Arora, 'Polynomial-Time Approximation Schemes for Euclidean TSP and Other Geometric Problems', Proceeding of 37th IEEE Symposium on Foundations of Computer Science, pp.2-12, 1996   DOI
3 I. Kim, C. Kim and S.H. Hosseini, 'A Heuristic Using GOSST with 2 Connecting Strategies for Minimum Construction Cost of Network', International Journal of Computer Science and Network Security, Vol.6, No.12, pp.60-72, 2006
4 E.J. Cockayne and D.E. Hewgrill, 'Exact Computation of Steiner Minimal Trees in the Plane', Information Processing Letters, Vol.22, pp.151-156, 1986   DOI   ScienceOn
5 G.H. Lin and G.L. Xue , 'Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-length', Information Processing Letters, pp.53-57, 1999   DOI   ScienceOn
6 G.L. Xue, G.H. Lin and D.Z. Du, 'Grade of Service Steiner Minimum Trees in Euclidean Plane', Algorithmica, Vol.31, pp.479-500, 2001   DOI
7 J. Kim and I. Kim, 'Approximation Ratio 2 for the Minimum Number of Steiner Points', Journal of KISS, pp.387-396, 2003   과학기술학회마을
8 J. Kim, M. Cardei, I. Cardei and X. Jia, 'A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem', Algorithrnica, Vol.42, pp.109-120, 2005
9 T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2nd Ed., MIT Press, 2001
10 E.J. Cockayne and D.E. Hewgrill, 'Improved Computation of Plane Steiner Minimal Tree', Algorithrnica, Vol.7, pp.219-229, 1992   DOI
11 F.K. Hwang, 'A Primer of the Euclidean Steiner problem', Annals of Operations Research, Vol.33, pp.73-84, 1991   DOI
12 I. Kim and C. Kim, 'An Enhanced Heuristic Using Direct Steiner Point Locating and Distance Preferring MST Building Strategy for GOSST Problem', International Journal of Computer Science and Network Security, Vol.7, No.2, pp.164-175, 2007
13 F.K Hwang, D.S. Richards and P. Wmter, 'The Steiner Tree Problem', Annals of Discrete Mathematics, Vol.53, North-Holland, 1992
14 M.J. Smith and B. Toppur, 'Euclidean Steiner Minimal Trees, Minimum Energy Configurations and the Embedding Problem of Weighted Graph in E3', Discrete Applied Mathematics, Vol.71, pp.187-215, 1997   DOI   ScienceOn
15 P. Winter, 'An Algorithm for the Steiner Problem in the Euclidean Plane', Networks, Vol.15, pp.323-345, 1985   DOI   ScienceOn
16 A. Balakrishnan, T.L. Nagnanti and P. Mirchandani, 'Modeling and Heuristic Worst Case Performance Analysis of the Two Level Network Design Problem', Management Science, Vol.40, pp.846-867, 1994   DOI   ScienceOn
17 C. Duin and A. Volgenant, 'The Multi-weighted Steiner Tree Problem', Annals of Operations Research, Vol.33, pp.451-469, 1991   DOI
18 J.R Current, C.S. Revelle and J.L. Cohon, 'The Hierarchical Network Design Problem', European Journal of Operational Research, Vol.27, pp.57-66, 1986   DOI   ScienceOn
19 P. Mirchandani, 'The Multi-tier Tree Problem', INFORMS Journal on Computing, Vol.8, pp.202~218, 1996   DOI   ScienceOn
20 P. Winter and M. Zachariasen, 'Large Euclidean Steiner Minimum Trees: An Improved Exact Algorithm', Networks, Vol.30, pp.149-166, 1998