1. A combinatorial problem: failure load analysis of rigid frames
- Author
-
Y. Kohama, T. Takada, and A. Miyamura
- Subjects
Mathematical optimization ,business.industry ,Frame (networking) ,General Engineering ,Mode (statistics) ,Travelling salesman problem ,Load factor ,Knowledge base ,Bounding overwatch ,Search problem ,Virtual work ,business ,Algorithm ,Software ,Mathematics - Abstract
The present study deals with the failure load analysis of rigid frames by the kinematically admissible approach, with emphasis on a combinatorial searching problem closely correlated to AI technology. In general, the essence of AI technology is to establish efficient search techniques for the prescribed goal among enormous data bases or knowledge-bases, which are frequently generated from combination of elements, as encountered in the traveling salesman problem. Because of non-differentiability or discreteness, the search of such a combination for the goal requires a large number of generate-and-test procedures, which wastes enormous computer time. Failure modes which are kinematically admissible to collapsed frames can be categorized into two types of mode: elementary failure modes and their linearly combined modes. By and large, for even medium-sized rigid frames the number of combined modes becomes explosively large. Thus, it is important to establish an effective search technique for the minimum load factor by virtual work equations for elementary modes and enormous combined modes without exploitation of any kind of continuity condition such as differentiation. Some efficient bounding operations to prune futile alternatives is applied as an example frame, whose result shows excellent searching efficiency.
- Published
- 1996