Abstract:
|
This thesis mainly studies the algorithm and realization method for blanking part optimal layout,and puts forward an idea of using parallel moving algorithm and genetic simulated annealing algorithm to solve the problem of blanking part layout.They overcome large calculation of parallel moving algorithm,which have the advantages of good optimal effect,high automatization and can fast and correctly obtain the optimal results.
|
Funds:
|
|
AuthorIntro:
|
|
Reference:
|
[1]李红军.模拟退火遗传算法的性能评价[J].湖南城市学院学报,2003,24(3):111 113.
[2]林好转.平行线分割一步平移法排样算法的研究[J].锻压技术,1994,19(5):33 35.
[3]陶献伟,王华昌,李志刚.基于填充算法的矩形件排样优化求解[J].中国机械工程,2003,14(13):1104 1107.
[4]邢文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,1998.
|
Service:
|
【This site has not yet opened Download Service】【Add
Favorite】
|
|
|