Adaptive dimensional search: A new metaheuristic algorithm for discrete truss sizing optimization

dc.authoridHasançebi, Oğuzhan/0000-0002-5501-1079
dc.authoridKazemzadeh Azad, Saeid/0000-0001-9309-607X
dc.authorscopusid55924346500
dc.authorscopusid57193753354
dc.authorwosidHasançebi, Oğuzhan/HRE-0033-2023
dc.authorwosidHasançebi, Oğuzhan/ABA-2592-2020
dc.contributor.authorHasancebi, Oguzhan
dc.contributor.authorAzad, Saeid Kazemzadeh
dc.contributor.otherDepartment of Civil Engineering
dc.date.accessioned2024-07-05T14:32:30Z
dc.date.available2024-07-05T14:32:30Z
dc.date.issued2015
dc.departmentAtılım Universityen_US
dc.department-temp[Hasancebi, Oguzhan] Middle E Tech Univ, Dept Civil Engn, TR-06531 Ankara, Turkey; [Azad, Saeid Kazemzadeh] Atilim Univ, Dept Civil Engn, Ankara, Turkeyen_US
dc.descriptionHasançebi, Oğuzhan/0000-0002-5501-1079; Kazemzadeh Azad, Saeid/0000-0001-9309-607Xen_US
dc.description.abstractIn the present study a new metaheuristic algorithm called adaptive dimensional search (ADS) is proposed for discrete truss sizing optimization problems. The robustness of the ADS lies in the idea of updating search dimensionality ratio (SDR) parameter online during the search for a rapid and reliable convergence towards the optimum. In addition, several alternative stagnation-control strategies are integrated with the algorithm to escape from local optima, in which a limited uphill (non-improving) move is permitted when a stagnation state is detected in the course of optimization. Besides a remarkable computational efficiency, the ease of implementation and capability of locating promising solutions for challenging instances of practical design optimization are amongst the remarkable features of the proposed algorithm. The efficiency of the ADS is investigated and verified using two benchmark examples as well as three real-world problems of discrete sizing truss optimization. A comparison of the numerical results obtained using the ADS with those of other metaheuristic techniques indicates that the proposed algorithm is capable of locating improved solutions using much lesser computational effort. (C) 2015 Elsevier Ltd. All rights reserved.en_US
dc.identifier.citation92
dc.identifier.doi10.1016/j.compstruc.2015.03.014
dc.identifier.endpage16en_US
dc.identifier.issn0045-7949
dc.identifier.issn1879-2243
dc.identifier.scopus2-s2.0-84927132138
dc.identifier.startpage1en_US
dc.identifier.urihttps://doi.org/10.1016/j.compstruc.2015.03.014
dc.identifier.urihttps://hdl.handle.net/20.500.14411/819
dc.identifier.volume154en_US
dc.identifier.wosWOS:000355033600001
dc.identifier.wosqualityQ1
dc.institutionauthorAzad, Saeıd Kazemzadeh
dc.language.isoenen_US
dc.publisherPergamon-elsevier Science Ltden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectStructural optimizationen_US
dc.subjectOptimal designen_US
dc.subjectMetaheuristic techniquesen_US
dc.subjectDiscrete variablesen_US
dc.subjectSizing optimizationen_US
dc.subjectSteel truss structuresen_US
dc.titleAdaptive dimensional search: A new metaheuristic algorithm for discrete truss sizing optimizationen_US
dc.typeArticleen_US
dspace.entity.typePublication
relation.isAuthorOfPublicationa5085afb-eacf-4eb1-b19d-be25e73bcd43
relation.isAuthorOfPublication.latestForDiscoverya5085afb-eacf-4eb1-b19d-be25e73bcd43
relation.isOrgUnitOfPublication238c4130-e9ea-4b1c-9dea-772c4a0dad39
relation.isOrgUnitOfPublication.latestForDiscovery238c4130-e9ea-4b1c-9dea-772c4a0dad39

Files

Collections