• Title/Summary/Keyword: Steiner point

Search Result 15, Processing Time 0.029 seconds

A Proposal of Heuristic Using Zigzag Steiner Point Locating Strategy for GOSST Problem (GOSST 문제 해결을 위한 지그재그 스타이너 포인트 배치 방법을 이용한 휴리스틱의 제안)

  • Kim, In-Bum;Kim, Chae-Kak
    • The KIPS Transactions:PartA
    • /
    • v.14A no.5
    • /
    • pp.317-326
    • /
    • 2007
  • 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.

Genetic Algorithm Using-Floating Point Representation for Steiner Tree (스타이너 트리를 구하기 위한 부동소수점 표현을 이용한 유전자 알고리즘)

  • 김채주;성길영;우종호
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.5
    • /
    • pp.1089-1095
    • /
    • 2004
  • The genetic algorithms have been used to take a near optimal solution because The generation of the optimal Steiner tree from a given network is NP-hard problem,. The chromosomes in genetic algorithm are represented with the floating point representation instead of the existing binary string for solving this problem. A spanning tree was obtained from a given network using Prim's algorithm. Then, the new Steiner point was computed using genetic algorithm with the chromosomes in the floating point representation, and it was added to the tree for approaching the result. After repeating these evolving steps, the near optimal Steiner tree was obtained. Using this method, the tree is quickly and exactly approached to the near optimal Steiner tree compared with the existing genetic algorithms using binary string.

Optimal location of Batcher Plant using Modified Steiner point (수정된 Steiner Point를 이용한 Batcher Plant의 최적 위치 선정)

  • Ha, Kwon-Yeol;Lee, Sang-Joong
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.29 no.10
    • /
    • pp.39-46
    • /
    • 2015
  • REMICON(Ready Mixed Concrete), the most essential material of construction work, is produced from facility called "Batcher plant." In order to produce Remicon, Batcher Plant needs to be supplied with basic raw material such as ballast, sand, cement, admixture and water. In remicon industry, overland transport vehicles are used during the whole manufacturing process from producing to infilling at the construction site. Thus, the transportation cost sums up be to 20 percent of whole manufacturing cost and transport capacity and distance travelled have direct and major effect on manufacturing costs. This paper suggests a method to find optimal location of batcher plant using modified Steiner point, suggesting the most effective and flexible connection through among construction site, aggregate, cement and remicon producing plant. This paper also proposes reducing of transport cost at maximum 60% by calculation through optimized plant location. The modified Steiner point theory proposed in this paper also can be applied to optimal location of a $2^{ry}$ substation or MCC panel for minimizing of power loss, voltage drop, line distance and etc.

Cost Reduction through Shortest Path Connection of Electric Power Line (전선의 최단거리 루트 선정을 통한 공사비용 절감 방안)

  • Lee, Sang-Joong;Yoon, Jun-Young
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.25 no.5
    • /
    • pp.34-38
    • /
    • 2011
  • The shorter the electric power line is, the less its cost becomes. In this paper, the Steiner tree is applied to find the shortest path of the electric power line to obtain resultant cost reduction. Up to 18.3[%] of length reduction can be expected compared to conventional method when the lines are connected through the Steiner points, which also can result in appreciable cost reduction.

A Study on G-Condition Examination Scheme to Improve the Heuristics for Grade Of Services Steiner Minimum Tree Problem (Grade Of Services Steiner Minimum Tree 문제에 대한 휴리스틱의 성능 개선을 위한 G-Condition 검사 방법에 대한 연구)

  • Kim, In-Bum;Kim, Chae-Kak
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.1
    • /
    • pp.44-52
    • /
    • 2008
  • This paper is on the enhancement of our heuristics for Grade Of Services Steiner Minimum Tree (GOSST) problem that can apply to the design of communication networks offering manifold grade of services in multimedia communication area. GOSST problem known as one of NP-Hard problems asks for a network topology meeting the G-Condition with minimum construction cost. In our prior researches, we proposed some heuristics for the problem. In this paper, we suggest a strategy of G-Condition scrutiny sequence to fortify our previous heuristics. In the experiment results, the ameliorated achieves 71.9% economy of execution times, 28.9% of required Steiner points and 1.1% of network construction costs.

  • PDF

