Synthesis of linear antenna array using flower pollination algorithm

Linear antenna array (LAA) design is a classical electromagnetic problem. It has been extensively dealt by number of researchers in the past, and different optimization algorithms have been applied for the synthesis of LAA. This paper presents a relatively new optimization technique, namely flower pollination algorithm (FPA) for the design of LAA for reducing the maximum side lobe level (SLL) and null control. The desired antenna is achieved by controlling only amplitudes or positions of the array elements. FPA is a novel meta-heuristic optimization method based on the process of pollination of flowers. The effectiveness and capability of FPA have been proved by taking difficult instances of antenna array design with single and multiple objectives. It is found that FPA is able to provide SLL reduction and steering the nulls in the undesired interference directions. Numerical results of FPA are also compared with the available results in the literature of state-of-the-art algorithms like genetic algorithm, particle swarm optimization, cuckoo search, tabu search, biogeography based optimization (BBO) and others which also proves the better performance of the proposed method. Moreover, FPA is more consistent in giving optimum results as compared to BBO method reported recently in the literature.

     

A novel modified flower pollination algorithm for global optimization

Neural Computing and Applications - The flower pollination algorithm (FPA) is a relatively new natural bio-inspired optimization algorithm that mimics the real-life processes of the flower...     

混合改进的花朵授粉算法

针对花朵授粉算法(FPA)收敛速度慢、精度低的问题,提出了一种混合改进的花朵授粉算法(HFPA)。该算法采用均匀初始化和边界变异提高种群多样性,利用正态分布缩放因子进行全局寻优,加快收敛速度。局部寻优引入变异策略帮助算法跳出局部最优。实验使用7个测试函数,对比原FPA算法其他群智能算法,结果表明:HFPA算法在收敛速度和寻优精度方面均有显著的提高。     

A novel complex-valued bat algorithm

Bat algorithm is a recent optimization algorithm with quick convergence, but its population diversity can be limited in some applications. This paper presents a new bat algorithm based on complex-valued encoding where the real part and the imaginary part will be updated separately. This approach can increase the diversity of the population and expands the dimensions for denoting. The simulation results of fourteen benchmark test functions show that the proposed algorithm is effective and feasible. Compared to the real-valued bat algorithm or particle swarm optimization, the proposed algorithm can get high precision and can almost reach the theoretical value.     

自适应多策略花朵授粉算法

针对花朵授粉算法极易陷入局部最优解且寻优精度不高的问题,提出自适应多策略花朵授粉算法(self-adaptive flower pollination algorithm with multiple strategies,SMFPA)。利用锚点策略提高种群的多样性,采用摄动策略改善全局勘探能力,采用局部搜索增强策略提升其开采最优解的能力。为验证SMFPA的性能,比较5种算法在解决12个测试问题上的寻优结果,实验结果表明,在寻优速度以及寻优精度方面,SMFPA算法表现更优。通过比较算法在管柱设计问题上的寻优结果,进一步评估SMFPA的寻优性能。     

Color image quantization using flower pollination algorithm

Flower pollination algorithm (FPA) is a swarm-based optimization technique that has attracted the attention of many researchers in several optimization fields due to its impressive characteristics. This paper proposes a new application for FPA in the field of image processing to solve the color quantization problem, which is use the mean square error is selected as the objective function of the optimization color quantization problem to be solved. By comparing with the K-means and other swarm intelligence techniques, the proposed FPA for Color Image Quantization algorithm is verified. Computational results show that the proposed method can generate a quantized image with low computational cost. Moreover, the quality of the image generated is better than that of the images obtained by six well-known color quantization methods.

     

On the efficiency of the binary flower pollination algorithm: Application on the antenna positioning problem

The Flower Pollination Algorithm (FPA) is a recently proposed continuous metaheuristic that was claimed to give promising results. However, its potential in binary problems has been vaguely investigated. The use of mapping techniques to adapt metaheuristics to handle binary optimisation problems is a widely-used approach, but these techniques are still fuzzy and misunderstood, since no work thoroughly studied them for a given problem or algorithm. This paper conducts a consistent and systematic study to assess the efficiency of the FPA and the common mapping techniques. This is done through proposing four Binary variants of the FPA (BFPA) that have been got by applying the principal mapping techniques existing in the literature. As benchmark problem; an NP-hard binary one in advanced cellular networks, the Antenna Positioning Problem (APP), is used. In order to assess the scalability, efficiency and robustness of the proposed BFPAs, the experiments have been carried out on realistic, synthetic and random data with different dimensions, and several statistical tests have been carried. Two of the top-ranked algorithms designed to solve the APP; the Population-Based Incremental Learning (PBIL) and the Differential Evolution algorithm (DE), are taken as a comparison basis. The results showed that the normalisation and angle modulation are the best mapping techniques. The experiments also showed that the BFPAs have some shortcomings but, they could outperform the PBIL in 4 out of 13 instances and the DE in 6 out of 13 instances and no statistical difference was found in the remaining instances. Besides, the BFPAs outperformed or gave competitive technical results compared to the PBIL and DE in all problem instances.     

