7 research outputs found
Evolutionary algorithms with average crossover and power heuristics for aquaculture diet formulation
The aquaculture farming industry is one of the most important industries in Malaysia since it generates income to economic growth and produces main source of food for the nation. One of the pillars in aquaculture farming industries is formulation of food for the animal, which is also known as feed mix or diet formulation. However, the feed component in the aquaculture industry incurs the most expensive operational cost, and has drawn many studies regarding diet formulation. The lack of studies
involving modelling approaches had motivated to embark on diet formulation, which searches for the best combination of feed ingredients while satisfying nutritional requirements at a minimum cost. Hence, this thesis investigates a potential approach of Evolutionary Algorithm (EA) to propose a diet formulation solution for
aquaculture farming, specifically the shrimp. In order to obtain a good combination of ingredients in the feed, a filtering heuristics known as Power Heuristics was introduced in the initialization stage of the EA methodology. This methodology was capableof filtering certain unwanted ingredients which could lead to potential poor solutions. The success of the proposed EA also relies on a new selection and
crossover operators that have improved the overall performance of the solutions. Hence, three main EA model variants were constructed with new initialization mechanism, diverse selection and crossover operators, whereby the proposed EAPH-RWS-Avg Model emerged as the most effective in producing a good solution with the minimum penalty value. The newly proposed model is efficient and able to adapt to changes in the parameters, thus assists relevant users in managing the shrimp diet formulation issues, especially using local ingredients. Moreover, this diet formulation strategy provides user preference elements to choose from a range of
preferred ingredients and the preferred total ingredient weights
Directed Intervention Crossover Approaches in Genetic Algorithms with Application to Optimal Control Problems
Genetic Algorithms (GAs) are a search heuristic modeled on the
processes of evolution. They have been used to solve optimisation
problems in a wide variety of fields. When applied to the
optimisation of intervention schedules for optimal control problems,
such as cancer chemotherapy treatment scheduling, GAs have been
shown to require more fitness function evaluations than other search
heuristics to find fit solutions. This thesis presents extensions to
the GA crossover process, termed directed intervention crossover
techniques, that greatly reduce the number of fitness function
evaluations required to find fit solutions, thus increasing the
effectiveness of GAs for problems of this type.
The directed intervention crossover techniques use intervention
scheduling information from parent solutions to direct the offspring
produced in the GA crossover process towards more promising areas of
a search space. By counting the number of interventions present in
parents and adjusting the number of interventions for offspring
schedules around it, this allows for highly fit solutions to be
found in less fitness function evaluations.
The validity of these novel approaches are illustrated through
comparison with conventional GA crossover approaches for
optimisation of intervention schedules of bio-control application in
mushroom farming and cancer chemotherapy treatment. These involve
optimally scheduling the application of a bio-control agent to
combat pests in mushroom farming and optimising the timing and
dosage strength of cancer chemotherapy treatments to maximise their
effectiveness.
This work demonstrates that significant advantages are gained in
terms of both fitness function evaluations required and fitness
scores found using the proposed approaches when compared with
traditional GA crossover approaches for the production of optimal
control schedules
Directed intervention crossover approaches in genetic algorithms with application to optimal control problems
Genetic Algorithms (GAs) are a search heuristic modeled on the processes of evolution. They have been used to solve optimisation problems in a wide variety of fields. When applied to the optimisation of intervention schedules for optimal control problems, such as cancer chemotherapy treatment scheduling, GAs have been shown to require more fitness function evaluations than other search heuristics to find fit solutions. This thesis presents extensions to the GA crossover process, termed directed intervention crossover techniques, that greatly reduce the number of fitness function evaluations required to find fit solutions, thus increasing the effectiveness of GAs for problems of this type. The directed intervention crossover techniques use intervention scheduling information from parent solutions to direct the offspring produced in the GA crossover process towards more promising areas of a search space. By counting the number of interventions present in parents and adjusting the number of interventions for offspring schedules around it, this allows for highly fit solutions to be found in less fitness function evaluations. The validity of these novel approaches are illustrated through comparison with conventional GA crossover approaches for optimisation of intervention schedules of bio-control application in mushroom farming and cancer chemotherapy treatment. These involve optimally scheduling the application of a bio-control agent to combat pests in mushroom farming and optimising the timing and dosage strength of cancer chemotherapy treatments to maximise their effectiveness. This work demonstrates that significant advantages are gained in terms of both fitness function evaluations required and fitness scores found using the proposed approaches when compared with traditional GA crossover approaches for the production of optimal control schedules.EThOS - Electronic Theses Online ServiceGBUnited Kingdo
Problem Decomposition and Adaptation in Cooperative Neuro-Evolution
One way to train neural networks is to use evolutionary algorithms
such as cooperative coevolution - a method that decomposes the network's
learnable parameters into subsets, called subcomponents. Cooperative
coevolution gains advantage over other methods by evolving particular
subcomponents independently from the rest of the network. Its success
depends strongly on how the problem decomposition is carried out.
This thesis suggests new forms of problem decomposition, based on a
novel and intuitive choice of modularity, and examines in detail at what
stage and to what extent the different decomposition methods should be
used. The new methods are evaluated by training feedforward networks
to solve pattern classification tasks, and by training recurrent networks to
solve grammatical inference problems.
Efficient problem decomposition methods group interacting variables
into the same subcomponents. We examine the methods from the literature and provide an analysis of the nature of the neural network optimization problem in terms of interacting variables. We then present a
novel problem decomposition method that groups interacting variables
and that can be generalized to neural networks with more than a single
hidden layer.
We then incorporate local search into cooperative neuro-evolution. We
present a memetic cooperative coevolution method that takes into account
the cost of employing local search across several sub-populations.
The optimisation process changes during evolution in terms of diversity and interacting variables. To address this, we examine the adaptation
of the problem decomposition method during the evolutionary process. The results in this thesis show that the proposed methods improve performance
in terms of optimization time, scalability and robustness.
As a further test, we apply the problem decomposition and adaptive
cooperative coevolution methods for training recurrent neural networks
on chaotic time series problems. The proposed methods show better performance
in terms of accuracy and robustness
Probabilistic modelling of oil rig drilling operations for business decision support: a real world application of Bayesian networks and computational intelligence.
This work investigates the use of evolved Bayesian networks learning algorithms based on computational intelligence meta-heuristic algorithms. These algorithms are applied to a new domain provided by the exclusive data, available to this project from an industry partnership with ODS-Petrodata, a business intelligence company in Aberdeen, Scotland. This research proposes statistical models that serve as a foundation for building a novel operational tool for forecasting the performance of rig drilling operations. A prototype for a tool able to forecast the future performance of a drilling operation is created using the obtained data, the statistical model and the experts' domain knowledge. This work makes the following contributions: applying K2GA and Bayesian networks to a real-world industry problem; developing a well-performing and adaptive solution to forecast oil drilling rig performance; using the knowledge of industry experts to guide the creation of competitive models; creating models able to forecast oil drilling rig performance consistently with nearly 80% forecast accuracy, using either logistic regression or Bayesian network learning using genetic algorithms; introducing the node juxtaposition analysis graph, which allows the visualisation of the frequency of nodes links appearing in a set of orderings, thereby providing new insights when analysing node ordering landscapes; exploring the correlation factors between model score and model predictive accuracy, and showing that the model score does not correlate with the predictive accuracy of the model; exploring a method for feature selection using multiple algorithms and drastically reducing the modelling time by multiple factors; proposing new fixed structure Bayesian network learning algorithms for node ordering search-space exploration. Finally, this work proposes real-world applications for the models based on current industry needs, such as recommender systems, an oil drilling rig selection tool, a user-ready rig performance forecasting software and rig scheduling tools
Pattern Recognition
A wealth of advanced pattern recognition algorithms are emerging from the interdiscipline between technologies of effective visual features and the human-brain cognition process. Effective visual features are made possible through the rapid developments in appropriate sensor equipments, novel filter designs, and viable information processing architectures. While the understanding of human-brain cognition process broadens the way in which the computer can perform pattern recognition tasks. The present book is intended to collect representative researches around the globe focusing on low-level vision, filter design, features and image descriptors, data mining and analysis, and biologically inspired algorithms. The 27 chapters coved in this book disclose recent advances and new ideas in promoting the techniques, technology and applications of pattern recognition