Memetic Elitist Pareto Differential Evolution algorithm based Radial Basis Function Networks for classification problems

Broad learning approach to Surrogate-Assisted Multi-Objective evolutionary fuzzy clustering algorithm based on reference points for color image segmentation

This paper proposes a sequential approximate robust design optimization (SARDO) with the radial basis function (RBF) network. In RDO, the mean and the standard deviation of objective should be minimized simultaneously. Therefore, the RDO is generally formulated as bi-objective design optimization. Our goal is to find a robust optimal solution with a small number of function evaluations, not identifying a set of Pareto-optimal solution using Multi-Objective Evolutionary Algorithms. The weighted sum is often used to find a robust optimal solution. In contrast, the weighted lp norm method is used in this paper. Through illustrative examples, some validations of the weighted lp norm method to the RDO are clarified. Next, SARDO with the RBF network is discussed. In general, the standard deviation of functions is obtained by using the finite difference method. Thus, in order to obtain the standard deviation of functions, the finite difference method is directly applied to the response surface. High accuracy of the finite difference method will leads to highly accurate robust optimal solution. In order to avoid the inaccurate numerical calculation, the standard deviation is expressed by only the Gaussian kernel. As the result, it is expected that a highly accurate robust optimal solution can be found with a small number of function evaluations. Through numerical examples, the validity of the proposed approach is examined. Finally, the variable blank holder force trajectory for reducing springback is examined.

An Enhanced multi-objective evolutionary optimization algorithm based on decomposition (E-MOEA-D) proposed for optimal placement of Distributed Generation (DG) and Electric Vehicle (EV) Fast Charging Station (FCS) in distribution system. The diversity of the evolutionary algorithm improves the convergence and diverse solution in the process of evolutionary optimization. The proposed algorithm is improved using enhanced diversity algorithm, which yield diverse candidate solutions in population. The optimal placement of DGs and FCS are formulated using three objective functions as i) Active power loss ii) Voltage deviation iii) DG cost. The proposed algorithm is simulated on IEEE-33 bus distribution system. The proposed algorithm is compared with other competitive multi-objective evolutionary algorithms such as decomposition based multi-objective evolutionary algorithm (MOEA-D) and Non-dominated sorting multi-objective evolutionary algorithm (NSGA-II).

Three learning phases for radial-basis-function networks

Instantaneous learning is a desirable feature in neural networks. This type of learning enables the network to be trained very quickly, typically in just one or two passes of the training set as opposed to hundreds or even thousands of passes for networks trained by an iterative process, such as the error backpropagation (BP) algorithm. This dissertation first reviews several existing types of neural networks with instantaneous learning capability. It then proposes a new network called the Fuzzy Classification (FC) Neural Network that can be trained with two passes of the training samples. The first pass assigns the synaptic weights for the input and output layers. The second pass determines the radius of generalization r for each training sample. The network exhibits fuzziness in two regards: (1) by fuzzification of the location of each training vector in the input space; and (2) by assigning fuzzy memberships of output classes to new input vectors. The operation of the FC network is analyzed from different perspectives, namely, separability of patterns, curve fitting and kernel regression. It is shown that one mode of operation of the FC network can be made to behave like a Radial Basis Function (RBF) network by proper choice of membership function and network parameter. The performance of the FC network as a pattern classifier is also discussed in a statistical framework. The generalization performance of the FC network is compared against that of the CC4 Comer Classification Neural Network, the RBF network, and the Multilayer Perceptron network trained by the BP algorithm. Experiments involving a Henon map time series, a Mackey-Glass time series, and a spiral pattern are used in the comparison. The performance of the FC network is found to be comparable to that of RBF and BP networks, and better than that of the CC4 network. Its performance is also more scalable than those of CC4 and RBF networks. Further, the time taken to design an FC network for any given problem is much shorter compared to the other three networks.

An electronic nose and modular radial basis function network classifiers for recognizing multiple fragrant materials

One of the measures for flood control is to construct a series of small barriers, known also as check dams, on tributaries of watershed stream network. Check dams are generally used in mountainous areas in order to control sediment transport and attenuate flood peak. In this paper, a simulation-based optimization model is developed to determine size, shape and the number of check dams for flood mitigation. HEC-HMS model is used to simulate watershed rainfall-runoff process considering various check dam designs. The model is coupled with a multi-objective evolutionary algorithm, called non-dominated sorting differential evolution (NSDE), to find the trade-off solutions considering three objective functions: 1) minimizing the investment cost, 2) minimizing the flood peak discharge and 3) maximizing the time to peak discharge. The proposed model is applied to a mountainous watershed in Iran and (near) optimal strategies, including the suitable number of check dams in each sub-watershed, and optimal dam size (e.g. optimal height, bottom width and side angles) in each sub-watershed are obtained. The results show that cost-effective designs can decrease peak discharge up to 53%, 54 and 54% corresponding to 2-yr, 5-yr and 10-yr flood return period scenarios, respectively. In addition, the check dams can also increase the time to peak for up to 88%, 81 and 77%, corresponding to 2-yr, 5-yr and 10-yr flood scenarios, respectively.

