• Title/Summary/Keyword: charged system search algorithm

Search Result 9, Processing Time 0.021 seconds

Sizing, geometry and topology optimization of trusses using force method and supervised charged system search

  • Kaveh, A.;Ahmadi, B.
    • Structural Engineering and Mechanics
    • /
    • v.50 no.3
    • /
    • pp.365-382
    • /
    • 2014
  • In this article, the force method and Charged System Search (CSS) algorithm are used for the analysis and optimal design of truss structures. The CSS algorithm is employed as the optimization tool and the force method is utilized for analysis. In this paper in addition to member's cross sections, redundant forces, geometry and topology variables are considered as the optimization variables. Minimum complementary energy principle is used directly to analyze the structure. In the presented method, redundant forces are calculated by the CSS in order to minimize the energy function. Combination of the CSS and force method leads to an efficient algorithm in comparison to some of the optimization algorithms.

A hybrid CSS and PSO algorithm for optimal design of structures

  • Kaveh, A.;Talatahari, S.
    • Structural Engineering and Mechanics
    • /
    • v.42 no.6
    • /
    • pp.783-797
    • /
    • 2012
  • A new hybrid meta-heuristic optimization algorithm is presented for design of structures. The algorithm is based on the concepts of the charged system search (CSS) and the particle swarm optimization (PSO) algorithms. The CSS is inspired by the Coulomb and Gauss's laws of electrostatics in physics, the governing laws of motion from the Newtonian mechanics, and the PSO is based on the swarm intelligence and utilizes the information of the best fitness historically achieved by the particles (local best) and by the best among all the particles (global best). In the new hybrid algorithm, each agent is affected by local and global best positions stored in the charged memory considering the governing laws of electrical physics. Three different types of structures are optimized as the numerical examples with the new algorithm. Comparison of the results of the hybrid algorithm with those of other meta-heuristic algorithms proves the robustness of the new algorithm.

Opposition based charged system search for parameter identification problem in a simplified Bouc-Wen model

  • Shirgir, Sina;Azar, Bahman Farahmand;Hadidi, Ali
    • Earthquakes and Structures
    • /
    • v.18 no.4
    • /
    • pp.493-506
    • /
    • 2020
  • In this paper, a new opposition based charged system search (CSS) is proposed to be used as a parameter identification of highly nonlinear semi-active magneto-rheological damper. By replacing the opposition particles with current solutions, the mentioned strategy is used to enhance the search space and to increase the exploration of CSS. To investigate the effectiveness of the proposed method, a nonlinear modified Bouc-Wen model of MR damper is considered to find its parameters, and compare it with those achieved from experimental model of MR damper. Also, by exploiting the sensitivity analysis and using the importance vector, the less importance parameters in the Bouc-Wen model are eliminated which makes the MR damper model simpler. Results demonstrate the new proposed algorithm (OBLCSS) has a high ability to tackle highly nonlinear problems. Based on the results of the α importance vector, a simplified model is proposed and its parameters are identified by using the presented OBLCSS algorithm. The simplified proposed model also has a high capability of estimating damper responses.

Optimization of fuzzy controller for nonlinear buildings with improved charged system search

  • Azizi, Mahdi;Ghasemi, Seyyed Arash Mousavi;Ejlali, Reza Goli;Talatahari, Siamak
    • Structural Engineering and Mechanics
    • /
    • v.76 no.6
    • /
    • pp.781-797
    • /
    • 2020
  • In recent years, there is an increasing interest to optimize the fuzzy logic controller with different methods. This paper focuses on the optimization of a fuzzy logic controller applied to a seismically excited nonlinear building. In most cases, this problem is formulated based on the linear behavior of the structure, however in this paper, four sets of objective functions are considered with respect to the nonlinear responses of the structure as the peak interstory drift ratio, the peak level acceleration, the ductility factor and the maximum control force. The Improved Charged System Search is used to optimize the membership functions and the rule base of the fuzzy controller. The obtained results of the optimized and the non-optimized fuzzy controllers are compared to the uncontrolled responses of the structure. Also, the performance of the utilized method is compared with various classical and advanced optimization algorithms.

Damage-based optimization of large-scale steel structures

  • Kaveh, A.;Kalateh-Ahani, M.;Fahimi-Farzam, M.
    • Earthquakes and Structures
    • /
    • v.7 no.6
    • /
    • pp.1119-1139
    • /
    • 2014
  • A damage-based seismic design procedure for steel frame structures is formulated as an optimization problem, in which minimization of the initial construction cost is treated as the objective of the problem. The performance constraint of the design procedure is to achieve "repairable" damage state for earthquake demands that are less severe than the design ground motions. The Park-Ang damage index is selected as the seismic damage measure for the quantification of structural damage. The charged system search (CSS) algorithm is employed as the optimization algorithm to search the optimum solutions. To improve the time efficiency of the solution algorithm, two simplifying strategies are adopted: first, SDOF idealization of multi-story building structures capable of estimating the actual seismic response in a very short time; second, fitness approximation decreasing the number of fitness function evaluations. The results from a numerical application of the proposed framework for designing a twelve-story 3D steel frame structure demonstrate its efficiency in solving the present optimization problem.

