<?xml version="1.0" encoding="UTF-8"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-10-30T02:11:57Z</responseDate><request verb="GetRecord" identifier="oai:bayburt-rdlopen.rawdatalibrary.net:bayburt/12537" metadataPrefix="oai_dc">https://bayburt-rdlopen.rawdatalibrary.net/oai/request</request><GetRecord><record><header><identifier>oai:bayburt-rdlopen.rawdatalibrary.net:bayburt/12537</identifier><datestamp>2026-10-29T19:09:42Z</datestamp><setSpec>openaire</setSpec><setSpec>com_bayburt_10000</setSpec><setSpec>col_bayburt_10001</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:title>Nonlinear analysis of structures by Total Potential Optimization using Metaheuristic Algorithms (TPO/MA)</dc:title><dc:creator>Toklu, Y.C.</dc:creator><dc:creator>Bekdaş, G.</dc:creator><dc:creator>Temür, R.</dc:creator><dc:creator>Toklu, Ş.Ç.</dc:creator><dc:creator>Uzun, F.</dc:creator><dc:contributor>de Wilde, P.</dc:contributor><dc:contributor>Suter, G.</dc:contributor><dc:contributor>Rafiq, Y.</dc:contributor><dc:subject>Algorithms</dc:subject><dc:subject>Metaheuristics</dc:subject><dc:subject>Nonlinear</dc:subject><dc:subject>Structural analysis</dc:subject><dc:subject>TPO/MA</dc:subject><dc:subject>Truss</dc:subject><dc:description>Structural analysis problems can be formulized as either root finding problems, or optimization problems. The general practice is to choose the first option directly or to convert the second option again to a root finding problem by taking relevant derivatives and equating them to zero. The second alternative is used very randomly as it is and that only for some simple demonstrative problems, most probably due to difficulty in solving optimization problems by classical methods. The method called Total Potential Optimization using Metaheuristic Algorithms (TPO/MA) described in this study successfully enables handling structural problems with optimization formulation. Using metaheuristic algorithms provides additional advantages in dealing with all kinds of constraints.</dc:description><dc:publisher>Universiteit Twente</dc:publisher><dc:date>2013</dc:date><dc:type>Conference Object</dc:type><dc:identifier>https://rdlopen.rawdatalibrary.net/r/bayburt/12537</dc:identifier><dc:identifier>978-320003145-6</dc:identifier><dc:language>en</dc:language><dc:relation>European Group for Intelligent Computing in Engineering, EG-ICE 2013 - 20th International Workshop: Intelligent Computing in Engineering</dc:relation><dc:rights>info:eu-repo/semantics/closedAccess</dc:rights><dc:type>info:eu-repo/semantics/conferenceObject</dc:type><dc:identifier>https://bayburt-rdlopen.rawdatalibrary.net/tr/items/bayburt/12537</dc:identifier></oai_dc:dc></metadata></record></GetRecord></OAI-PMH>