HEAL DSpace

On the automation of the force method in the optimal plastic design of frames

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Spiliopoulos, KV en
dc.date.accessioned 2014-03-01T01:13:14Z
dc.date.available 2014-03-01T01:13:14Z
dc.date.issued 1997 en
dc.identifier.issn 0045-7825 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/12378
dc.subject Computer Program en
dc.subject Connected Graph en
dc.subject Planar Graph en
dc.subject Satisfiability en
dc.subject Simplex Method en
dc.subject Linear Program en
dc.subject Shortest Path en
dc.subject.classification Engineering, Multidisciplinary en
dc.subject.classification Mathematics, Interdisciplinary Applications en
dc.subject.classification Mechanics en
dc.subject.other Algorithms en
dc.subject.other Automation en
dc.subject.other Design en
dc.subject.other Loads (forces) en
dc.subject.other Optimization en
dc.subject.other Plastic sheets en
dc.subject.other Force method en
dc.subject.other Structural frames en
dc.title On the automation of the force method in the optimal plastic design of frames en
heal.type journalArticle en
heal.identifier.primary 10.1016/S0045-7825(96)01055-9 en
heal.identifier.secondary http://dx.doi.org/10.1016/S0045-7825(96)01055-9 en
heal.language English en
heal.publicationDate 1997 en
heal.abstract It is well known that linear programming provides, computationally, the only solution to the optimal plastic design of plane frames. It is also known that the formulation of the problem by the force method, using kinematic variables, requires for its solution, by the simplex method, much less computation than the corresponding program which uses for its formulation the displacement method. However, the force method is not easily automated. This problem is circumvented in the paper by presenting a new algorithm which automatically selects a subminimal cycle base in any planar graph. Based on a shortest path technique between two points of a connected graph, the algorithm forms cycles by finding the shortest paths between the end nodes of members of the graph. The check for independence is done by fictitiously increasing the lengths of the members that form the cycle. This leads to an easy computer implementation of the algorithm. The algorithm is then used to provide a statical basis for any plane frame. Equilibrium with applied loads is satisfied by the use of cantilevers that follow the shortest load path of each load to the ground. The whole process automates the data generation of the force method and makes possible to use, in a computer program, the same input data as in the displacement method. A few examples of applications are given. en
heal.publisher ELSEVIER SCIENCE SA LAUSANNE en
heal.journalName Computer Methods in Applied Mechanics and Engineering en
dc.identifier.doi 10.1016/S0045-7825(96)01055-9 en
dc.identifier.isi ISI:A1997WM95300008 en
dc.identifier.volume 141 en
dc.identifier.issue 1-2 en
dc.identifier.spage 141 en
dc.identifier.epage 156 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής