88,244 research outputs found
Recommended from our members
Adaptive Algorithms
Overwhelming empirical evidence in computational science and engineering proved that self-adaptive mesh-generation is a must-do in real-life problem computational partial differential equations. The mathematical understanding of corresponding algorithms concerns the overlap of two traditional mathematical disciplines, numerical analysis and approximation theory, with computational sciences. The half workshop was devoted to the mathematics of optimal convergence rates and instance optimality of the Dörfler marking or the maximum strategy in various versions of space discretisations and time-evolution problems with all kind of applications in the efficient numerical treatment of partial differential equations
Freeze-drying modeling and monitoring using a new neuro-evolutive technique
This paper is focused on the design of a black-box model for the process of freeze-drying of pharmaceuticals. A new methodology based on a self-adaptive differential evolution scheme is combined with a back-propagation algorithm, as local search method, for the simultaneous structural and parametric optimization of the model represented by a neural network. Using the model of the freeze-drying process, both the temperature and the residual ice content in the product vs. time can be determine off-line, given the values of the operating conditions (the temperature of the heating shelf and the pressure in the drying chamber). This makes possible to understand if the maximum temperature allowed by the product is trespassed and when the sublimation drying is complete, thus providing a valuable tool for recipe design and optimization. Besides, the black box model can be applied to monitor the freeze-drying process: in this case, the measurement of product temperature is used as input variable of the neural network in order to provide in-line estimation of the state of the product (temperature and residual amount of ice). Various examples are presented and discussed, thus pointing out the strength of the too
Ensemble Differential Evolution with Simulation-Based Hybridization and Self-Adaptation for Inventory Management Under Uncertainty
This study proposes an Ensemble Differential Evolution with Simula-tion-Based
Hybridization and Self-Adaptation (EDESH-SA) approach for inven-tory management
(IM) under uncertainty. In this study, DE with multiple runs is combined with a
simulation-based hybridization method that includes a self-adaptive mechanism
that dynamically alters mutation and crossover rates based on the success or
failure of each iteration. Due to its adaptability, the algorithm is able to
handle the complexity and uncertainty present in IM. Utilizing Monte Carlo
Simulation (MCS), the continuous review (CR) inventory strategy is ex-amined
while accounting for stochasticity and various demand scenarios. This
simulation-based approach enables a realistic assessment of the proposed
algo-rithm's applicability in resolving the challenges faced by IM in practical
settings. The empirical findings demonstrate the potential of the proposed
method to im-prove the financial performance of IM and optimize large search
spaces. The study makes use of performance testing with the Ackley function and
Sensitivity Analysis with Perturbations to investigate how changes in variables
affect the objective value. This analysis provides valuable insights into the
behavior and robustness of the algorithm.Comment: 15 pages, 6 figures, AsiaSIM 2023 (Springer
Microeconomic Structure determines Macroeconomic Dynamics. Aoki defeats the Representative Agent
Masanao Aoki developed a new methodology for a basic problem of economics:
deducing rigorously the macroeconomic dynamics as emerging from the
interactions of many individual agents. This includes deduction of the fractal
/ intermittent fluctuations of macroeconomic quantities from the granularity of
the mezo-economic collective objects (large individual wealth, highly
productive geographical locations, emergent technologies, emergent economic
sectors) in which the micro-economic agents self-organize.
In particular, we present some theoretical predictions, which also met
extensive validation from empirical data in a wide range of systems: - The
fractal Levy exponent of the stock market index fluctuations equals the Pareto
exponent of the investors wealth distribution. The origin of the macroeconomic
dynamics is therefore found in the granularity induced by the wealth / capital
of the wealthiest investors. - Economic cycles consist of a Schumpeter
'creative destruction' pattern whereby the maxima are cusp-shaped while the
minima are smooth. In between the cusps, the cycle consists of the sum of 2
'crossing exponentials': one decaying and the other increasing.
This unification within the same theoretical framework of short term market
fluctuations and long term economic cycles offers the perspective of a genuine
conceptual synthesis between micro- and macroeconomics. Joining another giant
of contemporary science - Phil Anderson - Aoki emphasized the role of rare,
large fluctuations in the emergence of macroeconomic phenomena out of
microscopic interactions and in particular their non self-averaging, in the
language of statistical physics. In this light, we present a simple stochastic
multi-sector growth model.Comment: 42 pages, 6 figure
Recommended from our members
Finding High-Dimensional D-OptimalDesigns for Logistic Models via Differential Evolution
D-optimal designs are frequently used in controlled experiments to obtain the most accurateestimate of model parameters at minimal cost. Finding them can be a challenging task, especially whenthere are many factors in a nonlinear model. As the number of factors becomes large and interact withone another, there are many more variables to optimize and the D-optimal design problem becomes highdimensionaland non-separable. Consequently, premature convergence issues arise. Candidate solutions gettrapped in local optima and the classical gradient-based optimization approaches to search for the D-optimaldesigns rarely succeed. We propose a specially designed version of differential evolution (DE) which is arepresentative gradient-free optimization approach to solve such high-dimensional optimization problems.The proposed specially designed DE uses a new novelty-based mutation strategy to explore the variousregions in the search space. The exploration of the regions will be carried out differently from the previouslyexplored regions and the diversity of the population can be preserved. The proposed novelty-based mutationstrategy is collaborated with two common DE mutation strategies to balance exploration and exploitationat the early or medium stage of the evolution. Additionally, we adapt the control parameters of DE as theevolution proceeds. Using logistic models with several factors on various design spaces as examples, oursimulation results show our algorithm can find D-optimal designs efficiently and the algorithm outperformsits competitors. As an application, we apply our algorithm and re-design a 10-factor car refueling experimentwith discrete and continuous factors and selected pairwise interactions. Our proposed algorithm was able toconsistently outperform the other algorithms and find a more efficient D-optimal design for the problem
Differential evolution with an evolution path: a DEEP evolutionary algorithm
Utilizing cumulative correlation information already existing in an evolutionary process, this paper proposes a predictive approach to the reproduction mechanism of new individuals for differential evolution (DE) algorithms. DE uses a distributed model (DM) to generate new individuals, which is relatively explorative, whilst evolution strategy (ES) uses a centralized model (CM) to generate offspring, which through adaptation retains a convergence momentum. This paper adopts a key feature in the CM of a covariance matrix adaptation ES, the cumulatively learned evolution path (EP), to formulate a new evolutionary algorithm (EA) framework, termed DEEP, standing for DE with an EP. Without mechanistically combining two CM and DM based algorithms together, the DEEP framework offers advantages of both a DM and a CM and hence substantially enhances performance. Under this architecture, a self-adaptation mechanism can be built inherently in a DEEP algorithm, easing the task of predetermining algorithm control parameters. Two DEEP variants are developed and illustrated in the paper. Experiments on the CEC'13 test suites and two practical problems demonstrate that the DEEP algorithms offer promising results, compared with the original DEs and other relevant state-of-the-art EAs
Free Search of real value or how to make computers think
This book introduces in detail Free Search - a novel advanced method for search and optimisation. It also deals with some essential questions that have been raised in a strong debate following the publication of this method in
journal and conference papers. In the light of this debate, Free Search deserves serious attention, as it appears to be superior to other competitive methods in the context of the experimental results obtained. This superiority is not only
quantitative in terms of the actual optimal value found but also qualitative in terms of independence from initial conditions and adaptation capabilities in an unknown environment
- …