A 2-LEVEL DELIMITATIVE AND COMBINATORIAL ALGORITHM FOR DISCRETE OPTIMIZATION OF STRUCTURES

In this paper, a two-level delimitative and combinatorial algorithm fo r a kind of (0,1,2) programming is proposed and applied to discrete op timization of structures. The algorithm generates all combinations in a certain order of magnitude of the function of the objective by using a two-level generating method and eliminates the majority of infeasib le or nonoptimum combinations by using a two-level delimitative algori thm, so that computational efficiency is greater. Additionally, a (0,1 ,2) programming model of discrete structural optimization is establish ed and the local optimum solution can be obtained by using this algori thm, thus it provides a method to judge whether or not the approximate optimum solution obtained by the heuristic algorithm is a local optim um solution.