清华大学遗传算法课件.ppt

清华大学遗传算法课件.ppt

ID:57171336

大小:958.00 KB

页数:89页

时间:2020-08-02

清华大学遗传算法课件.ppt_第1页
清华大学遗传算法课件.ppt_第2页
清华大学遗传算法课件.ppt_第3页
清华大学遗传算法课件.ppt_第4页
清华大学遗传算法课件.ppt_第5页
资源描述:

《清华大学遗传算法课件.ppt》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、7.MinimumSpanningTreeProblemGraduateSchoolofInformation,ProductionandSystems,WasedaUniversity7.MinimumSpanningTreeProblemMulticriteriaMinimumSpanningTree(mc-MST)1.1BasicConceptofmc-MST1.2GeneticAlgorithmsApproach1.3GAprocedureformc-MST1.4NumericalExperiments2.Degree-constrainedM

2、inimumSpanningTree(dc-MST)2.1BasicConceptofdc-MST2.2GeneticAlgorithmsApproach2.3GAprocedurefordc-MST2.4NumericalExperiments3.Degree-basedPermutationGAfordc-MST3.1ConceptonDegree-basedPermutationGA3.2GeneticAlgorithmsApproach3.3Degree-basedPermutationGAfordc-MST3.4NumericalExperi

3、mentsLeaf-constrainedMinimumSpanningTree4.1BasicConceptoflc-MST4.2GeneticAlgorithmsApproach4.3GAprocedureforlc-MST4.4NumericalExperiments7.MinimumSpanningTreeProblemTheMinimumSpanningTree(MST)problemwasfirstformulatedbyBoruvkain1926whenhedevelopedasolutiontofindingthemosteconomi

4、callayoutofapower-linenetwork.Graham,R.&P.Hell:Onthehistoryoftheminimumspanningtreeproblem,AnnalsoftheHistoryofComputing,vol.7,pp.43-57,1985.Sincethentheminimumspanningtreeformulationhasbeenwidelyappliedtomanycombinatorialoptimizationproblems:TransportationproblemsTelecommunicat

5、ionnetworkdesignDistributionsystemsetc.Kershenbaum,A.:TelecommunicationsNetworkDesignAlgorithms,McGrawHill,NewYork,1993.Introduction7.MinimumSpanningTreeProblemMinimumSpanningTree(MST)problemisoneofthetraditionaloptimizationproblems.Givenafiniteconnectedgraph,theproblemistofinda

6、least-weightsubgraphconnectingallvertices.(i,j)wij(1,2)2(1,6)5(1,8)3(2,3)4(2,8)6(3,4)2(3,9)2(4,5)1(4,9)8(5,6)6(5,7)2(6,7)7(7,8)1(7,9)4(8,9)3DatatableofexamplenetworkBasicConceptofMinimumSpanningTreeProblem126837954253674132461282ijwijTavakoly.,B.:GeneExpressionDataClusteringWith

7、MinimumSpanningTree,DepartmentofInformationSystemsandComputing,BrunelUniversity,May2003.Tablefornon-directedgraphFig.7.1Exampleofnetworkmodel7.MinimumSpanningTreeProblemNotationsIndicesi,j:theindexofnode,i,j=1,2,…,nParametersn:thenumberofnodesinthenetworkV:thefinitesetofnodes(ve

8、rtices)representingterminalsS:thesubsetofnodesw

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。