首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.

Teaching–learning-based optimization (TLBO) is one of the latest metaheuristic algorithms being used to solve global optimization problems over continuous search space. Researchers have proposed few variants of TLBO to improve the performance of the basic TLBO algorithm. This paper presents a new variant of TLBO called fuzzy adaptive teaching–learning-based optimization (FATLBO) for numerical global optimization. We propose three new modifications to the basic scheme of TLBO in order to improve its searching capability. These modifications consist, namely of a status monitor, fuzzy adaptive teaching–learning strategies, and a remedial operator. The performance of FATLBO is investigated on four experimental sets comprising complex benchmark functions in various dimensions and compared with well-known optimization methods. Based on the results, we conclude that FATLBO is able to deliver excellence and competitive performance for global optimization.

  相似文献   

2.

Metaheuristic algorithms have provided an efficient tool for designers by which discrete optimum design of real-size steel space frames under design code requirements can be obtained. In this study, the optimum sizing design of steel space frames is formulated according to provisions of Load and Resistance Factor Design—American Institute of Steel Construction. The weight of the steel frame is taken as objective function. The design algorithm selects the appropriate W sections for members of the steel frame such that the frame weight is the minimum and design code limitations are satisfied. The biogeography-based optimization algorithm is utilized to find out the optimum solution of the discrete programming problem. This algorithm is one of the recent additions to metaheuristic techniques which are based on theory of island biogeography where each habitat is assumed to be potential solution for the design problem. The performance of the biogeography-based optimization algorithm is compared with other recent metaheuristic algorithms such as adaptive firefly algorithm, teaching and learning-based optimization, artificial bee colony optimization, dynamic harmony search algorithm, and ant colony algorithm. It is shown that biogeography-based optimization algorithm outperforms other metaheuristic techniques in the design examples considered.

  相似文献   

3.
The Journal of Supercomputing - This study proposes a set of new robust parallel hybrid metaheuristic algorithms based on artificial bee colony (ABC) and teaching learning-based optimization (TLBO)...  相似文献   

4.
Structural optimization for performance-based seismic design (PBSD) in earthquake engineering aims at finding optimum design variables corresponding to a minimum objective function with constraints on performance requirements. In this study, an efficient methodology, consisting of two computational strategies, is presented for performance-based optimum seismic design (PBOSD) of steel moment frames. In the first strategy, a modified firefly algorithm (MFA) is proposed to efficiently find PBOSD at the performance levels. Because that for computing the structural responses at the performance levels a nonlinear static pushover analysis must be conducted, the overall computational time of optimization process is extremely large. In the second strategy, to reduce the computational burden, a new neural network model termed as wavelet cascade-forward back-propagation (WCFBP) is proposed to effectively predict the results of nonlinear pushover analysis during the optimization process. To illustrate the effectiveness of the proposed methodology, 3, 6 and 12 storey planar steel moment resisting frames are optimized for various performance levels. The results demonstrate the effectiveness of the proposed soft computing-based methodology for PBOSD of steel structures spending low computational cost.  相似文献   

5.
Performance-based seismic design offers enhanced control of structural damage for different levels of earthquake hazard. Nevertheless, the number of studies dealing with the optimum performance-based seismic design of reinforced concrete frames is rather limited. This observation can be attributed to the need for nonlinear structural analysis procedures to calculate seismic demands. Nonlinear analysis of reinforced concrete frames is accompanied by high computational costs and requires a priori knowledge of steel reinforcement. To address this issue, previous studies on optimum performance-based seismic design of reinforced concrete frames use independent design variables to represent steel reinforcement in the optimization problem. This approach drives to a great number of design variables, which magnifies exponentially the search space undermining the ability of the optimization algorithms to reach the optimum solutions. This study presents a computationally efficient procedure tailored to the optimum performance-based seismic design of reinforced concrete frames. The novel feature of the proposed approach is that it employs a deformation-based, iterative procedure for the design of steel reinforcement of reinforced concrete frames to meet their performance objectives given the cross-sectional dimensions of the structural members. In this manner, only the cross-sectional dimensions of structural members need to be addressed by the optimization algorithms as independent design variables. The developed solution strategy is applied to the optimum seismic design of reinforced concrete frames using pushover and nonlinear response-history analysis and it is found that it outperforms previous solution approaches.  相似文献   

