Genetic Algorithm Process Research Articles

Trajectory tracking control based on genetic algorithm and proportional integral derivative controller for two-wheel mobile robot

This paper uses the genetic algorithm (GA) to optimize the proportional integral derivative (PID) controller parameters to present the motion control design for a two-wheeled mobile robot autonomous system. The GA algorithm determines a collision-free travel curve for a robot with a tangential velocity restriction constraint. A trajectory-tracking controller based on the PID control structure is developed to monitor the calculated route curves for the mobile robot. Simulation results show the effectiveness of the GA-PID controller compared to the PID controller. The GA-PID controller demonstrates improved performance in trajectory tracking and collision avoidance, making it suitable for controlling the motion of two-wheeled mobile robots. The GA's optimization process allows for better tuning of the PID controller parameters, resulting in more efficient and accurate robot motion control. The results suggest that the proposed GA-PID controller is a promising approach for enhancing mobile robots' autonomous navigation capabilities.

Deep learning and genetic algorithm-based ensemble model for feature selection and classification of breast ultrasound images

Feature extraction and selection are important techniques in the classification of medical images. Extraction of key features and selection of relevant features are the preliminary processes that are essential for identifying the shape of an object or diagnosis of a tumor in images. In this study, we conduct a thorough comparison of deep neural networks' performance. The comparison of the networks infers MobileNet as optimal for feature extraction from medical images, where it has minimal parameters and high validation accuracy. For feature selection, we employ the Genetic Algorithm (GA) because of its proficiency in handling high-dimensional and complex feature space. GA's iterative process aligns well with the unique characteristics of breast ultrasound (BUS) images, which enhances its efficacy in selecting salient features of BUS images. An ensemble model, capitalizing on the collective decision-making capabilities of multiple classifiers based on a weighted voting scheme for classification, is proposed. Empirical evaluations are conducted using two publicly available BUS image datasets, BUSI and UDIAT. The proposed model demonstrates a notable improvement of approximately 4% and 9% in accuracy for the BUSI and UDIAT, respectively. The improved diagnostic accuracy in breast abnormality identification allows for early abnormality diagnosis. This improves treatment outcomes for breast cancer patients and highlights the practical value of the proposed method for improving BUS image categorization.

CSOCA: Chicken Swarm Optimization Based Clustering Algorithm for Wireless Sensor Networks

The rapid advancement in Wireless Sensor Network (WSN) technology has enabled smart environments to provide ubiquitous real-time applications in various fields such as industry, smart city, transport, health and Internet of Things (IoT). Energy is the most significant resource in WSNs as it has a direct effect on their lifetime. The efficient use of energy is required for the lifetime extension of WSNs. One of the well-known methods for achieving high scalability and efficient resource allocation in WSN is a clustering of sensor nodes. In this paper, the Chicken Swarm Optimization based Clustering Algorithm (CSOCA) is proposed to improve energy efficiency in WSNs. The chicken swarm optimization is discretized by applying a sigmoid function to individuals. Moreover, we proposed CSOCA with Genetic Algorithm (CSOCA-GA) which is an improvement to CSOCA by employing the Genetic Algorithm's processes in CSOCA. CSOCA-GA utilizes crossover and mutation processes for individuals with low fitness value to extend the population diversity. CSOCA and CSOCA-GA are tested and compared with other similar algorithms to confirm their effectiveness in terms of extending WSN lifetime and reducing energy consumption.

FPGA Implementation of Crossover Module of Genetic Algorithm

This paper proposes a hardware realization of the crossover module in the genetic algorithm for the travelling salesman problem (TSP). In order to enhance performance, we employ a combination of pipelining and parallelization with a genetic algorithm (GA) processor to improve processing speed, as compared to software implementation. Simulation results showed that the proposed architecture is six times faster than the similar existing architecture. The presented field-programmable gate array (FPGA) implementation of PMX crossover operator is more than 400 times faster than in software.

A Fast On-Chip Adaptive Genetic Algorithm Processor for Evolutionary FIR Filter Implementation Using Hardware–Software Co-Design

