欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
多目标最小生成树问题与度约束最小生成树问题分别是网络优化中两个NP难题，在实际中一直有着重要的应用．本文针对同时考虑多目标和度约束情况下的最小生成树求解问题，采用蚁群优化算法思想，设计了一种求解方案，并在计算机上用Delphi予以实现．经大量数值算例求解测试，验证了算法的有效性和可行性．
英文摘要：
Both multi--criteria minimum spanning tree problem and degree--constrained minimum spanning tree problem are NP--hard problems in network optimization. They always have many important applications in practice. To solve the minimum spanning tree problem by considering both the multi--criteria and degree-- constraints, this paper proposes an algorithm （coded in Delphi） which is based on the ideas of ant colony opti- mization. The computational numerical experiments show the efficiency and effectiveness of the algorithm for the multi--criteria degree--constrained minimum spanning tree problem.
同期刊论文项目
同项目期刊论文
期刊信息
位置：