6.
Most of the recent proposed particle swarm optimization (PSO) algorithms do not offer the alternative learning strategies when the particles fail to improve their fitness during the searching process. Motivated by this fact, we improve the cutting edge teaching–learning-based optimization (TLBO) algorithm and adapt the enhanced framework into the PSO, thereby develop a teaching and peer-learning PSO (TPLPSO) algorithm. To be specific, the TPLPSO adopts two learning phases, namely the teaching and peer-learning phases. The particle firstly enters into the teaching phase and updates its velocity based on its historical best and the global best information. Particle that fails to improve its fitness in the teaching phase then enters into the peer-learning phase, where an exemplar is selected as the guidance particle. Additionally, a stagnation prevention strategy (SPS) is employed to alleviate the premature convergence issue. The proposed TPLPSO is extensively evaluated on 20 benchmark problems with different features, as well as one real-world problem. Experimental results reveal that the TPLPSO exhibits competitive performances when compared with ten other PSO variants and seven state-of-the-art metaheuristic search algorithms.  相似文献   

7.
A new metaheuristic strategy is proposed for size and shape optimization problems with frequency constraints. These optimization problems are considered to be highly non-linear and non-convex. The proposed strategy extends the idea of using a single optimization process to a series of collaborative optimization processes. In this study, a modified teaching-learning-based optimization (TLBO), which is a relatively simple algorithm with no intrinsic parameters controlling its performance, is utilized in a collaborative framework and introduced as a higher-level TLBO algorithm called school-based optimization (SBO). SBO considers a school with multiple independent classrooms and multiple teachers with inter-classroom collaboration where teachers are reassigned to classrooms based on their fitness. SBO significantly improves the both exploration and exploitation capabilities of TLBO without increasing the algorithm's complexity. In addition, since the SBO algorithm uses multiple independent classrooms with interchanging teachers, the algorithm is less likely to be influenced by local optima. A parametric study is conducted to investigate the effects of the number of classes and the class size, which are the only parameters of SBO. The SBO algorithm is applied to five benchmark truss optimization problems with frequency constraints and the statistical results are compared to other optimization techniques in the literature. The quality and robustness of the results indicate the efficiency of the proposed SBO algorithm.  相似文献   

8.
Teaching–learning-based optimization (TLBO) is a recently developed heuristic algorithm based on the natural phenomenon of teaching–learning process. In the present work, a modified version of the TLBO algorithm is introduced and applied for the multi-objective optimization of a two stage thermoelectric cooler (TEC). Two different arrangements of the thermoelectric cooler are considered for the optimization. Maximization of cooling capacity and coefficient of performance of the thermoelectric cooler are considered as the objective functions. An example is presented to demonstrate the effectiveness and accuracy of the proposed algorithm. The results of optimization obtained by using the modified TLBO are validated by comparing with those obtained by using the basic TLBO, genetic algorithm (GA), particle swarm optimization (PSO) and artificial bee colony (ABC) algorithms.  相似文献   

9.
In this article, the design of thinned concentric circular antenna arrays (CCAAs) of isotropic radiators with optimum side lobe level (SLL) reduction is studied. The newly proposed global evolutionary optimization method; namely, the teaching‐learning‐based optimization (TLBO) is used to determine an optimum set of turned ON elements of thinned CCAAs that provides a radiation pattern with optimum SLL reduction. The TLBO represents a new algorithm for optimization problems in electromagnetics and antennas. It is shown that the TLBO provides results that are somewhat better than those obtained using other evolutionary algorithms, like the firefly algorithm and biogeography based optimization. © 2013 Wiley Periodicals, Inc. Int J RF and Microwave CAE 24:443–450, 2014.  相似文献   

