Search

Deep learning for electroencephalogram-based classification is confronted with data scarcity, due to the time-consuming and expensive data collection procedure. Data augmentation has been shown as an effective way to improve data efficiency. In addition, contrastive learning has recently been shown to hold great promise in learning effective representations without human supervision, which has the potential to improve the electroencephalogram-based recognition performance with limited labeled data. However, heavy data augmentation is a key ingredient of contrastive learning. In view of the limited number of sample-based data augmentation in electroencephalogram processing, three methods, performance-measure-based time warp, frequency noise addition and frequency masking, are proposed based on the characteristics of electroencephalogram signal. These methods are parameter learning free, easy to implement, and can be applied to individual samples. In the experiment, the proposed data augmentation methods are evaluated on three electroencephalogram-based classification tasks, including situation awareness recognition, motor imagery classification and brain-computer interface steady-state visually evoked potentials speller system. Results demonstrated that the convolutional models trained with the proposed data augmentation methods yielded significantly improved performance over baselines. In overall, this work provides more potential methods to cope with the problem of limited data and boost the classification performance in electroencephalogram processing. [ABSTRACT FROM AUTHOR]

Hospitals can predetermine the admission rate and facilitate resource allocation based on valid emergency requests and bed capacity estimation. The excess unoccupied beds can be determined with the help of forecasting the number of discharged patients. Extracting predictive features and mining the temporal patterns from historical observations are crucial for accurate and reliable forecasts. Machine learning algorithms have demonstrated the ability to learn temporal knowledge and make predictions for unseen inputs. This paper utilizes several machine learning algorithms to forecast the inpatient discharges of Singapore hospitals and compare them with statistical methods. A novel ensemble deep learning algorithm based on random vector functional links is established to predict inpatient discharges. The ensemble deep learning framework is optimized in a greedy layer-wise fashion. Several forecasting metrics and statistical tests are utilized to demonstrate the proposed method’s superiority. The proposed algorithm statistically outperforms the benchmark with a ranking of 1.875. Finally, practical implications and future directions are discussed. [ABSTRACT FROM AUTHOR]

The widespread usage of Android-powered devices in the Internet of Things (IoT) makes them susceptible to evolving cybersecurity threats. Most healthcare devices in IoT networks, such as smart watches, smart thermometers, biosensors, and more, are powered by the Android operating system, where preserving the privacy of user-sensitive data is of utmost importance. Detecting Android malware is thus vital for protecting sensitive information and ensuring the reliability of IoT networks. This article focuses on AI-enabled Android malware detection for improving zero trust security in IoT networks, which requires Android applications to be verified and authenticated before providing access to network resources. The zero trust security model requires strict identity verification for every entity trying to access resources on a private network, regardless of whether they are inside or outside the network perimeter. Our proposed solution, DP-RFECV-FNN, an innovative approach to Android malware detection that employs Differential Privacy (DP) within a Feedforward Neural Network (FNN) designed for IoT networks under the zero trust model. By integrating DP, we ensure the confidentiality of data during the detection process, setting a new standard for privacy in cybersecurity solutions. By combining the strengths of DP and zero trust security with the powerful learning capacity of the FNN, DP-RFECV-FNN demonstrates the ability to identify both known and novel malware types and achieves higher accuracy while maintaining strict privacy controls compared with recent papers. DP-RFECV-FNN achieves an accuracy ranging from 97.78% to 99.21% while utilizing static features and 93.49% to 94.36% for dynamic features of Android applications to detect whether it is malware or benign. These results are achieved under varying privacy budgets, ranging from ϵ = 0. 1 to ϵ = 1. 0. Furthermore, our proposed feature selection pipeline enables us to outperform the state-of-the-art by significantly reducing the number of selected features and training time while improving accuracy. To the best of our knowledge, this is the first work to categorize Android malware based on both static and dynamic features through a privacy-preserving neural network model. [ABSTRACT FROM AUTHOR]

