The definition of local optimum solution of the discrete optimi:ation is first given, and then a comprehensive combinatorial algorithm is proposed in this paper. Two-level optimum method is used in the algorithm. In the first ieve optimkaiion, un approximate locai optimum solution x is found by usi
A two-level delimitative and combinatorial algorithm for discrete optimization of structures
β Scribed by S. Chai; H. C. Sun
- Publisher
- Springer-Verlag
- Year
- 1997
- Tongue
- English
- Weight
- 640 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1615-1488
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The paper proposes a two-level decomposition method for shape optimization of structures. The optimization problem is divided into two subproblems on the basis of the different effects on structural behaviour of different kinds of design variables. A minimum mass subproblem is solved to determine th
A regional genetic algorithm (R-GA) is used for the discrete optimal design of truss structures. The chromosomes are selected from a sub-region centred on the continuous optimum. This approach replaces genetic rebirth as previously proposed by other authors, thereby signiΓΏcantly reducing computation
A nonlinear search algorithm for optimizing constrained design of ship structures is presented. The decision variables can be continuous or discrete and the constraints can be homogeneous or inequality nonlinear functions of those variables. The algorithm does not use gradients; therefore, it can wo
## Abstract Dual optimization algorithms for the topology optimization of continuum structures in discrete variables are gaining popularity in recent times since, in topology design problems, the number of constraints is small in comparison to the number of design variables. Good topologies can be