10.
Teaching–Learning-Based Optimization (TLBO) is a novel swarm intelligence metaheuristic that is reported as an efficient solution method for many optimization problems. It consists of two phases where all individuals are trained by a teacher in the first phase and interact with classmates to improve their knowledge level in the second phase. In this study, we propose a set of TLBO-based hybrid algorithms to solve the challenging combinatorial optimization problem, Quadratic Assignment. Individuals are trained with recombination operators and later a Robust Tabu Search engine processes them. The performances of sequential and parallel TLBO-based hybrid algorithms are compared with those of state-of-the-art metaheuristics in terms of the best solution and computational effort. It is shown experimentally that the performance of the proposed algorithms are competitive with the best reported algorithms for the solution of the Quadratic Assignment Problem with which many real life problems can be modeled.  相似文献   

11.
简要分析了群智能优化算法的研究现状, 重点对“教与学”优化算法作了详细的描述, 并分析了“教与学”算法的性能及其优缺点; 随后介绍了几种改进的“教与学”优化算法, 对“教与学”优化算法的应用研究情况进行了论述。最后, 说明了目前“教与学”优化算法中存在的问题, 并指出“教与学”优化算法未来的研究方向。  相似文献   

12.
Three different types of lateral resisting steel moment frames consisting of ordinary moment frame (OMF), intermediate moment frame (IMF) and special moment frame (SMF) are available for design of 3D frames in literature. In this paper, optimum seismic design of 3D steel moment frames with different types of lateral resisting systems are performed according to the AISC-LRFD design criteria. A comparison is made considering the results of the above mentioned frames of different ductility types. These frames are analyzed by Response Spectrum Analysis (RSA), and optimizations are performed using nine different well-established metaheuristic algorithms. Performances of these algorithms are then compared for introducing the most suitable metaheuristic algorithms for optimal design of the 3D frames.  相似文献   

13.

In this paper, a solution to the optimal power flow (OPF) problem in electrical power networks is presented considering high voltage direct current (HVDC) link. Furthermore, the effect of HVDC link converters on the active and reactive power is evaluated. An objective function is developed for minimizing power loss and improving voltage profile. Gradient-based optimization techniques are not viable due to high number of OPF equations, their complexity and equality and inequality constraints. Hence, an efficient global optimization method is used based on teaching–learning-based optimization (TLBO) algorithm. The performance of the suggested method is evaluated on a 5-bus PJM network and compared with other algorithms such as particle swarm optimization, shuffled frog-leaping algorithm and nonlinear programming. The results are promising and show the effectiveness and robustness of TLBO method.

  相似文献   

14.
A new efficient optimization method, called ‘Teaching–Learning-Based Optimization (TLBO)’, is proposed in this paper for the optimization of mechanical design problems. This method works on the effect of influence of a teacher on learners. Like other nature-inspired algorithms, TLBO is also a population-based method and uses a population of solutions to proceed to the global solution. The population is considered as a group of learners or a class of learners. The process of TLBO is divided into two parts: the first part consists of the ‘Teacher Phase’ and the second part consists of the ‘Learner Phase’. ‘Teacher Phase’ means learning from the teacher and ‘Learner Phase’ means learning by the interaction between learners. The basic philosophy of the TLBO method is explained in detail. To check the effectiveness of the method it is tested on five different constrained benchmark test functions with different characteristics, four different benchmark mechanical design problems and six mechanical design optimization problems which have real world applications. The effectiveness of the TLBO method is compared with the other population-based optimization algorithms based on the best solution, average solution, convergence rate and computational effort. Results show that TLBO is more effective and efficient than the other optimization methods for the mechanical design optimization problems considered. This novel optimization method can be easily extended to other engineering design optimization problems.  相似文献   

15.
This paper deals with the hybrid flowshop scheduling problems with sequence‐dependent setup times. To minimize the makespan, we propose hybrid metaheuristic approach, which integrates several features from ant colony optimization, simulated annealing and variable neighbourhood search in a new configurable scheduling algorithm. Our proposed algorithms are tuned by means of design of experiments approach. We present computational experiments on standard test problems and compare the results with the several algorithms presented previously. The results illustrate that the hybrid metaheuristic outperforms the other algorithms.  相似文献   

