Review of Metaheuristics and Generalized Evolutionary Walk Algorithm

Metaheuristic algorithms are often nature-inspired, and they are becoming very powerful in solving global optimization problems. More than a dozen of major metaheuristic algorithms have been developed over the last three decades, and there exist even more variants and hybrid of metaheuristics. This paper intends to provide an overview of nature-inspired metaheuristic algorithms, from a brief history to their applications. We try to analyze the main components of these algorithms and how and why they works. Then, we intend to provide a unified view of metaheuristics by proposing a generalized evolutionary walk algorithm (GEWA). Finally, we discuss some of the important open questions.Comment: 14 page

CONA: A novel CONtext-Aware instruction paradigm for communication using large language model

We introduce CONA, a novel context-aware instruction paradigm for effective knowledge dissemination using generative pre-trained transformer (GPT) models. CONA is a flexible framework designed to leverage the capabilities of Large Language Models (LLMs) and incorporate DIKW (Data, Information, Knowledge, Wisdom) hierarchy to automatically instruct and optimise presentation content, anticipate potential audience inquiries, and provide context-aware answers that adaptive to the knowledge level of the audience group. The unique aspect of the CONA paradigm lies in its combination of an independent advisory mechanism and a recursive feedback loop rooted on the DIKW hierarchy. This synergy significantly enhances context-aware contents, ensuring they are accessible and easily comprehended by the audience. This paradigm is an early pioneer to explore new methods for knowledge dissemination and communication in the LLM era, offering effective support for everyday knowledge sharing scenarios. We conduct experiments on a range of audience roles, along with materials from various disciplines using GPT4. Both quantitative and qualitative results demonstrated that the proposed CONA paradigm achieved remarkable performance compared to the outputs guided by conventional prompt engineering

Artificial immune systems

The human immune system has numerous properties that make it ripe for exploitation in the computational domain, such as robustness and fault tolerance, and many different algorithms, collectively termed Artificial Immune Systems (AIS), have been inspired by it. Two generations of AIS are currently in use, with the first generation relying on simplified immune models and the second generation utilising interdisciplinary collaboration to develop a deeper understanding of the immune system and hence produce more complex models. Both generations of algorithms have been successfully applied to a variety of problems, including anomaly detection, pattern recognition, optimisation and robotics. In this chapter an overview of AIS is presented, its evolution is discussed, and it is shown that the diversification of the field is linked to the diversity of the immune system itself, leading to a number of algorithms as opposed to one archetypal system. Two case studies are also presented to help provide insight into the mechanisms of AIS; these are the idiotypic network approach and the Dendritic Cell Algorithm

Immunity-Based Accommodation of Aircraft Subsystem Failures

This thesis presents the design, development, and flight-simulation testing of an artificial immune system (AIS) based approach for accommodation of different aircraft subsystem failures.;Failure accommodation is considered as part of a complex integrated AIS scheme that contains four major components: failure detection, identification, evaluation, and accommodation. The accommodation part consists of providing compensatory commands to the aircraft under specific abnormal conditions based on previous experience. In this research effort, the possibility of building an AIS allowing the extraction of pilot commands is investigated.;The proposed approach is based on structuring the self (nominal conditions) and the non-self (abnormal conditions) within the AIS paradigm, as sets of artificial memory cells (mimicking behavior of T-cells, B-cells, and antibodies) consisting of measurement strings, over pre-defined time windows. Each string is a set of features values at each sample time of the flight including pilot inputs, system states, and other variables. The accommodation algorithm relies on identifying the memory cell that is the most similar to the in-coming measurements. Once the best match is found, control commands corresponding to this match will be extracted from the memory and used for control purposes.;The proposed methodology is illustrated through simulation of simple maneuvers at nominal flight conditions, different actuators, and sensor failure conditions. Data for development and demonstration have been collected from West Virginia University 6-degrees-of-freedom motion-based flight simulator. The aircraft model used for this research represents a supersonic fighter which includes model following adaptive control laws based on non-linear dynamic inversion and artificial neural network augmentation.;The simulation results demonstrate the possibility of extracting pilot compensatory commands from the self/non-self structure and the capability of the AIS paradigm to address the problem of accommodating actuator and sensor malfunctions as a part of a comprehensive and integrated framework along with abnormal condition detection, identification, and evaluation

Artificial immune system for static and dynamic production scheduling problems

