量子协同的二分图最大权完美匹配求解方法.pdfVIP

计 算机 研 究与 发 展 DOI：10．7544／issn1OOO一1239．2014 JournalofComputerResearchandDevelopment 51(11)：2573—2584，2014 量子协 同的二分图最大权完美匹配求解方法 印桂生 崔晓晖2董红斌 董宇欣 崔 (哈尔滨工程大学计算机科学与技术学 院 哈尔滨 150001) (北京林业大学信息学院 北京 100083) 。(哈尔滨理工大学软件学院 哈尔滨 150001) (yinguisheng@hrbeu．edu．cn) Quantum—CooperativeMethodforMaximum WeightPerfectMatchingProblem of BipartiteGraph YinGuisheng ，CuiXiaohui～，DongHongbin ，DongYuxin ，andCuiXiang，。 (CollegeofComputerScienceandTechnology，HarbinEngineeringUniversity，Harbin150001) 。(SchoolofInformationScienceandTechnology，BeijingForestryUniversity，Beijng100083) 。(CollegeofSoftware，HarbinUniversityofScienceandTechnology，Harbin150001) Abstract Mostcombinationa1optimizationproblemsO{informationsciencecanbeabstractedintothe maximum weightperfectmatchingproblem ofbipartitegraph．Duetothegrowth in theamountof data，classicalalgorithmsofsolvingthematchingproblem ofbipartitegraph aredifficulttobalance thecontradictionbetweentheefficiencyofthealgorithmsandtheprecisionofthesolutions．Basedon thispoint，anintelligentoptimizationmethod to solvethegeneralmaximum weightperfectmatching problem isproposed．Themethodconvertsthematrixform ofanoriginalcandidatematchingsolution into the evolution basis which the intelligentalgorithm can handle，and adaptively chooses the effectively evolutionary strategies from the improved discrete particle swarm optim ization and simulated annealing based on the off—spring selection and the quantum—cooperative process，and moreover，itmaintainsthe steady evolution andpromotstherapid convergenceofthepopulation． Accordingtotheexperimentalresultsofthetestfunctionswith thevarioustypesand thematching matrixeswiththevariousdimensions，theproposedmethodoutperformsotheralgorithmsunderthe conditionoftherestricted iteration，and presentsthehigher convergenceprecision and the faster convergencespeed，aswellastheadaptabilit