.png){kind=icon}
返回
Genetic algorithm approach on multi-criteria minimum spanning tree problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(98)00016-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Minimum Spanning Tree (MST) problem is of high importance in network optimization. The multi-criteria MST (mc-MST) is a more realistic representation of the practical problem in the real world, but it is difficult for the traditional network optimization technique to deal with. In this paper, a genetic algorithm (GA) approach is developed to deal with this problem. Without neglecting its network topology, the proposed method adopts the Prufer number as the tree encoding and applies the Multiple Criteria Decision Making (MCDM) technique and nondominated sorting technique to make the GA search give out all Pareto optimal solutions either focused on the region near the ideal point or distributed all along the Pareto frontier. Compared with the enumeration method of Pareto optimal solution, the numerical analysis shows the efficiency and effectiveness of the GA approach on the mc-MST problem. (C) 1999 Elsevier Science B.V. All rights reserved.
Keyword:
genetic algorithms
minimum spanning tree
multiple criteria decision making
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Reversible Focal Splenial Lesion of the Corpus Callosum on MR Images in a Patient with Malnutrition
OAAI
OAAI分享收藏
分享收藏Effectiveness of nifedipine and deflazacort in the management of distal ureter stones.png)
Urology
UrologyIF0
PREAI
分享收藏
查看更多内容