最优解算法综述  

Optimal Solution of Algorithms Survey

作　　者：常媛[1] 张志远[2] 罗健[1] 曲径[3] 

机构地区：[1]北京建筑大学,北京100044 [2]中国建筑科学研究院,北京100013 [3]建研科技股份有限公司,北京100013

出　　处：《土木建筑工程信息技术》2017年第3期115-118,共4页Journal of Information Technology in Civil Engineering and Architecture

摘　　要：本文研究了钢筋下料优化的离散组合最优化问题,并对组合优化中常用的遗传算法、模拟退火算法、启发式算法进行了综述,探讨了各自的特点并进行比较。最后根据近几年国内外的文献发现,单独的某个算法找到最优解存在随机性,且得到最优解会花费大量时间。解决这一问题的方法是将几种算法根据具体工况进行组合,组合后的算法的效率更高。This paper points out that the optimization of rebar cutting is a complex discrete combinatorial optimization problem,summarizes the Genetic Algorithm,simulates Annealing and Heuristic Algorithm that in broad usage as a method for combinatorial optimization,and discusses the characteristics of each method. Finally,we know that an individual algorithm find the optimal solution randomly and waste a lot of time,according to the literature in recent years. The method to solve the problem is to combine different algorithm in special condition,and this kind of algorithm is more efficient.

关 键 词：钢筋下料 组合优化 遗传算法 模拟退火算法 启发式算法 

分 类 号：TU51[建筑科学—建筑技术科学] TU723.32