A Design of Efficient Cluster Sensor Network Using Approximate Steiner Minimum Tree (근사 최소 스타이너 트리를 이용한 효율적인 클러스터 센서 네트워크의 구성)

  • Kim, In-Bum
    • The KIPS Transactions:PartA
    • /
    • v.17A no.2
    • /
    • pp.103-112
    • /
    • 2010
  • Cluster sensor network is a sensor network where input nodes crowd densely around some nuclei. Steiner minimum tree is a tree connecting all input nodes with introducing some additional nodes called Steiner points. This paper proposes a mechanism for efficient construction of a cluster sensor network connecting all sensor nodes and base stations using connections between nodes in each belonged cluster and between every cluster, and using repetitive constructions of approximate Steiner minimum trees. In experiments, while taking 1170.5% percentages more time to build cluster sensor network than the method of Euclidian minimum spanning tree, the proposed mechanism whose time complexity is O($N^2$) could spend only 20.3 percentages more time for building 0.1% added length network in comparison with the method of Euclidian minimum spanning tree. The mechanism could curtail the built trees' average length by maximum 3.7 percentages and by average 1.9 percentages, compared with the average length of trees built by Euclidian minimum spanning tree method.

Acceleration of Delaunay Refinement Algorithm by Geometric Hashing (기하학적 해싱을 이용한 딜러니 개선 알고리듬의 가속화)

  • Kim, Donguk
    • Korean Journal of Computational Design and Engineering
    • /
    • v.22 no.2
    • /
    • pp.110-117
    • /
    • 2017
  • Delaunay refinement algorithm is a classical method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. It computes the Delaunay triangulation for given points and edges to obtain an initial solution, and update the triangulation by inserting steiner points one by one to get an improved quality triangulation. This process repeats until it satisfies given quality criteria. The efficiency of the algorithm depends on the criteria and point insertion method. In this paper, we propose a method to accelerate the Delaunay refinement algorithm by applying geometric hashing technique called bucketing when inserting a new steiner point so that it can localize necessary computation. We have tested the proposed method with a few types of data sets, and the experimental result shows strong linear time behavior.

Virtual Euc1idean Point based Multicast routing scheme in Underwater Acoustic sensor networks (수중 센서 네트워크에서 가상의 유클리디언 포인트를 이용한 멀티캐스트 전송기법)

  • Kim, Tae-Sung;Park, Kyung-Min;Kim, Young-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7B
    • /
    • pp.886-891
    • /
    • 2011
  • Multicast has been a key routing service for efficient data dissemination in underwater acoustic sensor networks. In sensor networks, there are several multicast routing protocol which reflects sensor network nature. However, existing routing scheme was not targeted at underwater acoustic sensor networks which is hard to provide battery continually. Therefore, a specialized routing algorithm is essential for acoustic sensor networks. In this paper, we propose angle aided multicast routing algorithm for decreasing routing computation complexity, including virtual Euclidean Steiner point. Simulation results show better performance than exist routing Position Based Multicast, Geographic Multicast Routing. such as low computation capability and limited power consumption.

An Approximation Scheme For A Geometrical NP-Hard Problem (기하학적 NP-hard 문제에 대한 근사 접근법)

  • Kim, Joon-Mo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.8
    • /
    • pp.62-67
    • /
    • 2007
  • In some wireless sensor networks, the sensor nodes are required to be located sparsely at designated positions over a wide area, introducing the problem of adding minimum number of relay nodes to interconnect the sensor nodes. The problem finds its form in literature: the Minimum number of Steiner Points. Since it is known to be NP-hard, this paper proposes an approximation scheme to estimate the minimum number of relay nodes through the properties of the abstract from. Reducing the number of nodes in a sensor network, the amount of data exchange over the net will be far decreased.

Point-to-Multipoint Minimum Cost Flow Problem with Convex Cost Function (콘벡스 비용함수를 갖는 점-대-다중점 최소비용 흐름문제)

  • 박구현;신용식
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.4
    • /
    • pp.15-25
    • /
    • 2000
  • In this paper, we introduce a point-to-multipoint minimum cost flow problem with convex and demand splitting. A source node transmits the traffic along the tree that includes members of the point-to-multipoint connection. The traffic is replicated by the nodes only at branch points of the tree. In order to minimize the sum of arc costs, we assume that the traffic demand can be splitted and transmitted to destination nodes along different trees. If arc cost is linear, the problem would be a Steiner tree problem in networks eve though demand splitting is permitted. The problem would be applied in transmitting large volume of traffic from a serve to clients in Internet environments. Optimality conditions of the problem are presented in terms of fair tree routing. The proposed algorithm is a finite terminating algorithm for $\varepsilon$-optimal solution. convergence of the algorithm is obtained under monotonic condition and strict convexity of the cost function. Computational experiences are included.

  • PDF