IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/367107.html
   My bibliography  Save this article

Geometry-Experiment Algorithm for Steiner Minimal Tree Problem

Author

Listed:
  • Zong-Xiao Yang
  • Xiao-Yao Jia
  • Jie-Yu Hao
  • Yan-Ping Gao

Abstract

It is well known that the Steiner minimal tree problem is one of the classical 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 form stabilized system shortest path when the number of given points is increased and irregularly distributed. Two algorithms, geometry algorithm and geometry-experiment algorithm (GEA), are constructed to solve system shortest path using the property of Delaunay diagram and basic philosophy of Geo-Steiner algorithm and matching up with the visualization experiment approach (VEA) when the given points increase. The approximate optimizing results are received by GEA and VEA for two examples. 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.

Suggested Citation

  • Zong-Xiao Yang & Xiao-Yao Jia & Jie-Yu Hao & Yan-Ping Gao, 2013. "Geometry-Experiment Algorithm for Steiner Minimal Tree Problem," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-10, April.
    • Handle: RePEc:hin:jnljam:367107
    DOI: 10.1155/2013/367107
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2013/367107.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/JAM/2013/367107.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/367107?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnljam:367107. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.