In recent years, multi-objective evolutionary optimization algorithms have shown success in different areas of research. Due to their efficiency and power, many researchers have concentrated on adapting evolutionary algorithms to generate Pareto solutions. This paper proposes a new memetic adaptive multi-objective evolutionary algorithm that is based on a three-term backpropagation network (MAMOT). This algorithm is an automatic search method for optimizing the parameters and performance of neural networks, and it relies on the use of the adaptive non-dominated sorting genetic algorithm-II integrated with the backpropagation algorithm, being used as a local search method. The presented MAMOT employs a self-adaptive mechanism toward improving the performance of the proposed algorithm and a local optimizer improving all the individuals in a population in order to obtain better accuracy and connection weights. In addition, it selects an appropriate number of hidden nodes simultaneously. The proposed method was applied to 11 datasets representing pattern classification problems, including two-class, multi-class and complex data reflecting real problems. Experiments were performed, and the results indicated that the proposed method is viable in pattern classification tasks compared to a multi-objective genetic algorithm based on a three-term backpropagation network (MOGAT) and some of the methods mentioned in the literature. The statistical analysis results of the t test and Wilcoxon signed-ranks test also show that the performance of the proposed method is significantly better than MOGAT.

Despite the success of Evolutionary Algorithms in solving complex problems, they may require many function evaluations. This becomes an issue when dealing with costly problems. Surrogate models may overcome this difficulty, though their use in problems with medium to large dimensionality is underexplored in the literature. Problems with multiple conflicting objectives can be formulated as Multi-objective Optimization Problems (MOPs). MOPs have received a great attention lately, mainly with Multi-objective Evolutionary Algorithms (MOEAs). This paper proposes ELMOEA/D-DE, a surrogate-assisted MOEA, for solving expensive MOPs in small evaluation budgets. ELMOEA/D-DE encompasses a state-of-the-art MOEA based on decomposition, Differential Evolution (DE) operators and Extreme Learning Machines. This paper tests three variants of ELMOEA/D-DE, using different DE operators, for solving five known benchmark MOPs with 10 to 60 decision variables. All variants achieve good results in terms of hyper volume metric and the best variant with operator DE/rand/1/bin is compared with two state-of-the-art approaches (MOEA/D-RBF and a non-surrogate-based MOEA), achieving the best results in all but one problems instances.

In this paper we propose a methodology based on an evolutionary multiobjective optimization algorithm for the problem of up-grading (expansion) the physical topology of transparent optical networks. The aim is to define the new topology layout and the specification of the new optical devices that should be deployed in an existing network in order to improve its performance, considering simultaneously the total installation cost (capital cost) and the total network blocking probability (performance criteria). To accomplish that, we propose a capital cost model for the network. We considered the following physical layer impairments: losses in optical devices, amplified spontaneous emission in optical amplifier and homodyne crosstalk in optical cross connect. The multiobjective optimization evolutionary algorithm used in the optimization process is the NSGA-II. Our proposed methodology can solve the expand physical topology design problem taking into account the physical layer impairments and the capital costs simultaneously. We also present a case study to show the effectiveness of our methodology.

IBED: Combining IBEA and DE for optimal feature selection in software product line engineering

In this paper, nonlinear dynamic system identification by using multiobjectively selected RBF network is considered. RBF networks are widely used as a model structure for nonlinear systems. The determination of its structure that is the number of basis functions is prior important step in system identification, and the tradeoff between model complexity and accuracy exists in this problem. By using multiobjective evolutionary algorithms, the candidates of the RBF network structure are obtained in the sense of Pareto optimality. We discuss an application to system identification by using such RBF networks having Pareto optimal structures. Some numerical simulations for nonlinear dynamic systems are carried out to show the applicability of the proposed approach.

<p style='text-indent:20px;'>In multi-objective evolutionary algorithms (MOEAs), non-domina-ted sorting is one of the critical steps to locate efficient solutions. A large percentage of computational cost of MOEAs is on non-dominated sorting for it involves numerous comparisons. By now, there are more than ten different non-dominated sorting algorithms, but their numerical performance comparing with each other is not clear yet. It is necessary to investigate the advantage and disadvantage of these algorithms and consequently give suggestions to specific users and algorithm designers. Therefore, a comprehensively numerical study of non-dominated sorting algorithms is presented in this paper. Firstly, we design a population generator. This generator can generate populations with specific features, such as population size, number of Pareto fronts and number of points in each Pareto front. Then non-dominated sorting algorithms were tested using populations generated in certain structures, and results were compared with respect to number of comparisons and time consumption. Furthermore, In order to compare the performance of sorting algorithms in MOEAs, we embed them into a specific MOEA, dynamic sorting genetic algorithm (DSGA), and use these variations of DSGA to solve some multi-objective benchmarks. Results show that dominance degree sorting outperforms the other methods, fast non-dominance sorting performs the worst and the other sorting algorithms performs equally.

Performing a local search around solutions found by an evolutionary algorithm is a common practice. Local search is well known to significantly improve the solutions, in particular in the case of combinatorial problems. In this paper a new local search procedure is proposed that uses a locally established utopia point. In the tests in which several instances of the Travelling Salesman Problem (TSP) were solved using an evolutionary algorithm the proposed local search procedure outperformed a local search procedure based on Pareto dominance. Because the local search is focused on improving individual solutions and the multiobjective evolutionary algorithm can improve diversity, various strategies of sharing computational resources between the evolutionary algorithm and the local search are used in this paper. The results attained by the tested methods are compared with respect to computation time, which allows a fair comparison between strategies that distribute computational resources between the evolutionary optimization and the local search in various proportions.

In data mining, nugget discovery is the discovery of interesting classification rules that apply to a target class. In previous research, heuristic methods (genetic algorithms, simulated annealing and tabu search) have been used to optimise a single measure of interest. This paper proposes the use of multi-objective optimisation evolutionary algorithms to allow the user to interactively select a number of interest measures and deliver the best nuggets (an approximation to the Pareto-optimal set) according to those measures. Initial experiments are conducted on a number of databases, using an implementation of the fast elitist non-dominated sorting genetic algorithm (NSGA), and two well known measures of interest. Comparisons with the results obtained using modern heuristic methods are presented. Results indicate the potential of multi-objective evolutionary algorithms for the task of nugget discovery.