Recent studies show the impact of genetic algorithms (GA) in the design of evolutionary finite impulse response (FIR) filters. Studies have shown hardware and software method of GA implementation for design. Hardware method improves speed due to parallelism, pipelining and the absence of the function calls compared to software implementation. But area constraint was the main issue of hardware implementation. Therefore, this paper illustrates a hardware–software co-design concept to implement an Adaptive GA processor (AGAP) for FIR filter design. The architecture of AGAP uses adaptive crossover and mutation probabilities to speed up the convergence of the GA process. The AGAP architecture was implemented using Verilog Hardware Description Language (HDL) and instantiated as a custom intellectual property (IP) core to the soft-core MicroBlaze processor of Spartan 6 (XC6SLX45-3CSG324I) FPGA. The MicroBlaze processor controls the AGAP IP core and other interfaces using Embedded C programs. The experiment demonstrated a significant 134% improvement in speed over hardware implementation but with a marginal increase in area. The complete evaluation and evolution of the filter coefficients were executed on a single FPGA. The system on chip (SoC) concept enables a robust and flexible system.

High-Speed General Purpose Genetic Algorithm Processor.

In this paper, an ultrafast steady-state genetic algorithm processor (GAP) is presented. Due to the heavy computational load of genetic algorithms (GAs), they usually take a long time to find optimum solutions. Hardware implementation is a significant approach to overcome the problem by speeding up the GAs procedure. Hence, we designed a digital CMOS implementation of GA in [Formula: see text] process. The proposed processor is not bounded to a specific application. Indeed, it is a general-purpose processor, which is capable of performing optimization in any possible application. Utilizing speed-boosting techniques, such as pipeline scheme, parallel coarse-grained processing, parallel fitness computation, parallel selection of parents, dual-population scheme, and support for pipelined fitness computation, the proposed processor significantly reduces the processing time. Furthermore, by relying on a built-in discard operator the proposed hardware may be used in constrained problems that are very common in control applications. In the proposed design, a large search space is achievable through the bit string length extension of individuals in the genetic population by connecting the 32-bit GAPs. In addition, the proposed processor supports parallel processing, in which the GAs procedure can be run on several connected processors simultaneously.

Optimum Design for CLD Laminate Plates Using Genetic Algorithms

The optimizations of constrained layered damped (CLD) laminated structures are discussed in this study. Genetic algorithms (GAs) are employed as the search tool for optimization because these algorithms are suitable for solving optimization problems involving multiple discrete variable combinations. The numerical computation packages, ANSYS and MATLAB, have been used to estimate the optimum stacking sequence of CLD laminated structures. MATLAB package is used to achieve GAs process, and ANSYS package is used to proceed the structural analysis. This study successfully developed a numerical simulation mechanism for optimizing CLD adhesion efficiency by implementing GAs and the finite element method. The loss coefficients of the CLD damping layer vary with vibration frequency and failure constraints of CLD laminated plates are considered in objective function. In addition, the modified plasticity analysis (MPA) is used to increase the search efficiency of GAs and simply plastic analysis.

Improved mutation method for providing high genetic diversity of genetic algorithm processor

Improved mutation method for providing high genetic diversity of genetic algorithm processor

A Processor for Genetic Algorithm based on Redundant Binary Number

A Design and Simulation for DynamicThis paper describes a design of novel processor for genetic algorithm (GA) based on redundant binary number. In conventional GA, genetic information is expressed by binary number. On the other hand, the proposed processor is based on redundant binary number. Therefore, the number of expression of optimized solutions for the target function increase. For this reason, it is easy to find the optimized solution, and error rates decrease. The processor was designed by using VHDL and simulated. The effectiveness of the proposed processor was confirmed by logic circuit simulations.

Genetic algorithm with dynamic variable number of individuals and accuracy

This paper proposes a novel processor for genetic algorithm (GA) that can dynamically change number of individuals and accuracy. In conventional GA, number of population and accuracy are fixed. However, the accuracy of solution is low at first-half stage. Therefore, the number of population is doubled at expense of the accuracy of solution, and the searching ability is improved at first-stage in the proposed GA processor. Then, the number of population is reduced by half, and the accuracy is improved at second-half stage. As a result, the searching ability is improved. The proposed GA processor was designed and verified. The effectiveness of proposed method was confirmed by applying to the knapsack problem.