Over many decades, a large number of complex optimization problems have brought researchers' attention to consider in-depth research on optimization. Production scheduling problem is one of the optimization problems that has been the focus of researchers since the 60s. The main problem in production scheduling is to allocate the machines to perform the tasks. Job Shop Scheduling Problem (JSSP) and Flexible Job Shop Scheduling Problem (FJSSP) are two of the areas in production scheduling problems for these machines. One of the main objectives in solving JSSP and FJSSP is to obtain the best solution with minimum total completion processing time. Thus, this thesis developed algorithms for single and hybrid methods to solve JSSP and FJSSP in static and dynamic environments. In a static environment, no change is needed for the produced solution but changes to the solution are needed. On the other hand, in a dynamic environment, there are many real time events such as random arrival of jobs or machine breakdown requiring solutions. To solve these problems for static and dynamic environments, the single and hybrid methods were introduced. Single method utilizes Artificial Immune System (AIS), whereas AIS and Variable Neighbourhood Descent (VND) are used in the hybrid method. Clonal Selection Principle (CSP) algorithm in the AIS was used in the proposed single and hybrid methods. In addition, to evaluate the significance of the proposed methods, experiments and One-Way ANOVA tests were conducted. The findings showed that the hybrid method was proven to give better performance compared to single method in producing optimized solution and reduced solution generating time. The main contribution of this thesis is the development of an algorithm used in the single and hybrid methods to solve JSSP and FJSSP in static and dynamic environment

Aisimam - An Artificial immune system based intelligent multiangent model

The goal of this thesis is to develop a biological model for multiagent systems. This thesis explores artificial immune systems, a novel evolutionary paradigm based on the immunological principles. Artificial Immune systems (AIS) are found to be powerful to solve complex computational tasks. The main focus of the thesis is to develop a generic mathematical model that uses the principles of the human immune system in multiagent systems (MAS). The components and properties of the human immune system are studied. On understanding the concepts of A/5, a literature survey of multiagent systems is performed to understand and compare the multiagent concepts and AIS concepts. An analogy between the immune system parameters and the agent theory was derived. Then, an intelligent multiagent model named AISIMAM is derived. It exploits several properties and features of the immune system in multiagent systems. In other words, the intelligence of the immune systems to kill the antigen and the characteristics of the agents are combined in the model. The model is expressed in terms of mathematical expressions. The model is applied to a specific application namely the mine detection and defusion. The simulations are done in MATLAB that runs on a PC. The experimental results of AISIMAM applied to the mine detection problem are discussed. The results are successful and shows that AISIMAM could be an alternative solution to agent based problems. Artificial Immune System is also applied to a pattern recognition problem. The problem experimented is a color image classification problem useful in a real time industrial application. The images are those of wooden components that need to be classified according to the color and type of wood. To solve the classification task, a simple negative selection and genetic algorithm based A/5 algorithm was developed and simulated. The results are compared with the radial basis function approach applied to the same set of input images

Exploiting immunological metaphors in the development of serial, parallel and distributed learning algorithms

This thesis examines the use of immunological metaphors in building serial, parallel, and distributed learning algorithms. It offers a basic study in the development of biologically-inspired algorithms which merge inspiration from biology with known, standard computing technology to examine robust methods of computing. This thesis begins by detailing key interactions found within the immune system that provide inspiration for the development of a learning system. It then exploits the use of more processing power for the development of faster algorithms. This leads to the exploration of distributed computing resources for the examination of more biologically plausible systems. This thesis offers the following main contributions. The components of the immune system that exhibit the capacity for learning are detailed. A framework for discussing learning algorithms is proposed. Three properties of every learning algorithm-memory, adaptation, and decision-making-are identified for this framework, and traditional learning algorithms are placed in the context of this framework. An investigation into the use of immunological components for learning is provided. This leads to an understanding of these components in terms of the learning framework. A simplification of the Artificial Immune Recognition System (AIRS) immune-inspired learning algorithm is provided by employing affinity-dependent somatic hypermutation. A parallel version of the Clonal Selection Algorithm (CLONALG) immune learning algorithm is developed. It is shown that basic parallel computing techniques can provide computational benefits for this algorithm. Exploring this technology further, a parallel version of AIRS is offered. It is shown that applying these same parallel computing techniques to AIRS, while less scalable than when applied to CLONALG, still provides computational gains. A distributed approach to AIRS is offered, and it is argued that this approach provides a more biologically appealing model. The simple distributed approach is proposed in terms of an initial step toward a more complex, distributed system. Biological immune systems exhibit complex cellular interactions. The mechanisms of these interactions, while often poorly understood, hint at an extremely powerful information processing/problem solving system. This thesis demonstrates how the use of immunological principles coupled with standard computing technology can lead to the development of robust, biologically inspired learning algorithms.EThOS - Electronic Theses Online ServiceGBUnited Kingdo