4,827 research outputs found
Evolutionary algorithm-based analysis of gravitational microlensing lightcurves
A new algorithm developed to perform autonomous fitting of gravitational
microlensing lightcurves is presented. The new algorithm is conceptually
simple, versatile and robust, and parallelises trivially; it combines features
of extant evolutionary algorithms with some novel ones, and fares well on the
problem of fitting binary-lens microlensing lightcurves, as well as on a number
of other difficult optimisation problems. Success rates in excess of 90% are
achieved when fitting synthetic though noisy binary-lens lightcurves, allowing
no more than 20 minutes per fit on a desktop computer; this success rate is
shown to compare very favourably with that of both a conventional (iterated
simplex) algorithm, and a more state-of-the-art, artificial neural
network-based approach. As such, this work provides proof of concept for the
use of an evolutionary algorithm as the basis for real-time, autonomous
modelling of microlensing events. Further work is required to investigate how
the algorithm will fare when faced with more complex and realistic microlensing
modelling problems; it is, however, argued here that the use of parallel
computing platforms, such as inexpensive graphics processing units, should
allow fitting times to be constrained to under an hour, even when dealing with
complicated microlensing models. In any event, it is hoped that this work might
stimulate some interest in evolutionary algorithms, and that the algorithm
described here might prove useful for solving microlensing and/or more general
model-fitting problems.Comment: 14 pages, 3 figures; accepted for publication in MNRA
Application of an evolutionary algorithm-based ensemble model to job-shop scheduling
In this paper, a novel evolutionary algorithm is applied to tackle job-shop scheduling tasks in manufacturing environments. Specifically, a modified micro genetic algorithm (MmGA) is used as the building block to formulate an ensemble model to undertake multi-objective optimisation problems in job-shop scheduling. The MmGA ensemble is able to approximate the optimal solution under the Pareto optimality principle. To evaluate the effectiveness of the MmGA ensemble, a case study based on real requirements is conducted. The results positively indicate the effectiveness of the MmGA ensemble in undertaking job-shop scheduling problems
Interception and deviation of near Earth objects via solar collector strategy
A solution to the asteroid deviation problem via a low-thrust strategy is proposed. This formulation makes use of the proximal motion equations and a semi-analytical solution of the Gauss planetary equations. The average of the variation of the orbital elements is computed, together with an approximate expression of their periodic evolution. The interception and the deflection phase are optimised together through a global search. The low-thrust transfer is preliminary designed with a shape based method; subsequently the solutions are locally refined through the Differential Dynamic Programming approach. A set of optimal solutions are presented for a deflection mission to Apophis, together with a representative trajectory to Apophis including the Earth escape
Grey-box model identification via evolutionary computing
This paper presents an evolutionary grey-box model identification methodology that makes the best use of a priori knowledge on
a clear-box model with a global structural representation of the physical system under study, whilst incorporating accurate blackbox
models for immeasurable and local nonlinearities of a practical system. The evolutionary technique is applied to building
dominant structural identification with local parametric tuning without the need of a differentiable performance index in the
presence of noisy data. It is shown that the evolutionary technique provides an excellent fitting performance and is capable of
accommodating multiple objectives such as to examine the relationships between model complexity and fitting accuracy during the
model building process. Validation results show that the proposed method offers robust, uncluttered and accurate models for two
practical systems. It is expected that this type of grey-box models will accommodate many practical engineering systems for a better
modelling accuracy
A comparative study of PSO, GSA and SCA in parameters optimization of surface grinding process
The selection of parameters in grinding process remains as a crucial role to guarantee that the machined product quality is at the minimum production cost and maximum production rate. Therefore, it is required to utilize more advance and effective optimization methods to obtain the optimum parameters and resulting an improvement on the grinding performance. In this paper, three optimization algorithms which are particle swarm optimization (PSO), gravitational search, and Sine Cosine algorithms are employed to optimize the grinding process parameters that may either reduce the cost, increase the productivity or obtain the finest surface finish and resulting a higher grinding process performance. The efficiency of the three algorithms are evaluated and comparedwith previous results obtained by other optimization methods on similar studies.The experimental results showed that PSO algorithm achieves better optimization performance in the aspect of convergence rate and accuracy of best solution.Whereas in the comparison of results of previous researchers, the obtained result of PSO proves that it is efficient in solving the complicated mathematical model of surface grinding process with different conditions
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
MIMR-DGSA: unsupervised hyperspectral band selection based on information theory and a modified discrete gravitational search algorithm
Band selection plays an important role in hyperspectral data analysis as it can improve the performance of data analysis without losing information about the constitution of the underlying data. We propose a MIMR-DGSA algorithm for band selection by following the Maximum-Information-Minimum-Redundancy (MIMR) criterion that maximises the information carried by individual features of a subset and minimises redundant information between them. Subsets are generated with a modified Discrete Gravitational Search Algorithm (DGSA) where we definine a neighbourhood concept for feature subsets. A fast algorithm for pairwise mutual information calculation that incorporates variable bandwidths of hyperspectral bands called VarBWFastMI is also developed. Classification results on three hyperspectral remote sensing datasets show that the proposed MIMR-DGSA performs similar to the original MIMR with Clonal Selection Algorithm (CSA) but is computationally more efficient and easier to handle as it has fewer parameters for tuning
- …