一种改进的求解TSP问题的近似算法

旅行商问题(TSP)是典型的具有NPC复杂性的组合优化问题。在现有求解TSP问题的2-近似算法closest-point算法基础上,通过对插入点的插入位置进行改进,提出了一种有效的近似算法最近点前后插入法(CPBOA),并采用TSPLIB中的一些典型实例对该算法进行了测试,同时与典型的常数近似比算法MST-PRIM算法和closest-point算法进行了比较。实验结果表明,该算法在求解质量上与closest-point和MST-PRIM算法相比都有很大的改进,而且速度也很快。     

求解矩形装箱问题的一种近似算法

提出了利用近似算法求解二维矩形装箱问题的最小高度的一种方法。该方法基于启发式递归策略和遗传算法。利用启发式递归策略把所有大小各异的矩形都装入宽度固定的矩形容器中，并计算装完后所需容器的高度，用遗传算法的进化能力优化高度，使得所需容器的高度尽可能小。计算数据证明这种方法能够得到很好的结果，特别是对数据量大的测试问题，效果更好。     

4MC-4型棉柴收获机的研制

新疆具有十分丰富的水土光热资源和得天独厚的气候条件,具有发展棉花生产的巨大优势和潜力,是我国最大的商品棉基地。新疆棉花秸秆资源极其丰富,年产量预计可达５００万ｔ。棉秆具有与木材相似的组成结构,含全纤维５６％,木质素２２％等其它营养成份,所以棉秆综合利用价值很高,它可用作造纸原料,生产人造纤维,同时又可制造高密度板材,是一种很好的木材代用品。棉秆上半部经揉碎后,再通过微生物处理,又可作为畜牧很好的饲料。在棉花生产整个过程中,棉秆收获是劳动强度大,工时消耗多,季节性很强的作业项目。目前,由于新疆棉花…     

求解矩形Packing问题的基于遗传算法的启发式速归策略

An improved heuristic recursive strategy combining with genetic algorithm is presented in this paper. Firstly, this method searches some rectangles, which have the same length or width, to form some layers without waste space, then it uses the heuristic recur sive strategies to calculate the height of the remaining packing order and uses the evolutionary capability of genetic algorithm to reduce the height. The computational results on several classes of benchmark problems have shown that the presented algorithm can compete with known evolutionary heuristics. It performs better especially for large test problems.     

求解矩形Packing问题的基于遗传算法的启发式递归策略

An improved heuristic recursive strategy combining with genetic algorithm is presented in this paper. Firstly, this method searches some rectangles, which have the same length or width, to form some layers without waste space, then it uses the heuristic recursive strategies to calculate the height of the remaining packing order and uses the evolutionary capability of genetic algorithm to reduce the height. The computational results on several classes of benchmark problems have shown that the presented algorithm can compete with known evolutionary heuristics. It performs better especially for large test problems.