Optimal Solution of Algorithms Survey

Chang Yuan; Zhang Zhi Yuan; Luo Jian; Qu Jing

doi:10.16670/j.cnki.cn11-5823/tu.2017.03.20

Citation: Chang Yuan, Zhang Zhi Yuan, Luo Jian, Qu Jing. Optimal Solution of Algorithms Survey. Journal of Information Technologyin Civil Engineering and Architecture, 2017, 9(3): 115-118. doi: 10.16670/j.cnki.cn11-5823/tu.2017.03.20

2017, 9(3): 115-118. doi: 10.16670/j.cnki.cn11-5823/tu.2017.03.20

Optimal Solution of Algorithms Survey

Chang Yuan ^1,, Zhang Zhi Yuan ^2,, Luo Jian ^1,, Qu Jing ^3,

1.	Beijing university of civil engineering and architecture, Beijing 100044, China
2.	China Academy of Building Research, Beijing 100013, China
3.	CABR Technology Co., Ltd., Beijing 100013, China

Web Publishing Date: 2017-06-01

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.

Key words: Rebar Cutting, Combinatorial Optimization, Genetic Algorithm, Simulated Annealing, Heuristic Algorithm

[1]	玄光南, 程润伟.遗传算法与工程优化[M].北京:清华大学出版社.2004:41-54.
[2]	彭文利, 陈淑如, 张定华.优化排料算法的研究现状与趋势[J].模具工业.2006, 32(8).
[3]	M Hifi.Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems[J].Journal of Combinatorial Optimization. 2004, 8 (1):65-84.doi: 10.1023/B:JOCO.0000021938.49750.91
[4]	肖专文.求解复杂工程优化问题的一种实用方法[J].水利学报.1999, (2):23-27.
[5]	蔡依平. 工程建设项目物流关键问题优化理论与方法研究[D]. 上海: 同济大学. 2007.
[6]	赵文余. 钢材下料问题的多目标智能优化算法研究[D]. 河北: 河北农业大学. 2011.
[7]	徐磊. 基于遗传算法的多目标优化问题的研究与应用[D]. 湖南: 中南大学. 2007.
[8]	JOHN H. HOLLAND.Adaptation In Natural And Artificial Systems[M].Ann Arbor, MI:University of Michigan Press.1992.
[9]	马永杰.遗传算法研究进展[J].计算机应用研究.2012.29(4):1201-1205.
[10]	王银年. 遗传算法的研究与应用——基于3PM交叉算子的退火遗传算法及应用研究[D]. 江苏: 江南大学. 2009.
[11]	葛继科, 邱玉辉等.遗传算法研究综述[J].计算机应用研究.2008, 25(10) : 2911-2916.doi: 10.3969/j.issn.1001-3695.2008.10.008
[12]	史忠植.高级人工智能第三版[M].北京:科学出版社.2011:367-397.
[13]	Steinbrunn M, Moerkotte G, Kemper A. Heuristic and randomized optimization for the join ordering problem[J].VLDB Journal.1997, 6 (3) :8-17.
[14]	http://www.cnblogs.com/heaad/.
[15]	段国林等.启发式算法及其在工程中的应用[J].机械设计, 2000, 17(6):1-5.
[16]	http://baike.baidu.com/link?url=Lty_Vs1OQMzKs3a6_lE3cNW1tI-itffBy19na2SCR2Gq_v2xRD6zldvF4N62SSkZY2MTcuq3B955CffSaEDSuEzrDhneY8s04Qkjed-7HPFBN4iZh2kTwLgOiqaqp2yw.
[17]	李斌, 贺飞.求解一维下料问题的改进混合遗传算法[N].内蒙古大学学报, 2014, 45(3):245-250.
[18]	信息处理中的组合优化: 装箱问题.
[19]	段国林. 基于智能工程的集成化智能设计系统及其在钟手表设计中的应用[D]. 天津: 天津大学. 1997.
[20]	华中平, 张立.基于线性规划的角钢优化下料算法研究[J].湖北工业大学学报, 2005, 20(5):15-18.
[21]	XShen, YLi, BZheng. General Particle Swarm Optimization Based on Simulated Annealing for Multi-Specification One-dimensional Cutting Stock Problem [J].COMPUTATIONAL INTELLIGENCE & SECURITY, 2007, 4456:67-76.
[22]	TW Leung, CHyung, MDTroutt.Applications of genetic search and simulated annealing to the two-dimensional non-guillotine cutting stock problem [J].Computers & Industrial Engineering, 2001, 40(3):201-214.

Metrics

PDF Downloads(30)
Abstract views(2501)
HTML views(1180)

Related Keywords

On this site
Rebar Cutting Combinatorial Optimization Genetic Algorithm Simulated Annealing Heuristic Algorithm
On Google Scholar
Rebar Cutting Combinatorial Optimization Genetic Algorithm Simulated Annealing Heuristic Algorithm
On PubMed
Rebar Cutting Combinatorial Optimization Genetic Algorithm Simulated Annealing Heuristic Algorithm

Optimal Solution of Algorithms Survey

Metrics

Other articles by authors

Related Keywords

Figures And Tables