In this study, we propose an efficient optimization algorithm that is a hybrid of the iterated greedy and simulated annealing algorithms (hereinafter, referred to as IGSA) to solve the flexible job shop scheduling problem with crane transportation processes (CFJSP). Two objectives are simultaneously considered, namely, the minimization of the maximum completion time and the energy consumptions during machine processing and crane transportation. Different from the methods in the literature, crane lift operations have been investigated for the first time to consider the processing time and energy consumptions involved during the crane lift process. The IGSA algorithm is then developed to solve the CFJSPs considered. In the proposed IGSA algorithm, first, each solution is represented by a 2-D vector, where one vector represents the scheduling sequence and the other vector shows the assignment of machines. Subsequently, an improved construction heuristic considering the problem features is proposed, which can decrease the number of replicated insertion positions for the destruction operations. Furthermore, to balance the exploration abilities and time complexity of the proposed algorithm, a problem-specific exploration heuristic is developed. Finally, a set of randomly generated instances based on realistic industrial processes is tested. Through comprehensive computational comparisons and statistical analyses, the highly effective performance of the proposed algorithm is favorably compared against several efficient algorithms. Note to Practitioners—The flexible job shop scheduling problem (FJSP) can be extended and applied to many types of practical manufacturing processes. Many realistic production processes should consider the transportation procedures, especially for the limited crane resources and energy consumptions during the transportation operations. This study models a realistic production process as an FJSP with crane transportation, wherein two objectives, namely, the makespan and energy consumptions, are to be simultaneously minimized. This study first considers the height of the processing machines, and therefore, the crane lift operations and lift energy consumptions are investigated. A hybrid iterated greedy algorithm is proposed for solving the problem considered, and several problem-specific heuristics are embedded to balance the exploration and exploitation abilities of the proposed algorithm. In addition, the proposed algorithm can be generalized to solve other types of scheduling problems with crane transportations. [ABSTRACT FROM AUTHOR]

In power systems, optimal power flow (OPF) is a complex and constrained optimization problem in which quite often multiple and conflicting objectives are required to be optimized. The traditional way of dealing with multi-objective OPF (MOOPF) is the weighted sum method which converts the multi-objective OPF into a single-objective problem and provides a single solution from the set of Pareto solutions. This paper presents MOOPF study applying multi-objective evolutionary algorithm based on decomposition (MOEA/D) where a set of non-dominated solutions (Pareto solutions) can be obtained in a single run of the algorithm. OPF is formulated with two or more objectives among fuel (generation) cost, emission, power loss and voltage deviation. The other important aspect in OPF problem is about satisfying power system constraints. As the search process adopted by evolutionary algorithms is unconstrained, for a constrained optimization problem like OPF, static penalty function approach has been extensively employed to discard infeasible solutions. This approach requires selection of a suitable penalty coefficient, largely done by trial-and-error, and an improper selection may often lead to violation of system constraints. In this paper, an effective constraint handling method, superiority of feasible solutions (SF), is used in conjunction with MOEA/D to handle network constraints in MOOPF study. The algorithm MOEA/D-SF is applied to standard IEEE 30-bus and IEEE 57-bus test systems. Simulation results are analyzed, especially for constraint violation and compared with recently reported results on OPF. [ABSTRACT FROM AUTHOR]

In recent years, several population-based evolutionary and swarm algorithms have been developed and used in the literature. This work introduces an improved Cultural Algorithm with a modified selection function and a dynamic α -cognition procedure to handle a variety of challenging numerical optimization problems. The modified selection function is used to support a balanced evolutionary search. A process that starts with a clearer exploration early in the search process and gradually begins to focus on exploitation towards the end of the search process. This work uses the elites of each knowledge source that are at a certain distance from each other. The dynamic α -cognition procedure assists in providing effective learning of individuals through preserving the diversity of the population during the evolution process. In this procedure, each individual is able to learn from the top α % individuals controlled by its knowledge source in the belief space, where the proportion of the affecting subpopulation (α) is adaptively modified during the evolution. The performance of the proposed work has been evaluated on the CEC'2010 and CEC'2013 benchmark suites developed for the special sessions on large-scale global optimization problems. An appropriate comparative study with the best results in the literature is presented. The results confirm how the merits of the improved Cultural Algorithm can achieve superior performance over other cutting-edge algorithms for these data sets. • m CA- α C is an enhanced version of CAs with a modified selection function. • CAs uses a dynamic α -cognition procedure that is proposed to introduce effective learning of the individuals though preserving the diversity of the population during the evolution process. • m CA- α C performs competitively against other variants and state-of-the-art algorithms from the literature. • m CA- α C is employed to effectively solve a variety of challenging large scale numerical optimization problems. [ABSTRACT FROM AUTHOR]

