The Process of Ant Algorithm for Solving the Degree-Constrained Euclidean Steiner Minimal Tree

Shu Juan Dong; Ai Ping Ding

doi:10.4028/www.scientific.net/AMR.846-847.1330

Paper Titles

A New Method of High-Precision Coordinate Transformation Research Based on Bursa Model
p.1312

Modified PSO Algorithm for Solving the Eigenvalues of Matrix
p.1316

A Geometric Constraints Based Single-Image Reconstruction Method
p.1320

Recursive Enumeration K-Best Decoding Algorithm in Chinese Input Method Application
p.1326

The Process of Ant Algorithm for Solving the Degree-Constrained Euclidean Steiner Minimal Tree
p.1330

Data Processing Modeling for Reference Materials Preparation
p.1334

Face Image Segmentation Technology Research
p.1339

Identification of Dangerous Driving Behaviors Based on Neural Network and Bayesian Filter
p.1343

Information Reduction Model about Rough Set Theory
p.1347

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 846-847The Process of Ant Algorithm for Solving the...

The Process of Ant Algorithm for Solving the Degree-Constrained Euclidean Steiner Minimal Tree

Abstract:

The degree-constrained Euclidean Steiner minimal tree problem was discussed based on the Euclidean Steiner minimal tree with each original point being added with a degree constraint. The property of the problem was analyzed and the implementation process of solving the problem by using the ant algorithm was presented.The algorithms is coded in Delphi and run on the Windows XP environment.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 846-847)

Pages:

1330-1333

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.846-847.1330

Citation:

Cite this paper

Online since:

November 2013

Authors:

Shu Juan Dong*, Ai Ping Ding

Keywords:

Algorithm (GA), Degree-Constrained, Euclidean Steiner Minimal Tree

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] GILBERTEN, POLLAKHO. Steiner minimal trees[J]. SIAMJApplMath, 1968, 16 (1) : 1-29.

Google Scholar

[2] MACULANN, MICHELONP, XAVIERAE. The euclidean steiner problem in Rn: A mathematical programming formulation[J]. Annals of Operations Research, 2000, 96 (11) : 209-220.

Google Scholar

[3] DUDZ, HWANGFK. The Steiner ratio conjecture of Gilbert Pollakistrue[J]. Algorithmica, 1992, 7 (1) : 121-135.

Google Scholar

[4] WINTERP. An algorithm of the Steiner problem in the Euclidean plane[J]. Networks, 1985, 15 (2) : 233-245.

Google Scholar

[5] GAREYM, GRAHAMRL, JOHNSONDS. The complexity of computin g Steiner minimum tree[J]. SIAM Journal of Applied Mathematics, 1977, 32 ( 4) : 835-859.

Google Scholar

[6] DORIGOM, MANIEZZOV, COLORNIA. Ant system: Optimization by acolony of cooperating Agents[J]. IEEE Transactions on Systems, Man, and Cybernetics, PartB, 1996, 26 (1) : 29-41.

Google Scholar