3,618 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
Recommended from our members
Local search: A guide for the information retrieval practitioner
There are a number of combinatorial optimisation problems in information retrieval in which the use of local search methods are worthwhile. The purpose of this paper is to show how local search can be used to solve some well known tasks in information retrieval (IR), how previous research in the field is piecemeal, bereft of a structure and methodologically flawed, and to suggest more rigorous ways of applying local search methods to solve IR problems. We provide a query based taxonomy for analysing the use of local search in IR tasks and an overview of issues such as fitness functions, statistical significance and test collections when conducting experiments on combinatorial optimisation problems. The paper gives a guide on the pitfalls and problems for IR practitioners who wish to use local search to solve their research issues, and gives practical advice on the use of such methods. The query based taxonomy is a novel structure which can be used by the IR practitioner in order to examine the use of local search in IR
An automatic methodology for estimating eddy diffusivities from experimental data
A technique for estimating eddy diffusivities in a turbulent
atmospheric layer is presented; the scheme adopted is based on an inverse-problem methodology. The inverse problem is formulated as a nonlinear constrained optimization problem, where the objective function is defined through the square
differences between experimental and model data. The direct mathematical model is given by the advection-diffusion equation, which is solved by second-order finite-difference method. In the presence of noise it is necessary to use some
regularization term; the Tikhonov function and an entropic regularization of zeroth, first and second orders are used in this paper. In addition, two inversion strategies are used: alternate and simultaneous eddy diffusivities estimation. Numerical experiments show a good performance of the proposed methodology
A Cognitive Science Based Machine Learning Architecture
In an attempt to illustrate the application of cognitive science principles to hard AI problems in machine learning we propose the LIDA technology, a cognitive science based architecture capable of more human-like learning. A LIDA based software agent or cognitive robot will be capable of three fundamental, continuously active, humanlike learning mechanisms:\ud
1) perceptual learning, the learning of new objects, categories, relations, etc.,\ud
2) episodic learning of events, the what, where, and when,\ud
3) procedural learning, the learning of new actions and action sequences with which to accomplish new tasks. The paper argues for the use of modular components, each specializing in implementing individual facets of human and animal cognition, as a viable approach towards achieving general intelligence
A New Initialisation Method for Examination Timetabling Heuristics
This is the author accepted manuscript. The final version is available from IEEE via the DOI in this record.Timetabling problems are widespread, but are particularly prevalent in the educational domain. When sufficiently large, these are often only effectively tackled by timetabling meta-heuristics. The effectiveness of these in turn are often largely dependant on their initialisation protocols. There are a number of different initialisation approaches used in the literature for starting examination timetabling heuristics. We present a new iterative initialisation algorithm here --- which attempts to generate high-quality and legal solutions, to feed into a heuristic optimiser. The proposed approach is empirically verified on the ITC 2007 and Yeditepe benchmark sets. It is compared to popular initialisation approaches commonly employed in exam timetabling heuristics: the largest degree, largest weighted degree, largest enrollment, and saturation degree graph-colouring approaches, and random schedule allocation. The effectiveness of these approaches are also compared via incorporation in an exemplar evolutionary algorithm. The results show that the proposed method is capable of producing feasible solutions for all instances, with better quality and diversity compared to the alternative methods. It also leads to improved optimiser performance.Saudi Arabia Cultural Burea
Hybridizing Cartesian Genetic Programming and Harmony Search for Adaptive Feature Construction in Supervised Learning Problems
The advent of the so-called Big Data paradigm has motivated a flurry of research aimed at enhancing machine learning models by following very di- verse approaches. In this context this work focuses on the automatic con- struction of features in supervised learning problems, which differs from the conventional selection of features in that new characteristics with enhanced predictive power are inferred from the original dataset. In particular this manuscript proposes a new iterative feature construction approach based on a self-learning meta-heuristic algorithm (Harmony Search) and a solution encoding strategy (correspondingly, Cartesian Genetic Programming) suited to represent combinations of features by means of constant-length solution vectors. The proposed feature construction algorithm, coined as Adaptive Cartesian Harmony Search (ACHS), incorporates modifications that allow exploiting the estimated predictive importance of intermediate solutions and, ultimately, attaining better convergence rate in its iterative learning proce- dure. The performance of the proposed ACHS scheme is assessed and com- pared to that rendered by the state of the art in a toy example and three practical use cases from the literature. The excellent performance figures obtained in these problems shed light on the widespread applicability of the proposed scheme to supervised learning with legacy datasets composed by already refined characteristics
- ā¦