A deliraitative and combinatorial algorithm for discrete optimum design with different discrete sets

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The sequential delimitative and combinatorial algorithm for optimum design of structure with discrete variables is popularized to the optimum design, in which, the number of elements of the allowable discrete set of design variables is the same, but the allowable discrete sets of design variables are different. Firstly, the optimal problem is converted into several sequential sub-problems with lower dimensions and similar structures by recurrent method. Secondly, the algorithm generates all combinations according to a certain order of the magnitude of objective function by using a multi-level generating method of proceeding for higher place. In the procedure of delimiting, the objective function and constraint functions are converted into new functions by the linear transforms. And, these new functions are used to delimit. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Shi, L., & Fu, H. (2004). A deliraitative and combinatorial algorithm for discrete optimum design with different discrete sets. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3314, 443–448. https://doi.org/10.1007/978-3-540-30497-5_69

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free