2 research outputs found
Personalized Health Monitoring Using Evolvable Block-based Neural Networks
This dissertation presents personalized health monitoring using evolvable block-based neural networks. Personalized health monitoring plays an increasingly important role in modern society as the population enjoys longer life. Personalization in health monitoring considers physiological variations brought by temporal, personal or environmental differences, and demands solutions capable to reconfigure and adapt to specific requirements. Block-based neural networks (BbNNs) consist of 2-D arrays of modular basic blocks that can be easily implemented using reconfigurable digital hardware such as field programmable gate arrays (FPGAs) that allow on-line partial reorganization. The modular structure of BbNNs enables easy expansion in size by adding more blocks. A computationally efficient evolutionary algorithm is developed that simultaneously optimizes structure and weights of BbNNs. This evolutionary algorithm increases optimization speed by integrating a local search operator. An adaptive rate update scheme removing manual tuning of operator rates enhances the fitness trend compared to pre-determined fixed rates. A fitness scaling with generalized disruptive pressure reduces the possibility of premature convergence. The BbNN platform promises an evolvable solution that changes structures and parameters for personalized health monitoring. A BbNN evolved with the proposed evolutionary algorithm using the Hermite transform coefficients and a time interval between two neighboring R peaks of ECG signal, provides a patient-specific ECG heartbeat classification system. Experimental results using the MIT-BIH Arrhythmia database demonstrate a potential for significant performance enhancements over other major techniques
New local search in the space of infeasible solutions framework for the routing of vehicles
Combinatorial optimisation problems (COPs) have been at the origin of the design of
many optimal and heuristic solution frameworks such as branch-and-bound
algorithms, branch-and-cut algorithms, classical local search methods, metaheuristics,
and hyperheuristics.
This thesis proposes a refined generic and parametrised infeasible local search
(GPILS) algorithm for solving COPs and customises it to solve the traveling salesman
problem (TSP), for illustration purposes. In addition, a rule-based heuristic is proposed
to initialise infeasible local search, referred to as the parameterised infeasible heuristic
(PIH), which allows the analyst to have some control over the features of the infeasible
solution he/she might want to start the infeasible search with. A recursive infeasible
neighbourhood search (RINS) as well as a generic patching procedure to search the
infeasible space are also proposed. These procedures are designed in a generic manner,
so they can be adapted to any choice of parameters of the GPILS, where the set of
parameters, in fact for simplicity, refers to set of parameters, components, criteria and
rules.
Furthermore, a hyperheuristic framework is proposed for optimizing the parameters of
GPILS referred to as HH-GPILS. Experiments have been run for both sequential (i.e.
simulated annealing, variable neighbourhood search, and tabu search) and parallel
hyperheuristics (i.e., genetic algorithms / GAs) to empirically assess the performance
of the proposed HH-GPILS in solving TSP using instances from the TSPLIB.
Empirical results suggest that HH-GPILS delivers an outstanding performance.
Finally, an offline learning mechanism is proposed as a seeding technique to improve
the performance and speed of the proposed parallel HH-GPILS. The proposed offline
learning mechanism makes use of a knowledge-base to keep track of the best
performing chromosomes and their scores. Empirical results suggest that this learning
mechanism is a promising technique to initialise the GA’s population