Practical Optimization Algorithm for Discrete Variables

Abstract:

Article Preview

In order to solve the optimization problems of discrete variable in mechanism design, beginning vertexes to meet all of performance restriction conditions can be given by the technician from upper boundary of design variables by means of man-machine interactive method. Objective function of each beginning vertex is calculated and arranged from small to large, the vertex of maximum and minimum of objective function are found. The difference between the vertex of minimum and maximum of objective function are calculated and new point is made up from the minimum point and the difference. The new point is used in stead of the vertex of the maximum objective function if the objective function of the new point is less than the maximum of beginning vertexes. The new composite figure is made up again and the new point is calculated until all design variables reach to under boundary. Then the vertex of minimum objective function is regarded to as the optimization point. This method is very fit for the optimization of discrete variables of low dimension and is higher calculation efficiency because the hominine brightness is combined with the high speed calculation ability.

Info:

Periodical:

Edited by:

Bo Zhao, Yidu Zhang, Guanglin Wang, Hai Zhang, Jianbin Zhang and Feng Jiao

Pages:

39-42

DOI:

10.4028/www.scientific.net/AMM.42.39

Citation:

D. S. Wang and A. P. Zhou, "Practical Optimization Algorithm for Discrete Variables", Applied Mechanics and Materials, Vol. 42, pp. 39-42, 2011

Online since:

November 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.