Application of mutation operators to flower pollination algorithm

Flower pollination algorithm (FPA) is a recent addition to the field of nature inspired computing. The algorithm has been inspired from the pollination process in flowers and has been applied to a large spectra of optimization problems. But it has certain drawbacks which prevents its applications as a standard algorithm. This paper proposes new variants of FPA employing new mutation operators, dynamic switching and improved local search. A comprehensive comparison of proposed algorithms has been done for different population sizes for optimizing seventeen benchmark problems. The best variant among these is adaptive-Lévy flower pollination algorithm (ALFPA) which has been further compared with the well-known algorithms like artificial bee colony (ABC), differential evolution (DE), firefly algorithm (FA), bat algorithm (BA) and grey wolf optimizer (GWO). Numerical results show that ALFPA gives superior performance for standard benchmark functions. The algorithm has also been subjected to statistical tests and again the performance is better than the other algorithms.     

Sizing optimization of truss structures using flower pollination algorithm

The recently developed flower pollination algorithm is used to minimize the weight of truss structures, including sizing design variables. The new algorithm can efficiently combine local and global searches, inspired by cross-pollination and self-pollination of flowering plants, respectively. Furthermore, it implements an iterative constraint handling strategy where trial designs are accepted or rejected based on the allowed amount of constraint violation that is progressively reduced as the search process approaches the optimum. This strategy aims to obtain always feasible optimized designs. The new algorithm is tested using three classical sizing optimization problems of 2D and 3D truss structures. Optimization results show that the proposed method is competitive with other state-of-the-art metaheuristic algorithms presented in the literature.     

Parameter estimation for chaotic systems via a hybrid flower pollination algorithm

Neural Computing and Applications - Parameter estimation is a fundamental research issue which has attracted great concern in the control and synchronization of chaotic systems. This problem can be...     

基于改进花授粉算法的RSSI定位方法

针对接收信号强度指示(RSSI)定位算法中采用最小二乘法计算未知节点位置时其定位精度受测距误差影响较大、花授粉算法易陷入局部最优等问题,提出了一种基于改进花授粉算法的RSSI定位方法。从花粉步长权重、局部变异方面对花授粉算法进行改进,采用改进花授粉算法进行未知节点位置估算。仿真结果表明:本文算法的定位精度高,稳定性好,适用于定位精度和稳定性要求较高的场景。     

A trade-off curve computation for linear antenna arrays using an evolutionary multi-objective approach

This paper deals with the main beam width and the maximum minor lobes height trade-off curve approximate computation for linear antenna arrays. Antenna elements with uniform and non-uniform separations are considered. A well-known genetic algorithm is proposed as the methodology for the computation. For the uniform separation case the proposed algorithm is validated against an exact method based on Chebychev polynomials. Experimental results show that non-uniform separation arrays with uniform current excitation outperform uniform separation arrays. This outperformance is given under the criteria of main beam width and height of the maximum minor lobe.     

共形球面阵天线的三维方向图综合算法

在粒子群算法的基础上,吸收了目前主流优化算法的优势并加以改进,得到了一种适用于共形球面阵天线的三维方向图综合算法,该算法针对共形球面阵天线的方向图综合问题,在预先获得天线单元方向图数据的前提下,优化后可以得到三维空间任意指定波束指向及波束宽度的方向图。仿真结果表明:这种三维方向图综合算法可以有效解决共形球面阵天线的方向图综合问题。     

Social spiders optimization and flower pollination algorithm for multilevel image thresholding: A performance study

