Search results for "evolutionary computation"
showing 10 items of 113 documents
Artificial neural networks for neutron/ γ discrimination in the neutron detectors of NEDA
2020
Three different Artificial Neural Network architectures have been applied to perform neutron/? discrimination in NEDA based on waveform and time-of-flight information. Using the coincident ?-rays from AGATA, we have been able to measure and compare on real data the performances of the Artificial Neural Networks as classifiers. While the general performances are quite similar for the data set we used, differences, in particular related to the computing times, have been highlighted. One of the Artificial Neural Network architecture has also been found more robust to time misalignment of the waveforms. Such a feature is of great interest for online processing of waveforms. Narodowe Centrum Nau…
A double-shell design approach for multiobjective optimal design of microgrids
2010
This work develops a new double shell approach to optimal design for multi-objective optimally managed systems. The cost of each design solution can be defined by the evaluation of operational issues and capital costs. In most systems, the correct definition of operational issues can be deduced by means of the solution of a multi-objective optimization problem. The evaluation of each design solution must thus be deduced using the outcome of a multi-objective optimization run, namely a Pareto hyper-surface in the n-dimensional space of operational objectives. In the literature, the design problem is usually solved by considering a single objective formulation of the operational issue. In thi…
Connections of reference vectors and different types of preference information in interactive multiobjective evolutionary algorithms
2016
We study how different types of preference information coming from a human decision maker can be utilized in an interactive multiobjective evolutionary optimization algorithm (MOEA). The idea is to convert different types of preference information into a unified format which can then be utilized in an interactive MOEA to guide the search towards the most preferred solution(s). The format chosen here is a set of reference vectors which is used within the interactive version of the reference vector guided evolutionary algorithm (RVEA). The proposed interactive RVEA is then applied to the multiple-disk clutch brake design problem with five objectives to demonstrate the potential of the idea in…
Agents Displacement in Arbitrary Geometrical Spaces: An Evolutionary Computation based Approach
2015
In many different social contexts, communication allows a collective intelligence to emerge. However, a correct way of exchanging information usually requires determined topological configurations of the agents involved in the process. Such a configuration should take into account several parameters, e.g. agents positioning, their proximity and time efficiency of communication. Our aim is to present an algorithm, based on evolutionary programming, which optimizes agents placement on arbitrarily shaped areas. In order to show its ability to deal with arbitrary bi-dimensional topologies, this algorithm has been tested on a set of differently shaped areas that present concavities, convexities …
"Table 5" of "Measurement of exclusive $\gamma\gamma\rightarrow \ell^+\ell^-$ production in proton-proton collisions at $\sqrt{s} = 7$ TeV with the A…
2015
Acoplanarity (ACO) distributions unfolded for detector resolution, and lepton pair trigger, reconstruction and identification efficiencies for e+ e- channel (empty bins are not reported).
"Table 36" of "Centrality dependence of Pi, K, p production in Pb-Pb collisions at sqrt(sNN) = 2.76 TeV"
2018
p/pi ratio in Pb-Pb collisions at sqrt(sNN) = 2.76 TeV.
Surrogate-assisted evolutionary biobjective optimization for objectives with non-uniform latencies
2018
We consider multiobjective optimization problems where objective functions have different (or heterogeneous) evaluation times or latencies. This is of great relevance for (computationally) expensive multiobjective optimization as there is no reason to assume that all objective functions should take an equal amount of time to be evaluated (particularly when objectives are evaluated separately). To cope with such problems, we propose a variation of the Kriging-assisted reference vector guided evolutionary algorithm (K-RVEA) called heterogeneous K-RVEA (short HK-RVEA). This algorithm is a merger of two main concepts designed to account for different latencies: A single-objective evolutionary a…
A Surrogate-assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-objective Optimization
2018
We propose a surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive optimization problems with more than three objectives. The proposed algorithm is based on a recently developed evolutionary algorithm for many-objective optimization that relies on a set of adaptive reference vectors for selection. The proposed surrogateassisted evolutionary algorithm uses Kriging to approximate each objective function to reduce the computational cost. In managing the Kriging models, the algorithm focuses on the balance of diversity and convergence by making use of the uncertainty information in the approximated objective values given by the Kriging models, the distr…
Scatter Search vs. Genetic Algorithms
2005
The purpose of this work is to compare the performance of a scatter search (SS) implementation and an implementation of a genetic algorithm (GA) in the context of searching for optimal solutions to permutation problems. Scatter search and genetic algorithms are members of the evolutionary computation family. That is, they are both based on maintaining a population of solutions for the purpose of generating new trial solutions. Our computational experiments with four well-known permutation problems reveal that in general a GA with local search outperforms one without it. Using the same problem instances, we observed that our specific scatter search implementation found solutions of a higher …
BoltzmaNN: Predicting effective pair potentials and equations of state using neural networks
2019
Neural networks (NNs) are employed to predict equations of state from a given isotropic pair potential using the virial expansion of the pressure. The NNs are trained with data from molecular dynamics simulations of monoatomic gases and liquids, sampled in the NVT ensemble at various densities. We find that the NNs provide much more accurate results compared to the analytic low-density limit estimate of the second virial coefficient and the Carnahan-Starling equation of state for hard sphere liquids. Furthermore, we design and train NNs for computing (effective) pair potentials from radial pair distribution functions, g(r), a task that is often performed for inverse design and coarse-graini…