基于图染色的频率分配问题的分析-analysis of frequency allocation problem based on graph coloring.docxVIP

  • 9
  • 0
  • 约4.22万字
  • 约 53页
  • 2018-05-20 发布于上海
  • 举报

基于图染色的频率分配问题的分析-analysis of frequency allocation problem based on graph coloring.docx

基于图染色的频率分配问题的分析-analysis of frequency allocation problem based on graph coloring

(3)Forsomewell-knownbenchmarkproblems,theresultsareobtainedbythesimulationonMicrosoftVisualStudio.NET2013platform.Theexperimentalresultsshowthatthehybridoptimizationalgorithmbasedonvertexcoloringhasgoodoptimizationabilityandfasterconvergencespeed.Withconsideringthefairnessofusers,thisalgorithmcanobtainedsolutionaccuratelywhichmeetsthegoalsoftheglobaloptimal.UsingthePhiladelphiainstanceconductsimulationtest,experimentalverifyT-coloringsoptimizationalgorithmimprovestheanti-interferenceabilitybetweensignalstoacertainextent,andmaximizesthevalueoffrequencyresources.Keywords:frequencyassignment;grap

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档