In this paper, we investigate the ability of two new nature-inspired metaheuristics namely the flower pollination (FP) and the social spiders optimization (SSO) algorithms to solve the image segmentation problem via multilevel thresholding. The FP algorithm is inspired from the biological process of flower pollination. It relies on two basic mechanisms to generate new solutions. The first one is the global pollination modeled in terms of a Levy distribution while the second one is the local pollination that is based on random selection of local solutions. For its part, the SSO algorithm mimics different natural cooperative behaviors of a spider colony. It considers male and female search agents subject to different evolutionary operators. In the two proposed algorithms, candidate solutions are firstly generated using the image histogram. Then, they are evolved according to the dynamics of their corresponding operators. During the optimization process, solutions are evaluated using the between-class variance or Kapur's method. The performance of each of the two proposed approaches has been assessed using a variety of benchmark images and compared against two other nature inspired algorithms from the literature namely PSO and BAT algorithms. Results have been analyzed both qualitatively and quantitatively based on the fitness values of obtained best solutions and two popular performance measures namely PSNR and SSIM indices as well. Experimental results have shown that both SSO and FP algorithms outperform PSO and BAT algorithms while exhibiting equal performance for small numbers of thresholds. For large numbers of thresholds, it was observed that the performance of FP algorithm decreases as it is often trapped in local minima. In contrary, the SSO algorithm provides a good balance between exploration and exploitation and has shown to be the most efficient and the most stable for all images even with the increase of the threshold number. These promising results suggest that the SSO algorithm can be effectively considered as an attractive alternative for the multilevel image thresholding problem.     

Fitness based weighted flower pollination algorithm with mutation strategies for image enhancement

Multimedia Tools and Applications - Flower Pollination Algorithm (FPA) is a well-known swarm intelligence optimization algorithm, which has shown an effective performance by solving many...     

A novel discrete bat algorithm for solving the travelling salesman problem

The travelling salesman problem (TSP) is one of the well-known NP-hard combinatorial optimization and extensively studied problems in discrete optimization. The bat algorithm is a new nature-inspired metaheuristic optimization algorithm introduced by Yang in 2010, especially based on echolocation behavior of microbats when searching their prey. Firstly, this algorithm is used to solve various continuous optimization problems. In this paper we extend a discrete bat-inspired algorithm to solve the famous TSP. Although many algorithms have been used to solve TSP, the main objective of this research is to investigate this discrete version to achieve significant improvements, not only compared to traditional algorithms but also to another metaheuristics. Moreover, this study is based on a benchmark dataset of symmetric TSP from TSPLIB library.     

A novel initial ranging algorithm for OFDMA systems using smart antenna

To improve the capacity of initial ranging （IR） users simultaneously accessing into network and enhance the performance of the IR, a novel IR algorithm is presented for the orthogonal frequency division multiple access systems with the smart antenna. The beamforming weight vectors provided by the antenna array are introduced for the IR users, and the procedures of the multiuser parameter estimation and the interference cancellation are designed. The proposed method can improve the accuracy of the channel estimation of active paths and efficiently reduce the residual multiple access interference. Simulation results show that the proposed method has a much better performance than the available successive multiuser detection and interference cancellation algorithm and accommodates more active ranging users simultaneously accessing into a cell.     

A parallel implementation of seeker optimization algorithm for designing circular and concentric circular antenna arrays

In this paper, a parallel version of seeker optimization algorithm (SOA) is proposed for designing circular and concentric circular antenna arrays with the low sidelobe levels at a fixed beamwidth. The SOA is a relatively new evolutionary optimization algorithm based on the concept of simulating the act of humans’ intelligent search with their memory, experience, and uncertainty reasoning. In this work, The SOA has been parallelized by benefiting from its dividable population form. The numerical results show that the design of circular and concentric circular antenna arrays using the parallel SOA provides good sidelobe levels with a fixed beamwidth. The quality of results obtained by the parallel SOA is checked by comparing with those of several evolutionary algorithms in the literature.     

Optimum design of reinforced concrete retaining walls with the flower pollination algorithm

The flower pollination algorithm (FPA) is an efficient metaheuristic optimization algorithm mimicking the pollination process of flowering species. In this     

A new approach for forecasting OPEC petroleum consumption based on neural network train by using flower pollination algorithm

Petroleum is the live wire of modern technology and its operations, with economic development being positively linked to petroleum consumption. Many meta-heuristic algorithms have been proposed in literature for the optimization of Neural Network (NN) to build a forecasting model. In this paper, as an alternative to previous methods, we propose a new flower pollination algorithm with remarkable balance between consistency and exploration for NN training to build a model for the forecasting of petroleum consumption by the Organization of the Petroleum Exporting Countries (OPEC). The proposed approach is compared with established meta-heuristic algorithms. The results show that the new proposed method outperforms existing algorithms by advancing OPEC petroleum consumption forecast accuracy and convergence speed. Our proposed method has the potential to be used as an important tool in forecasting OPEC petroleum consumption to be used by OPEC authorities and other global oil-related organizations. This will facilitate proper monitoring and control of OPEC petroleum consumption.