31,374 research outputs found
State-of-the-art in aerodynamic shape optimisation methods
Aerodynamic optimisation has become an indispensable component for any aerodynamic design over the past 60 years, with applications to aircraft, cars, trains, bridges, wind turbines, internal pipe flows, and cavities, among others, and is thus relevant in many facets of technology. With advancements in computational power, automated design optimisation procedures have become more competent, however, there is an ambiguity and bias throughout the literature with regards to relative performance of optimisation architectures and employed algorithms. This paper provides a well-balanced critical review of the dominant optimisation approaches that have been integrated with aerodynamic theory for the purpose of shape optimisation. A total of 229 papers, published in more than 120 journals and conference proceedings, have been classified into 6 different optimisation algorithm approaches. The material cited includes some of the most well-established authors and publications in the field of aerodynamic optimisation. This paper aims to eliminate bias toward certain algorithms by analysing the limitations, drawbacks, and the benefits of the most utilised optimisation approaches. This review provides comprehensive but straightforward insight for non-specialists and reference detailing the current state for specialist practitioners
Self-Adaptive Surrogate-Assisted Covariance Matrix Adaptation Evolution Strategy
This paper presents a novel mechanism to adapt surrogate-assisted
population-based algorithms. This mechanism is applied to ACM-ES, a recently
proposed surrogate-assisted variant of CMA-ES. The resulting algorithm,
saACM-ES, adjusts online the lifelength of the current surrogate model (the
number of CMA-ES generations before learning a new surrogate) and the surrogate
hyper-parameters. Both heuristics significantly improve the quality of the
surrogate model, yielding a significant speed-up of saACM-ES compared to the
ACM-ES and CMA-ES baselines. The empirical validation of saACM-ES on the
BBOB-2012 noiseless testbed demonstrates the efficiency and the scalability
w.r.t the problem dimension and the population size of the proposed approach,
that reaches new best results on some of the benchmark problems.Comment: Genetic and Evolutionary Computation Conference (GECCO 2012) (2012
A hybrid swarm-based algorithm for single-objective optimization problems involving high-cost analyses
In many technical fields, single-objective optimization procedures in
continuous domains involve expensive numerical simulations. In this context, an
improvement of the Artificial Bee Colony (ABC) algorithm, called the Artificial
super-Bee enhanced Colony (AsBeC), is presented. AsBeC is designed to provide
fast convergence speed, high solution accuracy and robust performance over a
wide range of problems. It implements enhancements of the ABC structure and
hybridizations with interpolation strategies. The latter are inspired by the
quadratic trust region approach for local investigation and by an efficient
global optimizer for separable problems. Each modification and their combined
effects are studied with appropriate metrics on a numerical benchmark, which is
also used for comparing AsBeC with some effective ABC variants and other
derivative-free algorithms. In addition, the presented algorithm is validated
on two recent benchmarks adopted for competitions in international conferences.
Results show remarkable competitiveness and robustness for AsBeC.Comment: 19 pages, 4 figures, Springer Swarm Intelligenc
A Hierarchical Game with Strategy Evolution for Mobile Sponsored Content and Service Markets
In sponsored content and service markets, the content and service providers
are able to subsidize their target mobile users through directly paying the
mobile network operator, to lower the price of the data/service access charged
by the network operator to the mobile users. The sponsoring mechanism leads to
a surge in mobile data and service demand, which in return compensates for the
sponsoring cost and benefits the content/service providers. In this paper, we
study the interactions among the three parties in the market, namely, the
mobile users, the content/service providers and the network operator, as a
two-level game with multiple Stackelberg (i.e., leader) players. Our study is
featured by the consideration of global network effects owning to consumers'
grouping. Since the mobile users may have bounded rationality, we model the
service-selection process among them as an evolutionary-population follower
sub-game. Meanwhile, we model the pricing-then-sponsoring process between the
content/service providers and the network operator as a non-cooperative
equilibrium searching problem. By investigating the structure of the proposed
game, we reveal a few important properties regarding the equilibrium existence,
and propose a distributed, projection-based algorithm for iterative equilibrium
searching. Simulation results validate the convergence of the proposed
algorithm, and demonstrate how sponsoring helps improve both the providers'
profits and the users' experience
Recommended from our members
Three decades of the Shuffled Complex Evolution (SCE-UA) optimization algorithm: Review and applications
Application of an evolutionary algorithmto simulation of the co2 emission permits marketwith purchase prices
This article describes the problem of the CO2 emission permits market and introduces several important changes to the standard model, in particular a new goal function, transactions with price negotiations between regions and - as a consequence of introducing prices for permits – the possibility of investigating the influence of purchase/sale prices on the market. An additional novelty is the method of simulating such a market, which is based on a specialized evolutionary algorithm (EA).emission permits trading, Kyoto Protocol, evolutionary algorithm
Using numerical plant models and phenotypic correlation space to design achievable ideotypes
Numerical plant models can predict the outcome of plant traits modifications
resulting from genetic variations, on plant performance, by simulating
physiological processes and their interaction with the environment.
Optimization methods complement those models to design ideotypes, i.e. ideal
values of a set of plant traits resulting in optimal adaptation for given
combinations of environment and management, mainly through the maximization of
a performance criteria (e.g. yield, light interception). As use of simulation
models gains momentum in plant breeding, numerical experiments must be
carefully engineered to provide accurate and attainable results, rooting them
in biological reality. Here, we propose a multi-objective optimization
formulation that includes a metric of performance, returned by the numerical
model, and a metric of feasibility, accounting for correlations between traits
based on field observations. We applied this approach to two contrasting
models: a process-based crop model of sunflower and a functional-structural
plant model of apple trees. In both cases, the method successfully
characterized key plant traits and identified a continuum of optimal solutions,
ranging from the most feasible to the most efficient. The present study thus
provides successful proof of concept for this enhanced modeling approach, which
identified paths for desirable trait modification, including direction and
intensity.Comment: 25 pages, 5 figures, 2017, Plant, Cell and Environmen
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
- …