Title: QUANTUM GENETIC ALGORITHM FOR DEGREE-CONSTRAINED MINIMUM SPANNING TREE
Abstract:Degree-constrained minimum spanning tree problem is NP complete,but in reality has very important value.degree-constrained minimum spanning tree problem using quantum genetic algorithm to solve the pr...Degree-constrained minimum spanning tree problem is NP complete,but in reality has very important value.degree-constrained minimum spanning tree problem using quantum genetic algorithm to solve the problem.And the basic quantum genetic algorithm is improved.For degree-constrained minimum spanning tree problem characteristics,the design of a new quantum encoding algorithm to ensure access to feasible solutions;and ideas with the combination of depth-first search,which guarantees connectivity of the tree;through numerical tests validate the new algorithm is feasible sex,compared with other algorithms,and achieved good results.Read More
Publication Year: 2010
Publication Date: 2010-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot