Academic
Publications
Discrete optimum design of truss structures using artificial bee colony algorithm

Discrete optimum design of truss structures using artificial bee colony algorithm,10.1007/s00158-010-0551-5,Structural and Multidisciplinary Optimizat

Discrete optimum design of truss structures using artificial bee colony algorithm   (Citations: 2)
BibTex | RIS | RefWorks Download
Over the past few years, swarm intelligence based optimization techniques such as ant colony optimization and particle swarm optimization have received considerable attention from engineering researchers and practitioners. These algorithms have been used in the solution of various engineering problems. Recently, a relatively new swarm based optimization algorithm called the Artificial Bee Colony (ABC) algorithm has begun to attract interest from researchers to solve optimization problems. The aim of this study is to present an optimization algorithm based on the ABC algorithm for the discrete optimum design of truss structures. The ABC algorithm is a meta-heuristic optimization technique that mimics the process of food foraging of honeybees. Originally the ABC algorithm was developed for continuous function optimization problems. This paper describes the modifications made to the ABC algorithm in order to solve discrete optimization problems and to improve the algorithm’s performance. In order to demonstrate the effectiveness of the modified algorithm, four structural problems with up to 582 truss members and 29 design variables were solved and the results were compared with those obtained using other well-known meta-heuristic search techniques. The results demonstrate that the ABC algorithm is very effective and robust for the discrete optimization designs of truss structural problems.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...A meta heuristic for optimum design of truss structures is presented in the recently published research article of Sonmez (2011)...
    • ...In these comments we will argue that the benchmark examples presented in Sonmez (2011) are not particularly challenging...
    • ...The best heuristics presented herein find equally good, or better, designs compared to those presented in Sonmez (2011)...
    • ...Sonmez (2011) are that they are sizing problems with few potential bars and few degrees of freedom in the ground structure...
    • ...The mathematical properties mentioned above are completely ignored in the meta heuristic presented in Sonmez (2011)...
    • ...These observations can potentially explain the excessively large number of function evaluations used in Sonmez (2011)...
    • ...In this section we report numerical results for three heuristics applied to the three problem instances in Sonmez (2011), which only involve displacement and stress constraints...
    • ...The ground structures, load conditions, displacement and stress limits are described in detail in Sonmez (2011) and are therefore not repeated here...
    • ...Table 1 Numerical results for the 10-bar truss problem Artificial Bee Colony Rounding Rounding + B&B (Sonmez 2011) Greedy...
    • ...Table 2 Numerical results for the 25-bar truss problem Artificial Bee Colony Rounding Rounding + B&B (Sonmez 2011) Greedy...
    • ...The numerical experiments were run on an Intel Dual Core T7200 processor running at 2.0 GHz which is comparable to the processor used in Sonmez (2011)...
    • ...For the first two problems the found designs are slightly heavier than the worst designs found in Sonmez (2011)...
    • ...However, the relative difference between the found design and the best found design from Sonmez (2011) is in both cases less than 1%. For the third problem the rounding heuristic finds a design better than the best one found in Sonmez (2011)...
    • ...However, the relative difference between the found design and the best found design from Sonmez (2011) is in both cases less than 1%. For the third problem the rounding heuristic finds a design better than the best one found in Sonmez (2011)...
    • ...These observations support the claim that the three examples from Sonmez (2011 )a re not challenging...
    • ...For two problems the greedy search finds designs that are as good as, or better, than the best designs found by Bee Colony optimization in Sonmez (2011)...
    • ...Even though this is a more advanced heuristic it uses significantly fewer function evaluations than all the meta heuristics in Sonmez (2011)...
    • ...Table 3 Numerical results for the 72-bar truss problem Artificial Bee Colony Rounding Rounding + B&B (Sonmez 2011) Greedy...
    • ...The conclusions in Sonmez (2011) are based on a numerical comparison with other stochastic meta heuristics rather than with the best available heuristics for the considered class of problems...
    • ...The numerical results presented in Sonmez (2011) indicate that these stochastic algorithms produce designs with comparable weight using a similar number of evaluations...
    • ...The numerical experiments reported herein clearly indicate that the stochastic heuristics used in Sonmez (2011) cannot compete with the best heuristic presented herein for the considered benchmark problems...

    Mathias Stolpe. To bee or not to bee—comments on “Discrete optimum design of truss str...

    • ...Fig. 12.2 A twenty five-bar spatial truss [22]...
    • ...The 72-bar truss is a challenging benchmark that has also been used by many researchers (e.g., [9, 18, 22, 23])...
    • ...16 A71–A72 Fig. 12.3 A 72-bar spatial truss [22]...

    Amir Hossein Gandomiet al. Benchmark Problems in Structural Optimization

Sort by: