1,982 research outputs found
Guest editorial: Memetic computing in the presence of uncertainties
Copyright @ Springer-Verlag 2010.The Guest Editors acknowledge the research support by the Academy of Finland, Akatemiatutkija 130600, Algorithmic
Design Issues in Memetic Computing, and by the UK Engineering and Physical Sciences Research Council (EPSRC) Project: Evolutionary Algorithms for Dynamic Optimisation Problems, under Grant EP/E060722/1
Metaheuristic design of feedforward neural networks: a review of two decades of research
Over the past two decades, the feedforward neural network (FNN) optimization has been a key interest among the researchers and practitioners of multiple disciplines. The FNN optimization is often viewed from the various perspectives: the optimization of weights, network architecture, activation nodes, learning parameters, learning environment, etc. Researchers adopted such different viewpoints mainly to improve the FNN's generalization ability. The gradient-descent algorithm such as backpropagation has been widely applied to optimize the FNNs. Its success is evident from the FNN's application to numerous real-world problems. However, due to the limitations of the gradient-based optimization methods, the metaheuristic algorithms including the evolutionary algorithms, swarm intelligence, etc., are still being widely explored by the researchers aiming to obtain generalized FNN for a given problem. This article attempts to summarize a broad spectrum of FNN optimization methodologies including conventional and metaheuristic approaches. This article also tries to connect various research directions emerged out of the FNN optimization practices, such as evolving neural network (NN), cooperative coevolution NN, complex-valued NN, deep learning, extreme learning machine, quantum NN, etc. Additionally, it provides interesting research challenges for future research to cope-up with the present information processing era
Multiobjective programming for type-2 hierarchical fuzzy inference trees
This paper proposes a design of hierarchical fuzzy inference tree (HFIT). An HFIT produces an
optimum tree-like structure. Specifically, a natural hierarchical structure that accommodates simplicity by
combining several low-dimensional fuzzy inference systems (FISs). Such a natural hierarchical structure
provides a high degree of approximation accuracy. The construction of HFIT takes place in two phases.
Firstly, a nondominated sorting based multiobjective genetic programming (MOGP) is applied to obtain a
simple tree structure (low model’s complexity) with a high accuracy. Secondly, the differential evolution
algorithm is applied to optimize the obtained tree’s parameters. In the obtained tree, each node has a
different input’s combination, where the evolutionary process governs the input’s combination. Hence,
HFIT nodes are heterogeneous in nature, which leads to a high diversity among the rules generated
by the HFIT. Additionally, the HFIT provides an automatic feature selection because it uses MOGP
for the tree’s structural optimization that accept inputs only relevant to the knowledge contained in
data. The HFIT was studied in the context of both type-1 and type-2 FISs, and its performance was
evaluated through six application problems. Moreover, the proposed multiobjective HFIT was compared
both theoretically and empirically with recently proposed FISs methods from the literature, such as
McIT2FIS, TSCIT2FNN, SIT2FNN, RIT2FNS-WB, eT2FIS, MRIT2NFS, IT2FNN-SVR, etc. From the
obtained results, it was found that the HFIT provided less complex and highly accurate models compared
to the models produced by most of the other methods. Hence, the proposed HFIT is an efficient and
competitive alternative to the other FISs for function approximation and feature selectio
Elite Accumulative Sampling Strategies for Noisy Multi-Objective Optimisation
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-15892-1_128th International Conference on Evolutionary Multi-Criterion Optimization 2015, Guimarães, Portugal, 29 March - 1 April 1 2015The codebase for this paper is available at https://github.com/fieldsend/EMO_2015_eliteWhen designing evolutionary algorithms one of the key concerns is the balance between expending function evaluations on exploration versus exploitation. When the optimisation problem experiences observational noise, there is also a trade-off with respect to accuracy refinement – as improving the estimate of a design’s performance typically is at the cost of additional function reevaluations. Empirically the most effective resampling approach developed so far is accumulative resampling of the elite set. In this approach elite members are regularly reevaluated, meaning they progressively accumulate reevaluations over time. This results in their approximated objective values having greater fidelity, meaning non-dominated solutions are more likely to be correctly identified. Here we examine four different approaches to accumulative resampling of elite members, embedded within a differential evolution algorithm. Comparing results on 40 variants of the unconstrained IEEE CEC’09 multi-objective test problems, we find that at low noise levels a low fixed resample rate is usually sufficient, however for larger noise magnitudes progressively raising the number of minimum resamples of elite members based on detecting estimated front oscillation tends to improve performance
Meta-heuristic algorithms in car engine design: a literature survey
Meta-heuristic algorithms are often inspired by natural phenomena, including the evolution of species in Darwinian natural selection theory, ant behaviors in biology, flock behaviors of some birds, and annealing in metallurgy. Due to their great potential in solving difficult optimization problems, meta-heuristic algorithms have found their way into automobile engine design. There are different optimization problems arising in different areas of car engine management including calibration, control system, fault diagnosis, and modeling. In this paper we review the state-of-the-art applications of different meta-heuristic algorithms in engine management systems. The review covers a wide range of research, including the application of meta-heuristic algorithms in engine calibration, optimizing engine control systems, engine fault diagnosis, and optimizing different parts of engines and modeling. The meta-heuristic algorithms reviewed in this paper include evolutionary algorithms, evolution strategy, evolutionary programming, genetic programming, differential evolution, estimation of distribution algorithm, ant colony optimization, particle swarm optimization, memetic algorithms, and artificial immune system
Towards the Evolution of Novel Vertical-Axis Wind Turbines
Renewable and sustainable energy is one of the most important challenges
currently facing mankind. Wind has made an increasing contribution to the
world's energy supply mix, but still remains a long way from reaching its full
potential. In this paper, we investigate the use of artificial evolution to
design vertical-axis wind turbine prototypes that are physically instantiated
and evaluated under approximated wind tunnel conditions. An artificial neural
network is used as a surrogate model to assist learning and found to reduce the
number of fabrications required to reach a higher aerodynamic efficiency,
resulting in an important cost reduction. Unlike in other approaches, such as
computational fluid dynamics simulations, no mathematical formulations are used
and no model assumptions are made.Comment: 14 pages, 11 figure
- …