Weight optimization of coupling with bolted rim using metaheuristics algorithms

  • Mubina Nancy;S. Elizabeth Amudhini Stephen
    • Coupled systems mechanics
    • /
    • v.13 no.1
    • /
    • pp.1-19
    • /
    • 2024
  • The effectiveness of coupling with a bolted rim is assessed in this research using a newly designed optimization algorithm. The current study, which is provided here, evaluates 10 contemporary metaheuristic approaches for enhancing the coupling with bolted rim design problem. The algorithms used are particle swarm optimization (PSO), crow search algorithm (CSA), enhanced honeybee mating optimization (EHBMO), Harmony search algorithm (HSA), Krill heard algorithm (KHA), Pattern search algorithm (PSA), Charged system search algorithm (CSSA), Salp swarm algorithm (SSA), Big bang big crunch optimization (B-BBBCO), Gradient based Algorithm (GBA). The contribution of the paper isto optimize the coupling with bolted rim problem by comparing these 10 algorithms and to find which algorithm gives the best optimized result. These algorithm's performance is evaluated statistically and subjectively.

Optimum design of laterally-supported castellated beams using CBO algorithm

  • Kaveh, A.;Shokohi, F.
    • Steel and Composite Structures
    • /
    • v.18 no.2
    • /
    • pp.305-324
    • /
    • 2015
  • In this study, two common types of laterally supported castellated beams are considered as design problems: beams with hexagonal openings and beams with circular openings. The main goal of manufacturing these beams is to increase the moment of inertia and section modulus, which results in greater strength and rigidity. These types of open-web beams have found widespread use, primarily in buildings, because of great savings in materials and construction costs. Hence, the minimum cost is taken as the design objective function and the Colliding Bodies Optimization (CBO) method is utilized for obtaining the solution of the design problem. The design methods used in this study are consistent with BS5950 Part 1 and Part 3, and Euro Code 3. A number of design examples are considered to optimize by CBO algorithm. Comparison of the optimal solution of the CBO algorithm with those of the Enhanced Charged System Search (ECSS) method demonstrate the capability of CBO in solving the present type of design problem. It is also observed that optimization results obtained by the CBO algorithm for three design examples have less cost in comparison to the results of the ECSS algorithm. From the results obtained in this paper, it can be concluded that the use of beam with hexagonal opening requires smaller amount of steel material and it is superior to the cellular beam from the cost point of view.

Structural health monitoring through meta-heuristics - comparative performance study

  • Pholdee, Nantiwat;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • v.1 no.4
    • /
    • pp.315-327
    • /
    • 2016
  • Damage detection and localisation in structures is essential since it can be a means for preventive maintenance of those structures under service conditions. The use of structural modal data for detecting the damage is one of the most efficient methods. This paper presents comparative performance of various state-of-the-art meta-heuristics for use in structural damage detection based on changes in modal data. The metaheuristics include differential evolution (DE), artificial bee colony algorithm (ABC), real-code ant colony optimisation (ACOR), charged system search (ChSS), league championship algorithm (LCA), simulated annealing (SA), particle swarm optimisation (PSO), evolution strategies (ES), teaching-learning-based optimisation (TLBO), adaptive differential evolution (JADE), evolution strategy with covariance matrix adaptation (CMAES), success-history based adaptive differential evolution (SHADE) and SHADE with linear population size reduction (L-SHADE). Three truss structures are used to pose several test problems for structural damage detection. The meta-heuristics are then used to solve the test problems treated as optimisation problems. Comparative performance is carried out where the statistically best algorithms are identified.

Finding a Minimum Fare Route in the Distance-Based System (거리비례제 요금부과에 따른 최소요금경로탐색)

  • Lee, Mee-Young;Baik, Nam-Cheol;Nam, Doo-Hee;Shin, Seon-Gil
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.6
    • /
    • pp.101-108
    • /
    • 2004
  • The new transit fare in the Seoul Metropolitan is basically determined based on the distance-based fare system (DBFS). The total fare in DBFS consists of three parts- (1) basic fare, (2) transfer fare, and (3) extra fare. The fixed amount of basic fare for each mode is charged when a passenger gets on a mode, and it proceeds until traveling within basic travel distance. The transfer fare may be added when a passenger switches from the present mode to another. The extra fare is imposed if the total travel distance exceeds the basic travel distance, and after that, the longer distance the more extra fare based on the extra-fare-charging rule. This study proposes an algorithm for finding minimum fare route in DBFS. This study first exploits the link-label-based searching method to enable shortest path algorithms to implement without network expansion at junction nodes in inter-modal transit networks. Moreover, the link-expansion technique is adopted in order for each mode's travel to be treated like duplicated links, which have the same start and end nodes, but different link features. In this study, therefore, some notations associated with modes can be saved, thus the existing link-based shortest path algorithm is applicable without any loss of generality. For fare calculation as next steps, a mathematical formula is proposed to embrace fare-charging process using search process of two adjacent links illustrated from the origin. A shortest path algorithm for finding a minimum fare route is derived by converting the formula as a recursive form. The implementation process of the algorithm is evaluated through a simple network test.