In current decades, various evolutionary algorithms(EAs) raise as well as many kinds of benchmarks are popular in evaluations of EAs' performances. Since there exists randomness in EAs' performances, the evalu...
详细信息
In current decades, various evolutionary algorithms(EAs) raise as well as many kinds of benchmarks are popular in evaluations of EAs' performances. Since there exists randomness in EAs' performances, the evaluations are made by a large number of runs in simulations or experiments in order to present a relatively fair comparison. However, there still exit several problems that have not been well explained. Does it make sense to deem two algorithms have equal ability if they have same final results? Is it convinced to decide winners or losers in comparisons just by tiny difference in performances? Besides the final results, how to compare algorithms' performances during the optimization iterations? In this paper, a neural network classifier based on extreme learning machine (ELM) is proposed to solve these problems. A novel role of classifier is first proposed to convince the differences between algorithms. If the classifier succeeds to classify algorithms based on their performances recorded in all generations, we deem the two algorithms have so convinced difference that comparisons of two algorithms can reflect algorithms' disparity. Therefore, the conclusions to judge the two algorithms are feasible and acceptable. Otherwise, if classifiers cannot distinguish two algorithms, we deem the two have similar performances so that it is meaningless to differ two algorithms just by tiny differences. By employing a set of classical benchmarks and six EAs, the simulations and computations are conducted. According to the analysis results, the proposed classifier can provide more information to reflect true abilities of algorithms, which is a novel view to compare EAs. (C) 2015 Elsevier B.V. All rights reserved.
This paper presents a technique that incorporates preference information within the framework of multi-objective evolutionary algorithms for the solution of many-objective optimization problems. The proposed approach ...
详细信息
This paper presents a technique that incorporates preference information within the framework of multi-objective evolutionary algorithms for the solution of many-objective optimization problems. The proposed approach employs a single reference point to express the preferences of a decision maker, and adaptively biases the search procedure toward the region of the Pareto-optimal front that best matches its expectations. Experimental results suggest that incorporating preferences within these algorithms leads to improvements in several quality criteria, and that the proposed approach is capable of yielding competitive results when compared against existing algorithms. (C) 2015 Elsevier Inc. All rights reserved.
Multiobjective evolutionary algorithms (MOEAs) are typically proposed, studied, and applied as monolithic blocks with a few numerical parameters that need to be set. Few works have studied how the algorithmic componen...
详细信息
Multiobjective evolutionary algorithms (MOEAs) are typically proposed, studied, and applied as monolithic blocks with a few numerical parameters that need to be set. Few works have studied how the algorithmic components of these evolutionary algorithms can be classified and combined to produce new algorithmic designs. The motivation for studies of this latter type stem from the development of flexible software frameworks and the usage of automatic algorithm configuration methods to find novel algorithm designs. In this paper, we propose an MOEA template and a new conceptual view of its components that surpasses existing frameworks in both number of algorithms that can be instantiated from the template and flexibility to produce novel algorithmic designs. We empirically demonstrate the flexibility of our proposed framework by automatically designing MOEAs for continuous and combinatorial optimization problems. The automatically designed algorithms are often able to outperform six traditional MOEAs from the literature, even after tuning their numerical parameters.
The initial population of an evolutionary algorithm is an important factor which affects the convergence rate and ultimately its ability to find high quality solutions or satisfactory solutions for that matter. If com...
详细信息
The initial population of an evolutionary algorithm is an important factor which affects the convergence rate and ultimately its ability to find high quality solutions or satisfactory solutions for that matter. If composed of good individuals it may bias the search towards promising regions of the search space right from the beginning. Although, if no knowledge about the problem at hand is available, the initial population is most often generated completely random, thus no such behavior can be expected. This paper proposes a method for initializing the population that attempts to identify i.e., to get close to promising parts of the search space and to generate (relatively) good solutions in their proximity. The method is based on clustering and a simple Cauchy mutation. The results obtained on a broad set of standard benchmark functions suggest that the proposed method succeeds in the aforementioned which is most noticeable as an increase in convergence rate compared to the usual initialization approach and a method from the literature. Also, insight into the usefulness of advanced initialization methods in higher-dimensional search spaces is provided, at least to some degree, by the results obtained on higher-dimensional problem instances-the proposed method is beneficial in such spaces as well. Moreover, results on several very high-dimensional problem instances suggest that the proposed method is able to provide a good starting position for the search. (C) 2016 Elsevier Ltd. All rights reserved.
Two evolutionary algorithms are introduced as universal approaches for the identification of water transport characteristics of inorganic porous materials in both absorption and desorption phases. At first, genetic al...
详细信息
Two evolutionary algorithms are introduced as universal approaches for the identification of water transport characteristics of inorganic porous materials in both absorption and desorption phases. At first, genetic algorithm and genetic programming are applied for the inverse analysis of water content profiles measured in an absorption experiment. A comparison of results with the output of the commonly used Boltzmann-Matano approach shows that the calculated diffusivities can reproduce experimental data with a similarly good or even slightly better accuracy. In the second part of investigations, a water desorption experiment is realized for autoclaved aerated concrete, a typical representative of inorganic porous materials used in the construction sector. The genetic algorithm and genetic programming exhibit an excellent performance also in this case. Both approaches can thus be considered as viable, more universal alternatives to the traditional methods.
In orientation to new developments in evolutionary biology we propose an extension of evolutionary algorithms in two dimensions, the regulatory algorithm (RGA). It consists of two levels of vectors, the regulatory vec...
详细信息
In orientation to new developments in evolutionary biology we propose an extension of evolutionary algorithms in two dimensions, the regulatory algorithm (RGA). It consists of two levels of vectors, the regulatory vector and the structural vector. Each element of the regulatory vector is connected with one or several elements of the structural vector, but not vice versa. The connections can be interpreted as steering connections, the switching on or off of the structural elements and/or as switching orders for the structural elements. An RGA that operates with the usual genetic operators of mutation and crossover can be used for avoiding rules like penalty or default operators, it is in certain problems significantly faster than a standard genetic algorithm, and it is very suited when modeling and optimizing systems that consist themselves of different levels. Examples of RGA usage are shown, namely, the optimal dividing of socially deviant youths in a hostel, the optimal introduction of communication standards in information systems, and the allocation of employees to superiors by taking into regard the different personality types.
Bi-level optimisation problems have gained increasing interest in the field of combinatorial optimisation in recent years. In this paper, we analyse the runtime of some evolutionary algorithms for bi-level optimisatio...
详细信息
Bi-level optimisation problems have gained increasing interest in the field of combinatorial optimisation in recent years. In this paper, we analyse the runtime of some evolutionary algorithms for bi-level optimisation problems. We examine two NP-hard problems, the generalised minimum spanning tree problem and the generalised travelling salesperson problem in the context of parameterised complexity. For the generalised minimum spanning tree problem, we analyse the two approaches presented by Hu and Raidl (2012) with respect to the number of clusters that distinguish each other by the chosen representation of possible solutions. Our results show that a (1+1) evolutionary algorithm working with the spanning nodes representation is not a fixed-parameter evolutionary algorithm for the problem, whereas the problem can be solved in fixed-parameter time with the global structure representation. We present hard instances for each approach and show that the two approaches are highly complementary by proving that they solve each other's hard instances very efficiently. For the generalised travelling salesperson problem, we analyse the problem with respect to the number of clusters in the problem instance. Our results show that a (1+1) evolutionary algorithm working with the global structure representation is a fixed-parameter evolutionary algorithm for the problem.
The flight control system is a key element to achieve required performance in missiles and aircrafts. First purpose of flight control system is to ensuring the stability of the system, then, it attempts to force it to...
详细信息
The flight control system is a key element to achieve required performance in missiles and aircrafts. First purpose of flight control system is to ensuring the stability of the system, then, it attempts to force it to track the guidance commands. This paper provides a straightforward method using evolutionary optimisation algorithms to design an appropriate autopilot for non-minimum phase missiles. In order to bring the results to the actual conditions, the missile non-minimum phase model and actuator dynamics with time delay is considered. Proper indices such as system speed, overshoot, undershoot, steady state error and control signal effort have been incorporated to propose an innovative cost function. Then, several applicable meta-heuristic techniques are employed to optimise this cost function. Genetic algorithm, particle swarm optimisation, artificial bee colony, imperialist competitive algorithm and cuckoo search techniques have been compared in this optimisation problem. Simulation results on two benchmark problem show that this method has acceptable speed and it can be used in gain scheduling control design method for non-minimum phase systems. This method can be a suitable replacement for the time consuming procedure of gain tuning in gain scheduling method. The superior advantage of this method compared to the other methods is automatic tuning of the autopilot gains.
In supervised learning, some real problems require the response attribute to represent ordinal values that should increase with some of the explaining attributes. They are called classification problems with monotonic...
详细信息
In supervised learning, some real problems require the response attribute to represent ordinal values that should increase with some of the explaining attributes. They are called classification problems with monotonicity constraints. Hyperrectangles can be viewed as storing objects in R-n which can be used to learn concepts combining instance-based classification with the axis-parallel rectangle mainly used in rule induction systems. This hybrid paradigm is known as nested generalized exemplar learning. In this paper, we propose the selection of the most effective hyperrectangles by means of evolutionary algorithms to tackle monotonic classification. The model proposed is compared through an exhaustive experimental analysis involving a large number of data sets coming from real classification and regression problems. The results reported show that our evolutionary proposal outperforms other instance-based and rule learning models, such as OLM, OSDL, k-NN and MID;in accuracy and mean absolute error, requiring a fewer number of hyperrectangles.
As one of the most challenging combinatorial optimization problems in scheduling, the resource-constrained project scheduling problem (RCPSP) has attracted numerous scholars' interest resulting in considerable res...
详细信息
As one of the most challenging combinatorial optimization problems in scheduling, the resource-constrained project scheduling problem (RCPSP) has attracted numerous scholars' interest resulting in considerable research in the past few decades. However, most of these papers focused on the single objective RCPSP;only a few papers concentrated on the multi-objective resource-constrained project scheduling problems (MORCPSP). Inspired by a procedure called electromagnetism (EM), which can help a generic population based evolutionary search algorithm to obtain good results for single objective RCPSP, in this paper we attempt to extend EM and integrate it into three reputable state-of-the-art multi-objective evolutionary algorithms (MOEAs) i.e. non-dominated sorting based multi-objective evolutionary algorithm (NSGA-II), strength Pareto evolutionary algorithm (SPEA2) and multi-objective evolutionary algorithm based on decomposition (MOEA/D), for MORCPSP. We aim to optimize makespan and total tardiness. Empirical analysis based on standard benchmark datasets are conducted by comparing the versions of integrating EM to NSGA-II, SPEA2 and MOEND with the original algorithms without EM. The results demonstrate that EM can improve the performance of NSGA-II and SPEA2, especially for NSGA-II. (C) 2015 Elsevier B.V. All rights reserved.
暂无评论