16.
An enhanced nature-inspired metaheuristic optimization algorithm, called the modified firefly algorithm (MFA) is proposed for multidimensional structural design optimization. The MFA incorporates metaheuristic components, namely logistic and Gauss/mouse chaotic maps, adaptive inertia weight, and Lévy flight with a conventional firefly algorithm (FA) to improve its optimization capability. The proposed MFA has several advantages over its traditional FA counterpart. Logistic chaotic maps provide a diverse initial population. Gauss/mouse maps allow the tuning of the FA attractiveness parameter. The adaptive inertia weight controls the local exploitation and the global exploration of the search process. Lévy flight is used in the exploitation of the MFA. The proposed MFA was evaluated by comparing its performance in solving a series of benchmark functions with those of the FA and other well-known optimization algorithms. The efficacy of the MFA was then proven by its solutions to three multidimensional structural design optimization problems; MFA yielded the best solutions among the observed algorithms. Experimental results revealed that the proposed MFA is more efficient and effective than the compared algorithms. Therefore, the MFA serves as an alternative algorithm for solving multidimensional structural design optimization problems.  相似文献   

17.
Chaotic time series prediction problems have some very interesting properties and their prediction has received increasing interest in the recent years. Prediction of chaotic time series based on the phase space reconstruction theory has been applied in many research fields. It is well known that prediction of a chaotic system is a nonlinear, multivariable and multimodal optimization problem for which global optimization techniques are required in order to avoid local optima. In this paper, a new hybrid algorithm named teaching–learning-based optimization (TLBO)–differential evolution (DE), which integrates TLBO and DE, is proposed to solve chaotic time series prediction. DE is incorporated into update the previous best positions of individuals to force TLBO jump out of stagnation, because of its strong searching ability. The proposed hybrid algorithm speeds up the convergence and improves the algorithm’s performance. To demonstrate the effectiveness of our approaches, ten benchmark functions and three typical chaotic nonlinear time series prediction problems are used for simulating. Conducted experiments indicate that the TLBO–DE performs significantly better than, or at least comparable to, TLBO and some other algorithms.  相似文献   

18.
Engineering with Computers - Metaheuristic algorithms are successful methods of optimization. The firefly algorithm is one of the known metaheuristic algorithms used in a variety of applications....  相似文献   

19.
Disassembly Sequence Planning (DSP) is a challenging NP-hard combinatorial optimization problem. As a new and promising population-based evolutional algorithm, the Teaching–Learning-Based Optimization (TLBO) algorithm has been successfully applied to various research problems. However, TLBO is not capable or effective in DSP optimization problems with discrete solution spaces and complex disassembly precedence constraints. This paper presents a Simplified Teaching–Learning-Based Optimization (STLBO) algorithm for solving DSP problems effectively. The STLBO algorithm inherits the main idea of the teaching–learning-based evolutionary mechanism from the TLBO algorithm, while the realization method for the evolutionary mechanism and the adaptation methods for the algorithm parameters are different. Three new operators are developed and incorporated in the STLBO algorithm to ensure its applicability to DSP problems with complex disassembly precedence constraints: i.e., a Feasible Solution Generator (FSG) used to generate a feasible disassembly sequence, a Teaching Phase Operator (TPO) and a Learning Phase Operator (LPO) used to learn and evolve the solutions towards better ones by applying the method of precedence preservation crossover operation. Numerical experiments with case studies on waste product disassembly planning have been carried out to demonstrate the effectiveness of the designed operators and the results exhibited that the developed algorithm performs better than other relevant algorithms under a set of public benchmarks.  相似文献   

20.
The resource saving dispatching aims at finding the optimal combination of powers produced by power generating units that minimizes the total costs subject to given constraints. A metaheuristic swarm flow algorithm is proposed. Results of the comparative analysis of the efficiency of this algorithm on benchmark problems are presented. The comparison was performed with the particle swarm optimization, genetic, and biogeography-based optimization algorithms using systems consisting of 6 and 20 power generating units as examples. The flow algorithm converges to the optimal solution using less computational resources.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号