In recent years, the research community has witnessed an explosion of literature dealing with the mimicking of behavioral patterns and social phenomena observed in nature towards efficiently solving complex computational tasks. This trend has been especially dramatic in what relates to optimization problems, mainly due to the unprecedented complexity of problem instances, arising from a diverse spectrum of domains such as transportation, logistics, energy, climate, social networks, health and industry 4.0, among many others. Notwithstanding this upsurge of activity, research in this vibrant topic should be steered towards certain areas that, despite their eventual value and impact on the field of bio-inspired computation, still remain insufficiently explored to date. The main purpose of this paper is to outline the state of the art and to identify open challenges concerning the most relevant areas within bio-inspired optimization. An analysis and discussion are also carried out over the general trajectory followed in recent years by the community working in this field, thereby highlighting the need for reaching a consensus and joining forces towards achieving valuable insights into the understanding of this family of optimization techniques. [ABSTRACT FROM AUTHOR]

Abstract Optimal active–reactive power dispatch problems (OARPD) are non-convex and highly nonlinear complex optimization problems. Typically, such problems are expensive in terms of computational time and cost due to the load variations over the scheduling period. The conventional constraint-based solvers that are generally used to tackle such problems require a considerable high budget and may not provide high quality solutions. In the last decade, complexity of OARPD has further increased due to the incorporation of renewable energy sources such as: wind, solar and small-hydro generators. More specifically, the incorporation of renewable sources introduces uncertainty in generation on top of the load variations in conventional OARPD, making the problem more complicated. Recently, Differential Evolution (DE) is viewed as an excellent algorithm to solve OARPD problems, due to its effectiveness to optimize the objective function which is subject to many operational constraints. A new efficient Differential Evolution algorithm, denoted as DE a -AR, is propounded to solve the contemporary stochastic optimal power flow OARPD problems considering the renewable generators. DE a -AR uses arithmetic recombination crossover and adapts the scaling factor based on Laplace distribution. In addition, an efficient archive strategy that acts as a corresponding image of the population and stores the inferior individuals for later use, is also incorporated. The target behind using this strategy is to consider the information of inferior individuals as a direction toward finding new good solutions. The IEEE 57-bus system is used to evaluate the OARPD problems with different stochastic scenarios based on different probability distributions employed to model parameters of renewable energy sources. The performance of the proposed work is compared with other state-of-the-art algorithms. Simulation results indicate that the proposed technique can solve the OARPD problems with renewable sources effectively and can provide high quality solutions. The proposed algorithm is ranked the first with a Friedman rank equals to 1.8333 with a clear statistical significant difference compared with the most recent studies on the used problems. Highlights • A new efficient differential evolution algorithm is propounded to solve OPF problems. • The contemporary stochastic OPF with renewable generators is considered. • The performance is compared with the best performing algorithms. • The simulation results indicate that the new technique can provide competitive performance. [ABSTRACT FROM AUTHOR]

