在欧氏Steiner最小树的基础上,对每个正则点加上了度约束限制,提出了度约束欧氏Steiner最小树问题,分析了该问题的特性,给出了该问题的模拟退火和蚂蚁算法求解过程,并使用Delphi语言编程,在Windows XP平台上运行通过.通过大量算例的计算结果验证了该问题的实用性及算法的有效性.
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 simulated annealing algorithm and the ant algorithm was presented. Both algorithms are coded in Delphi and run on the Windows XP envirnment. Series of numerical examples were tested and the efficiency of these algorithms were validated.