A combinatorial algorithm for the discrete optimization of structures

✍ Scribed by Chai Shan; Sun Huanchun

• Publisher: Springer
• Year: 1997
• Tongue: English
• Weight: 599 KB
• Volume: 18
• Category: Article
• ISSN: 0253-4827
• DOI: 10.1007/bf00133342

✦ Synopsis

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 using the heuristic algorithm, relative d$ference quotient algorithm, with hi&h computational efficiencv and high performance demonstrated by the performance test of random samples. In the second level, a mathematical model of (-1, 0, I) programming is established first, and then it is chanied into (0, I) programming model. The local optimum solution g* will be from the (0. 1) programming by using the delimitative and combinatorial algorithm or the relative dl$ference quotient algorithm. By this algorithm, the iocai optimum solution can be obtained cert@i,v, and a method is provided to j'udge whether or not the approximate optimum soiution obtained by heuristic algorithm is an optimum solution. The above comprehensive combinatorial algorithm has higher computational efficiencjl.