Many parameter adaptation methods were proposed for Differential Evolution (DE) algorithm. Although these methods succeed in enhancing the performance of DE when solving a diverse set of optimization problems, locating the optimal solution is still a challenging task in most of these methods for complex optimization problems. To improve the performance of DE, this study presents a new enhanced algorithm based on our published work namely LSHADE with ensemble parameter sinusoidal adaptation, LSHADE-EpSin, which ranked the joint winner in IEEE CEC2016 competition on real-parameter single objective optimization. The method proposes a mixture of two sinusoidal formulas and a Cauchy distribution to balance the exploration and the exploitation of already found best solutions. A restart method is used at later generations to enhance the quality of the found solutions. The proposed algorithm also introduces a novel approach to adapt the population size by using a niching-based reduction scheme. In this mechanism, two separate niches are used before performing the population reduction, to reduce the population size in an effective manner. The proposed algorithm namely ensemble sinusoidal differential evolution with niching reduction, E s DE r -NR, is tested on the IEEE CEC2014 problems used in the special session and competitions on real-parameter single objective optimization of the IEEE CEC2016. The results statistically affirm the efficiency of the proposed approach to obtain better results compared to the other state-of-the-art algorithms from the literature including CMA-ES variants. [ABSTRACT FROM AUTHOR]

Portfolio optimization problems involve selection of different assets to invest in order to maximize the overall return and minimize the overall risk simultaneously. The complexity of the optimal asset allocation problem increases with an increase in the number of assets available to select from for investing. The optimization problem becomes computationally challenging when there are more than a few hundreds of assets to select from. To reduce the complexity of large-scale portfolio optimization, two asset preselection procedures that consider return and risk of individual asset and pairwise correlation to remove assets that may not potentially be selected into any portfolio are proposed in this paper. With these asset preselection methods, the number of assets considered to be included in a portfolio can be increased to thousands. To test the effectiveness of the proposed methods, a Normalized Multiobjective Evolutionary Algorithm based on Decomposition (NMOEA/D) algorithm and several other commonly used multiobjective evolutionary algorithms are applied and compared. Six experiments with different settings are carried out. The experimental results show that with the proposed methods the simulation time is reduced while return-risk trade-off performances are significantly improved. Meanwhile, the NMOEA/D is able to outperform other compared algorithms on all experiments according to the comparative analysis. [ABSTRACT FROM AUTHOR]

Transfer Optimization has gained a remarkable attention from the Swarm and Evolutionary Computation community in the recent years. It is undeniable that the concepts underlying Transfer Optimization are formulated on solid grounds. However, evidences observed in recent contributions confirm that there are critical aspects that are not properly addressed to date. This short communication aims to engage the readership around a reflection on these issues, and to provide rationale why they remain unsolved. Specifically, we emphasize on three critical points of Evolutionary Multitasking Optimization: (i) the plausibility and practical applicability of this paradigm; (ii) the novelty of some proposed multitasking methods; and (iii) the methodologies used for evaluating newly proposed multitasking algorithms. As a result of this research, we conclude that some important efforts should be directed by the community in order to keep the future of this promising field on the right track. Our ultimate purpose is to unveil gaps in the current literature, so that prospective works can attempt to fix these gaps, avoiding to stumble on the same stones and eventually achieve valuable advances in the area. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) is a simple, yet very effective, population-based search technique. However, it is challenging to maintain a balance between exploration and exploitation behaviors of the DE algorithm. In this paper, we boost the population diversity while preserving simplicity by introducing a multi-population DE to solve large-scale global optimization problems. In the proposed algorithm, called m DE- b ES, the population is divided into independent subgroups, each with different mutation and update strategies. A novel mutation strategy that uses information from either the best individual or a randomly selected one is used to produce quality solutions to balance exploration and exploitation. Selection of individuals for some of the tested mutation strategies utilizes fitness-based ranks of these individuals. Function evaluations are divided into epochs. At the end of each epoch, individuals between the subgroups are exchanged to facilitate information exchange at a slow pace. The performance of the algorithm is evaluated on a set of 19 large-scale continuous optimization problems. A comparative study is carried out with other state-of-the-art optimization techniques. The results show that m DE- b ES has a competitive performance and scalability behavior compared to the contestant algorithms. [ABSTRACT FROM AUTHOR]

