This paper describes the first application of the bees algorithm to mechanical design optimization. The bees algorithm is a search procedure inspired by the way honey bees forage for food. Two standard mechanical desi...
详细信息
This paper describes the first application of the bees algorithm to mechanical design optimization. The bees algorithm is a search procedure inspired by the way honey bees forage for food. Two standard mechanical design problems, the design of a welded beam structure and the design of coil springs, were used to benchmark the bees algorithm against other optimization techniques. The paper presents the results obtained showing the robust performance of the bees algorithm.
This paper investigates the application of the bees algorithm (BA) in finding the neutral stability curve of the Orr-Sommerfeld equation for basic flows between parallel plates. To demonstrate the performance of the p...
详细信息
This paper investigates the application of the bees algorithm (BA) in finding the neutral stability curve of the Orr-Sommerfeld equation for basic flows between parallel plates. To demonstrate the performance of the proposed method, determination of neutral stability curve for plane Poiseuille flow is considered as a case study. Some minor modifications have been applied to BA in order to minimize the computational cost. To better assess the effectiveness of the bees algorithm, its results were compared with those of the modified genetic algorithm (MGA). The obtained results confirm the superiority of BA over MGA in terms of the computational cost.
In this paper, the application of the bees algorithm (BA) to the problem of crack detection in beams is introduced. A numerical as well as an experimental study is designed to predict a single open edge-crack in canti...
详细信息
In this paper, the application of the bees algorithm (BA) to the problem of crack detection in beams is introduced. A numerical as well as an experimental study is designed to predict a single open edge-crack in cantilever beams. The crack is modeled by a rotational spring, whose stiffness could be determined by the size of the crack. The weighted sum of the squared errors between the measured and computed natural frequencies is used as the objective function. The results show that both the size and location of the crack can be predicted well through this method. (C) 2011 Elsevier Ltd. All rights reserved.
Generating product design concepts to meet functional requirements while maintaining a specific brand identity is a daunting task for a designer. Shape grammars have been applied to describe the creation of branded pr...
详细信息
Generating product design concepts to meet functional requirements while maintaining a specific brand identity is a daunting task for a designer. Shape grammars have been applied to describe the creation of branded product shapes via a set of shape rules and were manually used to create a family of new design concepts, which maintain the product brand identity. Nevertheless, shape grammars are not able to evaluate whether the generated new product concepts can fulfil specified functional requirements of a product. In this research work, shape grammar is combined with an optimisation technique known as the bees algorithm to derive a computational architecture for generating branded design concepts that can meet a specified functional requirement. This combination approach allows shape rules to evolve while evaluating how well the outcomes of the new design concepts meet a specified functional requirement. This paper describes how the combination of the bees algorithm with shape grammar is created to generate branded product concepts, and shows that this approach can outperform a combination of shape grammar with an evolutionary algorithm.
The Product Line Design (PLD) problem is an NP-hard combinatorial optimization problem in marketing that aims at determining an optimal product line through which a firm can optimize a desired objective, like its prof...
详细信息
The Product Line Design (PLD) problem is an NP-hard combinatorial optimization problem in marketing that aims at determining an optimal product line through which a firm can optimize a desired objective, like its profits or market share. Since the PLD problem has been proved to have high complexity in real-life applications, high-quality solutions have been detected by researchers who develop various optimization methods and test their performance. The bees algorithm (BA) is a successful swarm intelligent optimization algorithm which is based on the behavior of bees. The aim of this research is to develop and assess BA in the optimal PLD problem. In this effort, a set of fuzzy rules has been developed to autonomously compute parameters for each individual solution throughout the optimization process. The performance of two BA variants is compared with those of popular previous approaches, using both real and simulated data of customer preferences. The findings reveal that BA constitutes an enhanced alternative approach for designing optimal product lines.
bees algorithm is a population-based method that is a computational bound algorithm whose inspired by the natural behavior of honey bees to finds a near-optimal solution for the search problem. Recently, many parallel...
详细信息
bees algorithm is a population-based method that is a computational bound algorithm whose inspired by the natural behavior of honey bees to finds a near-optimal solution for the search problem. Recently, many parallel swarm based algorithms have been developed for running on GPU (Graphic Processing Unit). Since nowadays developing a parallel Bee algorithm running on the GPU becomes very important. In this paper, we extend the bees algorithm (CUBA (i.e. CUDA based bees algorithm)) in order to be run on the CUDA (Compute Unified Device Architecture). CUBA (CUDA based bees algorithm). We evaluate the performance of CUBA by conducting some experiments based on numerous famous optimization problems. Results show that CUBA significantly outperforms standard bees algorithm in numerous different optimization problems. (C) 2013 Elsevier B.V. All rights reserved.
This paper proposes a novel tool known as Bee for Mining (B4M) for classification tasks, which enables the bees algorithm (BA) to discover rules automatically. In the proposed B4M, two parameters namely quality-weight...
详细信息
This paper proposes a novel tool known as Bee for Mining (B4M) for classification tasks, which enables the bees algorithm (BA) to discover rules automatically. In the proposed B4M, two parameters namely quality-weight and coverage-weight have been added to the BA to avoid any ambiguous situations during the prediction phase. The contributions of the proposed B4M algorithm are two-fold: the first novel contribution is in the field of swarm intelligence, using a new version of BA for automatic rule discovery, and the second novel contribution is the formulation of a weight metric based on quailty and coverage of the rules discovered from the dataset to carry out Meta-Pruning and making it suitable for any classification problem in the real world. The proposed algorithm was implemented and tested using five different datasets from University of California, at Irvine (UCI Machine Learning Repository) and was compared with other well-known classification algorithms. The results obtained using the proposed B4M show that it was capable of achieving better classification accuracy and at the same time reduce the number of rules in four out of five UCI datasets. Furthermore, the results show that it was not only effective and more robust, but also more efficient, making it at least as good as other methods such as C5.0, C4.5, Jrip and other evolutionary algorithms, and in some cases even better.
With the proliferation of graphics processing units (GPU) supporting general-purpose computing (GPGPU), many computationally demanding applications are being redesigned to exploit the capabilities offered by massively...
详细信息
ISBN:
(纸本)9783319234373;9783319234366
With the proliferation of graphics processing units (GPU) supporting general-purpose computing (GPGPU), many computationally demanding applications are being redesigned to exploit the capabilities offered by massively parallel computing platforms. This paper presents a bees algorithm (BA) for the Quadratic Assignment Problem (QAP) implemented on the CUDA platform. The motivations for our work were twofold: firstly, we wanted to develop a dedicated algorithm to solve the QAP showing both time and optimization performance, secondly, we planned to check if the capabilities offered by popular GPUs can be exploited to accelerate hard optimization tasks requiring high computational power. The paper describes both sequential and parallel algorithm implementations, as well as reports results of tests.
This paper proposes a novel algorithm for utilizing bees algorithm in a model predictive control (MPC) in order to control a class of nonlinear systems. The bees algorithm is utilized in order to solve the open loop o...
详细信息
This paper proposes a novel algorithm for utilizing bees algorithm in a model predictive control (MPC) in order to control a class of nonlinear systems. The bees algorithm is utilized in order to solve the open loop optimization problem (OOP), and it is based on the foraging behavior of honey bees. The proposed algorithm makes use of the bees algorithm for minimizing a predefined cost function in order to find the best input signals subject to constraints and a model of the system. The class of systems considered in this paper includes autonomous nonlinear systems without delay and with continuous and discrete inputs. The proposed algorithm is validated by simulating a three tank system as a case study. A comparison between the proposed novel MPC with different predictive horizons and a conventional MPC demonstrates the potential advantages of the proposed method such as reduction in computation time, good convergence toward desired values and ability of control management. Simulations also show the simplicity of applying and efficiency of the proposed algorithm for designing an MPC based on the bees algorithm. (C) 2014 Elsevier B.V. All rights reserved.
In this paper, an enhanced version of the bees algorithm is proposed in dealing with multi-objective supply chain model to find the optimum configuration of a given supply chain problem in order to minimise the total ...
详细信息
In this paper, an enhanced version of the bees algorithm is proposed in dealing with multi-objective supply chain model to find the optimum configuration of a given supply chain problem in order to minimise the total cost and the total lead-time. The new bees algorithm includes an adaptive neighbourhood size change and site abandonment (ANSSA) strategy which is an enhancement to the basic bees algorithm. The supply chain case study utilised in this work is taken from literature and several experiments have been conducted in order to show the performances, the strength, the weaknesses of the proposed method and the results have been compared to those achieved by the basic bees algorithm and Ant Colony optimisation. The results show that the proposed ANSSA-based bees algorithm is able to achieve better Pareto solutions for the supply chain problem. (C) 2014 Elsevier B.V. All rights reserved.
暂无评论