Automatic collapse load analysis of regular plane frames using the force method

Spiliopoulos, KV; Souliotis, PG

dc.contributor.author	Spiliopoulos, KV	en
dc.contributor.author	Souliotis, PG	en
dc.date.accessioned	2014-03-01T01:12:38Z
dc.date.available	2014-03-01T01:12:38Z
dc.date.issued	1997	en
dc.identifier.issn	0045-7949	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/12185
dc.subject	Limit Analysis	en
dc.subject	Satisfiability	en
dc.subject	Shortest Path	en
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.classification	Engineering, Civil	en
dc.subject.other	Algorithms	en
dc.subject.other	Graph theory	en
dc.subject.other	Loads (forces)	en
dc.subject.other	Automatic collapse load analysis	en
dc.subject.other	Regular plane frames	en
dc.subject.other	Linear programming	en
dc.title	Automatic collapse load analysis of regular plane frames using the force method	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0045-7949(96)00163-0	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0045-7949(96)00163-0	en
heal.language	English	en
heal.publicationDate	1997	en
heal.abstract	The limit analysis of regular plane frames consisting of meshes of strictly four members is considered. The inherent difficulty of the force method for automatic geometric data generation is overcome by developing an algorithm which is used to provide a statical basis. Using a shortest path technique between two points of an undirected graph, consecutive cycles are found whose check for independence is done by fictitiously increasing the lengths of the cycle's members. Equilibrium with applied loads is satisfied by the use of cantilevers that coincide with the shortest path of each load to the ground. Examples of application are given. (C) 1997 Civil-Comp Ltd and Elsevier Science Ltd.	en
heal.publisher	PERGAMON-ELSEVIER SCIENCE LTD	en
heal.journalName	Computers and Structures	en
dc.identifier.doi	10.1016/S0045-7949(96)00163-0	en
dc.identifier.isi	ISI:A1997XG83100042	en
dc.identifier.volume	64	en
dc.identifier.issue	1-4	en
dc.identifier.spage	531	en
dc.identifier.epage	540	en