Wind speed forecasting is challenging due to its intermittent nature. The wind speed time series (TS) has nonlinear and nonstationary characteristics and not normally distributed, which make it difficult to be predicted by statistical or computational intelligent methods. Empirical mode decomposition (EMD) and its improved versions are powerful tools to decompose a complex TS into a collection of simpler ones. The improved versions discussed in this paper include ensemble EMD (EEMD), complementary EEMD (CEEMD), and complete EEMD with adaptive noise (CEEMDAN). The EMD and its improved versions are hybridized with two computational intelligence-based predictors: support vector regression (SVR) and artificial neural network (ANN). The EMD-based hybrid forecasting methods are evaluated with 12 wind speed TS. The performances of the hybrid methods are compared and discussed. It shows that EMD and its improved versions enhance the performance of SVR significantly but marginally on ANN, and among the EMD-based hybrid methods, the proposed CEEMDAN-SVR is the best method. Possible future works are also recommended for wind speed forecasting. [ABSTRACT FROM PUBLISHER]

Differential evolution (DE) has been a simple yet effective algorithm for global optimization problems. The performance of DE highly depends on its operators and parameter settings. In the last couple of decades, many advanced variants of DE have been proposed by modifying the operators and introducing new parameter tuning methods. However, the majority of the works on advanced DE have been concentrated upon the mutation and crossover operators. The initialization and selection operators are less explored in the literature. In this work, we implement the orthogonal array-based initialization of the population and propose a neighborhood search strategy to construct the initial population for the DE-based algorithms. We also introduce a conservative selection scheme to improve the performance of the algorithm. We analyze the influence of the proposed initialization and selection schemes on several variants of DE. Results suggest that the proposed methods highly improve the performance of DE algorithm and its variants. Furthermore, we introduce an ensemble strategy for parameter adaptation techniques in DE. Incorporating all the proposed initialization, selection, and parameter adaptation strategies, we develop a new variant of DE, named OLSHADE-CS. The performance of OLSHADE-CS is found to be highly competitive and significantly better in many cases when compared with the performance of the state-of-the-art algorithms on CEC benchmark problems. [ABSTRACT FROM AUTHOR]

In this paper, a neighborhood mutation strategy is proposed and integrated with various niching differential evolution (DE) algorithms to solve multimodal optimization problems. Although variants of DE are highly effective in locating a single global optimum, no DE variant performs competitively when solving multi-optima problems. In the proposed neighborhood based differential evolution, the mutation is performed within each Euclidean neighborhood. The neighborhood mutation is able to maintain the multiple optima found during the evolution and evolve toward the respective global/local optimum. To test the performance of the proposed neighborhood mutation DE, a total of 29 problem instances are used. The proposed algorithms are compared with a number of state-of-the-art multimodal optimization approaches and the experimental results suggest that although the idea of neighborhood mutation is simple, it is able to provide better and more consistent performance over the state-of-the-art multimodal algorithms. In addition, a comparative survey on niching algorithms and their applications are also presented. [ABSTRACT FROM AUTHOR]

The performance of traditional beamformers tends to degrade due to inaccurate estimation of covariance matrix and imprecise knowledge of array steering vector. The inaccurate estimation of covariance matrix can be attributed to limited data samples and the presence of desired signal in the training data. The mismatch between the actual and presumed steering vectors can be due to the error in the position (geometry) and/or in the look direction estimate. In this paper, we propose a differential evolution (DE) based robust adaptive beamforming that is able to achieve near optimal performance even in the presence of geometry error. Initially, we estimate an optimal steering vector by maximizing and minimizing the signal power in and out of the desired signal's angular range, respectively. Then, we estimate the look direction and reconstruct the covariance matrix. Based on the obtained steering vector, estimate for look direction and reconstructed covariance matrix, near optimal output SINR, can be obtained with the increase in the input SNR without observing any saturation even in the presence of geometry error. Numerical simulations are presented to demonstrate the efficacy of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The performance degradation in traditional adaptive beamformers can be attributed to the imprecise knowledge of the array steering vector and inaccurate estimation of the covariance matrix. The inaccurate estimation of the covariance matrix is due to the limited data samples and presence of desired signal components in the training data. The mismatch between the actual and presumed steering vectors can be mainly due to the error in the look direction estimate. In this paper, we propose a novel algorithm to estimate the look direction and to reconstruct the covariance matrix so that near optimal performance without the effect of saturation can be achieved as the input SNR increases. Numerical results also show that all existing beamforming algorithms suffer from saturation effect as the input SNR increases. [ABSTRACT FROM AUTHOR]

