A New Geometric Algorithm for Steiner Minimal Tree Problem by referring Visualization Experiment

It is well known that the Steiner minimal tree problem is one of the classic nonlinear combinatorial optimization problems. A visualization experiment approach succeeds in generating Steiner points automatically, and showing the system shortest path, named Steiner minimum tree, physically and intuit...

Full description

Saved in:
Bibliographic Details
Published in:2009 International Conference on Information Engineering and Computer Science pp. 1 - 5
Main Authors: Yang, ZongXiao, Hao, JieYu, Gao, YanPing, Ye, Kun
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2009
Subjects:
Biomembranes
Combinatorial optimization
Control systems
Educational institutions
geometry-experiment algorithm(GEA)
Heuristic algorithms
Information science
Nonlinear control systems
Steiner minimal tree
Steiner trees
Surface tension
Surface-mount technology
System shortest path
Visualization
ISBN:9781424449941, 1424449944
ISSN:2156-7379
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is well known that the Steiner minimal tree problem is one of the classic nonlinear combinatorial optimization problems. A visualization experiment approach succeeds in generating Steiner points automatically, and showing the system shortest path, named Steiner minimum tree, physically and intuitively. However, it is difficult to forming stabilized system shortest path when the number of given points are increased and irregular distribution. A new algorithm, geometry-experiment algorithm (GEA), is constructed to solve system shortest path using the nature of Delaunay diagram and basic philosophy of geo-Steiner algorithm, and matching up with the visualization experiment approach (VEA) when given points are increasing in this paper. The approximate optimizing results are received by GEA and VEA for some practical power transmission grid system. The validity of GEA was proved by solving practical problems in engineering, experiment and comparative analysis. And the global shortest path can be obtained by GEA successfully with several actual calculations.
ISBN:9781424449941
1424449944
ISSN:2156-7379
DOI:10.1109/ICIECS.2009.5367134