الگوریتم مصنوعی کلونی زنبور عسل برای بهینه سازی سازه های خرپا
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|7388||2011||13 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 8740 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Applied Soft Computing, Volume 11, Issue 2, March 2011, Pages 2406–2418
The main goal of the structural optimization is to minimize the weight of structures while satisfying all design requirements imposed by design codes. In this paper, the Artificial Bee Colony algorithm with an adaptive penalty function approach (ABC-AP) is proposed to minimize the weight of truss structures. The ABC algorithm is swarm intelligence based optimization technique inspired by the intelligent foraging behavior of honeybees. Five truss examples with fixed-geometry and up to 200 elements were studied to verify that the ABC algorithm is an effective optimization algorithm in the creation of an optimal design for truss structures. The results of the ABC-AP compared with results of other optimization algorithms from the literature show that this algorithm is a powerful search and optimization technique for structural design.
Over the last 60 years, a number of optimization techniques have been developed and used in the structural optimization  and . These techniques can be broadly divided into two groups: (i) gradient based and (ii) direct search (stochastic or non-gradient based). Since there are known difficulties in the application of gradient-based techniques in structural optimization problems, direct search techniques have gained popularity in recent years , , , ,  and . Direct search techniques explore the design space by generating a number of successive solutions to guide the algorithm to an optimal design. Genetic algorithms , , ,  and , simulated annealing algorithms , ,  and  evolutionary programming  and evolutionary strategies  are the most notable direct search optimization techniques used in the solution of engineering problems. The main characteristic of these algorithms is the imitation of biological and physical events by evolving a good enough or near-optimal solution over a number of successive iterations. These techniques do not require the evaluation of gradients of objective and constraint functions, but they do require a significant amount of computer power. In the past, such techniques were considered impractical for design use due to the limitations of earlier computers. Recent advancements in computer hardware, especially in memory size and the speed of personnel computers make direct search techniques more feasible and practical. More recently, another branch of biologically inspired algorithms have attracted the attention of researchers all over the world. Algorithms belonging to this field imitate the collective behavior of a group of social insects (for example, bees, termites, ants and wasps) to solve complex optimization problems. These social insects live closely together in their nest and divide up the various tasks within the colony, such as foraging, nest building and defense. Each member of the colony performs their own tasks by interacting or communicating directly or indirectly in their local environment. Even when one or more individuals fail to carry out their task, the group as whole can still perform their tasks  and . The process of the division of labor among insects is believed to be more effective than individual action performed by an individual insect. These collective and adaptive behaviors of simple insects have been used by researchers to develop new optimization algorithms, known as swarm-based optimization algorithms. Particle swarm optimization , ,  and  and ant colony optimization algorithms  and  are well known swarm-based algorithms and are already employed to solve structural optimization problems. On the hand, bee-inspired algorithms have not yet been employed to solve structural engineering optimization problems. The main objective of this paper is to propose a bee-based algorithm for the optimum design of planer and space trusses consisting of continuous design variables and to evaluate the performance of the algorithm by comparing the results of the algorithm with those of other optimization techniques. Also, modifications that have been made to implement the algorithm to the structural optimization are described. The bee-inspired optimization algorithms are based on either a crude imitation of their mating process or their foraging behaviors. The algorithms based on the biological process of their reproduction are generally used in the combinatorial optimization problems while algorithms based on the foraging behavior of honeybees are used for various types of optimization problems. The Bee Colony Optimization  and , Virtual Bee , Bee  and  and Artificial Bee Colony , ,  and  are some of the algorithms based on mimicking the foraging behavior of honeybee swarms. Although all bee algorithms share some common features, they do have some different characteristics. The Bee Colony Optimization (BCO) algorithm developed by Teodorovic and co-workers  and  was used to solve the traveling salesman problem and a number of other numerical examples. In addition, they presented some potential application areas of the BCO algorithm in transportation and traffic engineering problems. Teodorovic  also stated that the BCO algorithm based on Swarm Intelligence principles gave encouraging results for its use in solving complex engineering problems. Yang  proposed the Virtual Bee Algorithm (VBA) and demonstrated how it could solve two-dimensional numerical problems. Based on his findings, Yang stated that VBA was usually as effective as genetic algorithms and could, in some cases, optimize more effectively than a conventional algorithm due to the parallelism of the multiple agents. The Bee Algorithm (BA) originally proposed by Pham et al.  and  is used for solving unconstrained function optimization problems and training multi-layered perceptron networks to recognize different patterns in control charts. They claimed that the BA generally gives better results than the genetic algorithm and the ant colony algorithm, when compared with the BA in terms of speed of optimization and accuracy of the results. However, one of the drawbacks of the BA is the number of parameters that must be tuned before executing the algorithm. Karaboga and Basturk ,  and  proposed the Artificial Bee Colony (ABC) algorithm. They used the ABC algorithm to solve unconstrained and constrained function optimization problems. The performance of the ABC algorithm was compared to that of differential evaluation, particle swarm optimization and an evolutionary algorithm. Karaboga and Basturk declared that the ABC algorithm when compared with differential evaluation, particle swarm optimization and an evolutionary algorithm performed better and could be effectively employed to solve engineering problems. Recently, Singh  used the ABC algorithm to solve the leaf-constrained minimum spanning tree discrete optimization problems. He compared the ABC algorithm with three other meta-heuristic algorithms, namely the genetic algorithm, ant colony optimization algorithm and tabu search algorithm. Singh stated that the results of the new ABC algorithm outperforms all the other approaches and provides quality solutions in shorter time. Since the ABC algorithm has been shown to perform well, it was selected for use in the present study for truss optimization with some deviations. Similar to other direct search algorithms, the ABC is an unconstrained optimization algorithm. To accommodate the inclusion of constraints, Karaboga and Basturk  proposed the Deb's selection mechanism. In this work, the self-adaptive penalty function approach is used to find a way of incorporating constraints in order to improve the ABC algorithm. Although only the size optimization of truss structures is considered in this study, it is believed that the ABC optimization algorithm can also be used for the topology and shape optimization of other types of structures. The remainder of this paper is arranged as follows: Section 2 briefly presents the characteristics of the structural optimization problems. In Section 3, the natural forging behavior of real bees is described, Section 4 describes the modeling of foraging behavior of artificial bees, the constraint handling procedure included in the ABC algorithm is given in Section 5. The pseudo-code of ABC-AP algorithm is presented in detail in Section 6. The analysis of standard test problems to demonstrate the effectiveness of the algorithm in finding the optimal solution is given in Section 7. Finally, Section 8 presents the conclusions.
نتیجه گیری انگلیسی
The Artificial Bee Colony (ABC) algorithm, based on mimicking the food foraging behavior of honeybee swarms, is proposed as a method of solving the optimization problems of planar and space truss structures. An adaptive penalty (AP) function method was integrated into the algorithm to transform constrained optimization problems to unconstrained optimization problems. Optimization software based on the ABC-AP algorithm was coded in the C# programming language with using object-oriented technology. Five test problems were studied using this optimization program to show that the ABC-AP algorithm can be successfully applied to the optimization problems of the truss structures subjected to multiple loading conditions. The comparison of the results of the ABC-AP with those of other algorithms demonstrated that the ABC-AP algorithm provides results as good as or better than other algorithms and can be used effectively for solving such problems. The algorithm shows a remarkably robust performance with a 100% success rate. The difference between the minimal and maximal results for all examples is less than 1% (an average of approximately 0.16%). The ABC-AP algorithm shows the positive performance in three aspects. The first one is the initial point independency and global nature of the algorithm. The second aspect is the characteristic of the adaptive penalty function coefficient which changes in the course of the optimization based on the feedback from previous process. The last aspect is that the algorithm does not require the evaluation of the gradients of objective and constraint functions. This makes the ABC-AP algorithm easy to implement in a structural analysis application. On the other hand, the ABC algorithm does not show any improvement in the speed of convergence in terms of the number of the structural analyses performed to obtain the best designs. In the research described in this paper, a number of optimization problems of trusses with continuous sizing variable and fixed geometry were solved very effectively. Further tests are required to determine whether the ABC-AP algorithm can be employed to solve optimization problems of other structural types with discrete sizing and configuration variables