Different constraint handling techniques have been used with multi-objective evolutionary algorithms (MOEA) to solve constrained multi-objective optimization problems. It is impossible for a single constraint handling technique to outperform all other constraint handling techniques always on every problem irrespective of the exhaustiveness of the parameter tuning. To overcome this selection problem, an ensemble of constraint handling methods (ECHM) is used to tackle constrained multi-objective optimization problems. The ECHM is integrated with a multi-objective differential evolution (MODE) algorithm. The performance is compared between the ECHM and the same single constraint handling methods using the same MODE (using codes available from http://www3.ntu.edu.sg/home/EPNSugan/index.htm). The results show that ECHM overall outperforms the single constraint handling methods. [ABSTRACT FROM AUTHOR]

The global best (gbest) or local best (lbest) of every particle in state-of-the-art multi-objective particle swarm optimization (MOPSO) implementations is selected from the non-dominated solutions in the external archive. This approach emphasizes the elitism at the expense of diversity when the size of the current set of non-dominated solutions in the external archive is small. This article proposes that the gbests or lbests should be chosen from the top fronts in a non-domination sorted external archive of reasonably large size. In addition, a novel two local bests (lbest) based MOPSO (2LB-MOPSO) version is proposed to focus the search around small regions in the parameter space in the vicinity of the best existing fronts unlike the current MOPSO variants in which the pbest and gbest (or lbest) of a particle can be located far apart in the parameter space thereby potentially resulting in a chaotic search behaviour. Comparative evaluation using 19 multi-objectives test problems and 11 state-of-the-art multi-objective evolutionary algorithms ranks overall the 2LB-MOPSO as the best while two state-of-the-art MOPSO algorithms are ranked the worst with respect to other multi-objective evolutionary algorithms. [ABSTRACT FROM AUTHOR]

This article presents a local-best harmony search algorithm with dynamic subpopulations (DLHS) for solving the bound-constrained continuous optimization problems. Unlike existing harmony search algorithms, the DLHS algorithm divides the whole harmony memory (HM) into many small-sized sub-HMs and the evolution is performed in each sub-HM independently. To maintain the diversity of the population and to improve the accuracy of the final solution, information exchange among the sub-HMs is achieved by using a periodic regrouping schedule. Furthermore, a novel harmony improvisation scheme is employed to benefit from good information captured in the local best harmony vector. In addition, an adaptive strategy is developed to adjust the parameters to suit the particular problems or the particular phases of search process. Extensive computational simulations and comparisons are carried out by employing a set of 16 benchmark problems from the literature. The computational results show that, overall, the proposed DLHS algorithm is more effective or at least competitive in finding near-optimal solutions compared with state-of-the-art harmony search variants. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) is an efficient and powerful population-based stochastic search technique for solving optimization problems over continuous space, which has been widely applied in many scientific and engineering fields. However, the success of DE in solving a specific problem crucially depends on appropriately choosing trial vector generation strategies, and their associated control parameter values. Employing a trial-and-error scheme to search for the most suitable strategy and its associated parameter settings requires high computational costs. Moreover, at different stages of evolution, different strategies coupled with different parameter settings may be required in order to achieve the best performance. In this paper, we propose a self-adaptive DE (SaDE) algorithm, in which both trial vector generation strategies and their associated control parameter values are gradually self-adapted by learning from their previous experiences in generating promising solutions. Consequently, a more suitable generation strategy along with its parameter settings can be determined adaptively to match different phases of the search process/evolution. The performance of the SaDE algorithm is extensively evaluated (using codes available from P. N. Suganthan) on a suite of 26 bound-constrained numerical optimization problems and compares favorably with the conventional DE and several state-of-the-art parameter adaptive DE variants. [ABSTRACT FROM AUTHOR]

