For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics

tsp for (int i=0 i<M i++) S[i] = i S[M] = 0 T = 1000 //初始温度1000 Tl = 35000 //内循环次数35000 a = 0.93 //温度下降系数 k = 0 PreMin = 0 Path = GetPath(S) srand((unsigned)time( NULL )) cout<<"The initial Path Diste

对于本项目来说,共有1350组公司财务状况数据,每组数据的输入为10维,代表上述的10个指标,输出为1维,代表公司财务状况,为1时表示财务状况良好,为-1时表示财务状况出现问题。从中随机选取1000组数据作为训练数据,350组数据作为测试数据。根据数据维 数,采用的BP神经网络结构为10—6—1,共训练生成10个BP神经网络弱分类器,最后用10 个弱分类器组成强分类器对公司财务状况进行分类。-For this project, a total of 1350 group company&