Migration Effects of Parallel Genetic Algorithms on Line Topologies of Heterogeneous Computing Resources

This paper investigates migration effects of parallel genetic algorithms (GAs) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is evaluated experimentally on two types of arrangements of heterogeneous computing resources: the ascending and descending order arrangements. Migration effects are evaluated from the viewpoints of scalability, chromosome diversity, migration frequency and solution quality. The results reveal that the performance of parallel GAs strongly depends on the design of the chromosome migration in which we need to consider the arrangement of heterogeneous computing resources, the migration frequency and so on. The results contribute to provide referential scheme of implementation of parallel GAs on heterogeneous computing resources.

A new acceleration technique for the design of fibre gratings

In this paper we propose a novel acceleration technique for the design of fibre gratings based on Genetic Algorithm (GA). It is shown that with an appropriate reformulation of the wavelength sampling scheme it is possible to design high quality optical filters with low computational effort. Our results will show that the proposed technique can reduce significantly the GA's processing time.

Design of Evolvable Hardware based on Genetic Algorithm Processor(GAP)

In this paper, we propose a new design method of Genetic Algorithm Processor(GAP) and Evolvable Hardware(EHW). All sorts of creature evolve its structure or shape in order to adapt itself to environments. Evolutionary Computation based on the process of natural selection not only searches the quasi-optimal solution through the evolution process, but also changes the structure to get best results. On the other hand, Genetic Algorithm(GA) is good for finding solutions of complex optimization problems. However, it has a major drawback, which is its slow execution speed when is implemented in software of a conventional computer. Parallel processing has been one approach to overcome the speed problem of GA. In a point of view of GA, long bit string length caused the system of GA to spend much time that clear up the problem. Evolvable Hardware refers to the automation of electronic circuit design through artificial evolution, and is currently increased with the interested topic in a research domain and an engineering methodology. The studies of EHW generally use the XC6200 of Xilinx. The structure of XC6200 can configure with gate unit. Each unit has connected up, down, right and left cell. But the products can't use because had sterilized. So this paper uses Vertex-E (XCV2000E). The cell of FPGA is made up of Configuration Logic Block (CLB) and can't reconfigure with gate unit. This paper uses Vertex-E is composed of the component as cell of XC6200 cell in VertexE

Distribution algorithms for document allocation in multiprocessor information retrieval systems

Distributed memory information retrieval systems have been used as a means of managing the vast volume of documents in an information retrieval system, and to improve query response time. However, proper allocation of documents plays an important role in improving the performance of such systems. Maximising the amount of parallelism can be achieved by distributing the documents, while the inter-node communication cost is minimised by avoiding documents distribution. Unfortunately, these two factors contradict each other. Finding an optimal allocation satisfying the above objectives is referred to as distributed memory document allocation problem (DDAP), and it is an NP-Complete problem. Heuristic algorithms are usually employed to find an optimal solution to this problem. Genetic algorithm is one such algorithms. In this paper, a genetic algorithm is developed to find an optimal document allocation for DDAP. Several well-known network topologies are investigated to evaluate the performance of the algorithm. The approach relies on the fact that documents of an information retrieval system are clustered by some arbitrary method. The advantages of a clustered document approach specially in a distributed memory information retrieval system are well-known. Since genetic algorithms work with a set of candidate solutions, parallelisation based on a Single Instruction Multiple Data (SIMD) paradigm seems to be the natural way to obtain a speedup. Using this approach, the population of strings is distributed among the processing elements. Each string is processed independently. The performance gain comes from the parallel execution of the strings, and hence, it is heavily dependent on the population size. The approach is favoured for genetic algorithms' applications where the parameter set for a particular run is well-known in advance, and where such applications require a big population size to solve the problem. DDAP fits nicely into the above requirements. The aim of the parallelisation is two-fold: the first one is to speedup the allocation process in DDAP which usually consists of thousands of documents and has to use a big population size, and second, it can be seen as an attempt to port the genetic algorithm's processes into SIMD machines.