Background: Odorant binding proteins (OBPs) are believed to shuttle odorants from the environment to the underlying odorant receptors, for which they could potentially serve as odorant presenters. Although several sequence based search methods have been exploited for protein family prediction, less effort has been devoted to the prediction of OBPs from sequence data and this area is more challenging due to poor sequence identity between these proteins. Results: In this paper, we propose a new algorithm that uses Regularized Least Squares Classifier (RLSC) in conjunction with multiple physicochemical properties of amino acids to predict odorantbinding proteins. The algorithm was applied to the dataset derived from Pfam and GenDiS database and we obtained overall prediction accuracy of 97.7% (94.5% and 98.4% for positive and negative classes respectively). Conclusion: Our study suggests that RLSC is potentially useful for predicting the odorant binding proteins from sequence-derived properties irrespective of sequence similarity. Our method predicts 92.8% of 56 odorant binding proteins non-homologous to any protein in the swissprot database and 97.1% of the 414 independent dataset proteins, suggesting the usefulness of RLSC method for facilitating the prediction of odorant binding proteins from sequence information. [ABSTRACT FROM AUTHOR]

This article presents an approach to integrate a Pareto dominance concept into a comprehensive learning particle swarm optimizer (CLPSO) to handle multiple objective optimization problems. The multiobjective comprehensive learning particle swarm optimizer (MOCLPSO) also integrates an external archive technique. Simulation results (obtained using the codes made available on the Web at http://www.ntu.edu.sg/home/EPNSugan) on six test problems show that the proposed MOCLPSO, for most problems, is able to find a much better spread of solutions and faster convergence to the true Pareto-optimal front compared to two other multiobjective optimization evolutionary algorithms. © 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 209–226, 2006. [ABSTRACT FROM AUTHOR]

A method of using particle swarm optimisation (PSO) algorithms to optimise the element spacing and lengths of Yagi--Uda antennas is presented. SuperNEC, an object-oriented version of the numerical electromagnetic code (NEC-2) is used to evaluate the performance of various Yagi--Uda antenna designs. In order to show the capabilities of the PSO algorithm in Yagi--Uda antenna design, three different antenna design cases are optimised for various performance specifications. The three objectives considered are gain only, gain and input impedance only, and gain, input impedance and relative sidelobe level (rSLL). To alleviate the premature convergence problem of PSO, a novel learning strategy is employed. Each design problem is optimised using three variants of PSO algorithms, namely the modified PSO, fitness-distance ratio PSO (FDR-PSO), and comprehensive learning PSO (CLPSO). For the purpose of comparison and benchmarking, equally spaced arrays, genetic algorithm optimised antenna design, and computational intelligence optimised antenna design are considered. The results clearly show that the CLPSO is a robust and useful optimisation tool for designing Yagi antennas for the desired target specifications. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel mixed-integer optimization formulation for the optimal design of a reconfigurable antenna array with quantized phase excitations, which is solved by using the generalized generation gap (G3) model genetic algorithm (GA). To reduce effect of mutual coupling between the antenna-array elements, the amplitude excitations' dynamic-range ratio is minimized. The simulation experiments* clearly show an improved performance of the discrete realization of the phase-excitation values, as compared to the continuous realization and subsequent quantization. The effect of quantization on the continuous formulation of phase excitations is also demonstrated. The proposed mixed-integer formulation can be used in practice for the optimal design of dual-beam antenna arrays. © 2005 Wiley Periodicals, Inc. Microwave Opt Technol Lett 45: 461–465, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.20853 [ABSTRACT FROM AUTHOR]

Introduces a genetic algorithm (GA)-based optimization procedure for structural pattern recognition in a model-based recognition system using attributed relational graph (ARG) matching technique. ARG representation; Application of GA for ARG matching; Summary of the pose-clustering algorithm; Presentation of experimental results and discussion.