Due to the complex constraints, more uncertain factors and critical real-time demand of path planning for multiple unmanned surface vehicle (multi-USV), an improved artificialbeecolony (I-ABC) algorithm were propose...
详细信息
ISBN:
(数字)9781510617261
ISBN:
(纸本)9781510617261;9781510617254
Due to the complex constraints, more uncertain factors and critical real-time demand of path planning for multiple unmanned surface vehicle (multi-USV), an improved artificialbeecolony (I-ABC) algorithm were proposed to solve the model of cooperative path planning for multi-USV. First the Voronoi diagram of battle field space is conceived to generate the optimal area of USVs paths. Then the chaotic searching algorithm is used to initialize the collection of paths, which is regard as foods of the ABC algorithm. With the limited data, the initial collection can search the optimal area of paths perfectly. Finally simulations of the multi-USV path planning under various threats have been carried out. Simulation results verify that the I-ABC algorithm can improve the diversity of nectar source and the convergence rate of algorithm. It can increase the adaptability of dynamic battlefield and unexpected threats for USV.
Managing power generation is very important in the process of distributing electrical energy to consumers to get optimal power generation in the system with minimum cost. In this study, an artificialbeecolony algori...
详细信息
Managing power generation is very important in the process of distributing electrical energy to consumers to get optimal power generation in the system with minimum cost. In this study, an artificial bee colony algorithm is proposed to get the best economic dispatch solution for the 150 kV Sulselbar electric system in Indonesia by considering losses, generation limits and ramp rate for each unit. Simulation results from the same system are compared with the Lagrange method which only considers the generator power limit. Besides that, voltage stability of the system is also evaluated using the L index including the loading margin on buses which are considered weak. Results have shown the proposed method (artificial bee colony algorithm) is able to provide the best solution for dynamic economic dispatch to the observed system.
The max-cut problem (MCP) has many applications in different areas. This paper develops a hybrid binary artificial bee colony algorithm (HBABC) to solve MCP. First, a surjection mapping function is used to map a real ...
详细信息
The max-cut problem (MCP) has many applications in different areas. This paper develops a hybrid binary artificial bee colony algorithm (HBABC) to solve MCP. First, a surjection mapping function is used to map a real vector to a binary vector. Then, the basic artificial bee colony algorithm is modified for solving the max-cut problem. In addition, to improve the performance of ABC, a local search procedure is employed. The HBABC is tested on 24 instances from the literature. Numerical results indicate that the HBABC is very efficient.
The single row layout problem (SRLP) is defined as the optimal arrangement of n machines with varying length along a straight line in order to minimize the weighted sum of distances between all machine pairs. In this ...
详细信息
ISBN:
(纸本)9783319672236;9783319672229
The single row layout problem (SRLP) is defined as the optimal arrangement of n machines with varying length along a straight line in order to minimize the weighted sum of distances between all machine pairs. In this paper, an artificialbeecolony (ABC) metaheuristic is proposed to solve the SRLP considering sequence-dependent, asymmetric clearances for the first time. The algorithm is evaluated on several benchmark instances selected from literature as well as random generated ones involving up to n = 60 machines. By comparing the computational results, either to optimal or best known solutions, it is revealed that our ABC performs efficiently, especially for instances with sequence-dependent asymmetric clearances.
In order to solve the problem of multi-pipeline layout in building environment, an initial path pipeline based on probabilistic selection generation is designed and solved with co-evolution and artificialbeecolony a...
详细信息
ISBN:
(纸本)9781538654163
In order to solve the problem of multi-pipeline layout in building environment, an initial path pipeline based on probabilistic selection generation is designed and solved with co-evolution and artificial bee colony algorithm. This paper presents the application of artificialbeecolony co-evolution algorithm in multi-pipeline automatic layout. Each pipeline corresponds to a population. On the one hand, it evolves independently;at the same time, it adopts cooperative coevolution to optimize the pipeline layout in the building model. The resulting simulation solutions show that the multi-pipeline automatic layout solved by this algorithm is suitable for the application in the building environment model.
Hydraulic shaking table is an important device to stimulate vibration environment, which has been widely applied to seismic simulation, aerospace and construction engineering. However, the response from the hydraulic ...
详细信息
ISBN:
(纸本)9780791851425
Hydraulic shaking table is an important device to stimulate vibration environment, which has been widely applied to seismic simulation, aerospace and construction engineering. However, the response from the hydraulic shaking table are not considered sinusoid waveform when corresponds to a sinusoidal acceleration excitation due to the presence of harmonic distortion. This work presents an approach based on the artificialbeecolony (ABC) algorithm for the harmonic component estimation in a hydraulic shaking table. The results demonstrate that the proposed method can precisely identify the harmonic component and it has great advantage of convergence as well as real-time performance.
In this paper, an improved artificialbeecolony (ABC) algorithm is proposed to solve the problem of mobile robot's path planning. At first, the synchronization mechanism is proposed to accelerate the slow converg...
详细信息
ISBN:
(纸本)9781728113128
In this paper, an improved artificialbeecolony (ABC) algorithm is proposed to solve the problem of mobile robot's path planning. At first, the synchronization mechanism is proposed to accelerate the slow convergence rate of the standard artificialcolonyalgorithm. Second, because the standard artificial bee colony algorithm is easy to fall into the local optimal solution. An adaptive variable step size search strategy is designed to adjust the search step to jump out of the local optimal solution in each search process. In the simulation experiments, the improved beecolonyalgorithm is analyzed and compared with the standard artificial bee colony algorithm in different map scale and obstacle rate. From the experimental results, it can be drawn that the algorithm of this paper can effectively accelerate the convergence speed, smooth the search path and reduce the path length.
the feature selection is the one of important data preprocessing methods in classification problems. The more evolutionary algorithms have been used to reduce the features. In this paper, a new approach is proposed ba...
详细信息
ISBN:
(纸本)9781538649787
the feature selection is the one of important data preprocessing methods in classification problems. The more evolutionary algorithms have been used to reduce the features. In this paper, a new approach is proposed based on the support vector machine and the artificial bee colony algorithm, called MABC-SVM, to improve the accuracy classification using an effective subset of features. In order to simultaneously optimize the parameters of support vector machine and select an effective set of input features, a hybrid algorithm called Mixed-ABC has been proposed that combines the binary ABC algorithm with continuous ABC algorithm. The evaluation results on a number of data sets in the UCI show that in most cases the MABC-SVM presents the better results than other classification methods.
In this paper, sparse linear-phase FIR digital filters are designed using artificialbeecolony (ABC) algorithm. Sparse digital filters can be used in applications where computational cost and complexities are of conc...
详细信息
ISBN:
(纸本)9781538673928
In this paper, sparse linear-phase FIR digital filters are designed using artificialbeecolony (ABC) algorithm. Sparse digital filters can be used in applications where computational cost and complexities are of concern as zero-valued coefficients eliminate multiplications required for implementation. In this method, sparse digital filters are designed using minimax optimization by ABC algorithm and successive elimination. In contrast to methods which minimize insignificant coefficient values, this method eliminates insignificant coefficients by setting them to zero. The sparse linear-phase FIR filters designed using ABC algorithm are compared to the partial l(1)-norm optimization design, the minimum increase design, and the smallest coefficient design to illustrate the effectiveness of each design method.
This proposed paper presents a design approach for two-channel quadrature mirror filter (QMF) bank using improved artificial bee colony algorithm. artificial bee colony algorithm has been modified by fine tuning some ...
详细信息
This proposed paper presents a design approach for two-channel quadrature mirror filter (QMF) bank using improved artificial bee colony algorithm. artificial bee colony algorithm has been modified by fine tuning some existing control parameters. Here QMF bank design is used for a lowpass prototype FIR filter design problem. The objective function is the minimizing of mean square error of magnitude responses between desired and designed low-pass prototype FIR filters. The objective function is minimized by using the modified ABC algorithm yielding improved results. Two design examples are also presented to show the efficiency of the proposed method over the existing methods in the literature. The results of the proposed design approach have also been compared with that of the produced results in the literature.
暂无评论