Journal of Guangdong University of Technology ›› 2010, Vol. 27 ›› Issue (3): 46-50.

• Comprehensive Studies • Previous Articles     Next Articles

Comparison Between the Traditional and Election-survey Algorithms for M echanical Optimum Design

  

  1. 1．Faculty of Materials and Energy，Guangdong University of Technology，Guangzhou 5 10006，China；
    2．Faculty of Electromechanical Engineering，Guangdong University of Technology，Guangzhou 510006，China
  • Online:2010-09-25 Published:2010-09-25

HTML

PDF (PC)

2346

Abstract: The traditional optimized algorithms in machine optimization design are demonstrated．A modern optimized design method-election-survey algorithm is introduced with its theory and characteristics．The results of applying the traditional and the election-survey algorithms are obtained，based on the optimum design of the box-shaped cover board and a two-bar truss structure．And then the optimal solutions and the characteristics of the two algorithms aye compared．The results show that the election-survey algorithm is an effective method for mechanic optimum design．

Key words: optimization；election-survey algorithm；mechanical design；penalty function method

[1]孙靖民，梁迎春．机械优化设计[M]．北京：机械工业出版社，2006．

[2]Holland J H．Genetic Algorithms[J]．Scientific American，1992(7)：44-50．

[3]Krikpatrick S，Gelett C，Veechi M．Optimization by simulated annealing[J]．Science，1983，220(8)：671-80．

[4]Dorigo M，Maniezzo V，Colorni A．Ant system：Optimization by a colony of cooperating agents[J]．IEEE Trans on system，Man and Cybernetics—Part B，1996，26(1)：2941．

[5]Kennedy J，Eberhart R．Particle swarm optimization[C]∥Proceeding IEEE international Conference on Neural Networks，Piscataway，NJ，USA：IEEE Press，1995，4：1942-1948．

[6]Cvijovic D，Kilnowski J．Tabuo Search：An Approach to the Multiple Minima Problem[J]．Science：1995，67(3)：664-666．

[7]贺春华，吕文阁，张湘伟．竞选算法及其在函数全局最优化问题中的应用[J]．计算机工程与应用，2010，46(11)：196-199．

[8]罗述全．传统优化算法与遗传算法的比较[J]．湖北工业大学学报，2007，22(3)：32-35．

[9]陈立周．机械优化设计方法[M]．北京：冶金工业出版社，2005．

[10]Joines J A，Houck C R．On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA’S[C]／／Proceedings of the First IEEE

Conference on Evolutionary Computation，Piscataway，NJ，USA：IEEE Press，1994：579-584．

[11]Wolpert D H，Macready W G．No Free Lunch Theorems for Optimiz~ion[J]．IEEE Transactions on Evolutionary Computation，1997，1(1)：67-82．
No related articles found!
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright © 2017 Journal of Guangdong University of Technology
Add：729 East Dongfeng RD., Guangzhou PRC. Postcode: 510090
Tel：020-37626653,020-37626139,020-37626396
Email：xbzrb@gdut.edu.cn
Supported:Beijing Magtech