In this paper, the analysis of recent advances in genetic algorithms is discussed. The genetic algorithms of great interest in research community are selected for analysis. This review will help the new and demanding researchers to provide the wider vision of genetic algorithms. The well-known algorithms and their implementation are presented with their pros and cons. The genetic operators and their usages are discussed with the aim of facilitating new researchers. The different research domains involved in genetic algorithms are covered. The future research directions in the area of genetic operators, fitness function and hybrid algorithms are discussed. This structured review will be helpful for research and graduate teaching.

/pdf/a-review-on-genetic-algorithm-past-present-and-future-2o5y8ru178.pdf

A review on genetic algorithm: past, present, and future

Mobile ad hoc network (MANET) is a cluster of wireless mobile gadgets that creates a temporary network without seeking support from any infrastructure or central management. Energy consumption should be considered as one of the foremost vital limitations in MANETs because the mobile nodes do not possess a constant power supply and its shortage will minimize the network’s lifetime. MANETs get energy from the batteries which get exhausted very quickly because of issues like node mobility, computation power, frequent data retransmissions needed in wireless communication, etc. Secondly, there is a data packet loss caused by different reasons such as traffic congestion or random loss as a result of nodes mobility or noise. This data loss, in turn, would delay packets delivery degrading data transmission in real-time applications. This paper provides management for this combination of major problems in MANETs. We present a new fitness function (FFn) used in the Genetic Algorithm (GA) to obtain the optimized route from those routes offered by the Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol. Accordingly, we propose a routing protocol titled as AOMDV with FFn (AOMDV-FFn). We also integrate the AOMDV mechanism with the genetic algorithm (AOMDV-GA). These protocols provide an optimization process to select the efficient routes that have the highest fitness values implementing the shortest route, maximum residual energy, and less data traffic even if a random loss of data packets happens. In this regard, we introduce a mechanism where the TCP Congestion Control Enhancement for Random Loss (TCP CERL) can be utilized in the FFn to optimize the efficient route. The performance of the proposed mechanisms is compared with other preferred protocols proposed in this area.

/pdf/multipath-routing-protocol-using-genetic-algorithm-in-mobile-13newy7s7d.pdf

Multipath Routing Protocol Using Genetic Algorithm in Mobile Ad Hoc Networks

Black hole attack detection in vehicular ad-hoc network using secure AODV routing algorithm

A geomechanical approach to casing collapse prediction in oil and gas wells aided by machine learning

Modern day computing increasingly relies on specialization to satiate growing performance and efficiency requirements. A core challenge in designing such specialized hardware architectures is how to perform mapping space search, i.e., search for an optimal mapping from algorithm to hardware. Prior work shows that choosing an inefficient mapping can lead to multiplicative-factor efficiency overheads. Additionally, the search space is not only large but also non-convex and non-smooth, precluding advanced search techniques. As a result, previous works are forced to implement mapping space search using expert choices or sub-optimal search heuristics. This work proposes Mind Mappings, a novel gradient-based search method for algorithm-accelerator mapping space search. The key idea is to derive a smooth, differentiable approximation to the otherwise non-smooth, non-convex search space. With a smooth, differentiable approximation, we can leverage efficient gradient-based search algorithms to find high-quality mappings. We extensively compare Mind Mappings to black-box optimization schemes used in prior work. When tasked to find mappings for two important workloads (CNN and MTTKRP), Mind Mapping finds mappings that achieve an average 1.40×, 1.76×, and 1.29× (when run for a fixed number of steps) and 3.16×, 4.19×, and 2.90× (when run for a fixed amount of time) better energy-delay product (EDP) relative to Simulated Annealing, Genetic Algorithms and Reinforcement Learning, respectively. Meanwhile, Mind Mappings returns mappings with only 5.32× higher EDP than a possibly unachievable theoretical lower-bound, indicating proximity to the global optima.

Mind mappings: enabling efficient algorithm-accelerator mapping space search

Genetic algorithm (GA) is an artificial intelligence search method that uses the process of evolution and natural selection theory and is under the umbrella of evolutionary computing algorithm. It is an efficient tool for solving optimization problems. Integration among (GA) parameters is vital for successful (GA) search. Such parameters include mutation and crossover rates in addition to population that are important issues in (GA). However, each operator of GA has a special and different influence. The impact of these factors is influenced by their probabilities; it is difficult to predefine specific ratios for each parameter, particularly, mutation and crossover operators. This paper reviews various methods for choosing mutation and crossover ratios in GAs. Next, we define new deterministic control approaches for crossover and mutation rates, namely Dynamic Decreasing of high mutation ratio/dynamic increasing of low crossover ratio (DHM/ILC), and Dynamic Increasing of Low Mutation/Dynamic Decreasing of High Crossover (ILM/DHC). The dynamic nature of the proposed methods allows the ratios of both crossover and mutation operators to be changed linearly during the search progress, where (DHM/ILC) starts with 100% ratio for mutations, and 0% for crossovers. Both mutation and crossover ratios start to decrease and increase, respectively. By the end of the search process, the ratios will be 0% for mutations and 100% for crossovers. (ILM/DHC) worked the same but the other way around. The proposed approach was compared with two parameters tuning methods (predefined), namely fifty-fifty crossover/mutation ratios, and the most common approach that uses static ratios such as (0.03) mutation rates and (0.9) crossover rates. The experiments were conducted on ten Traveling Salesman Problems (TSP). The experiments showed the effectiveness of the proposed (DHM/ILC) when dealing with small population size, while the proposed (ILM/DHC) was found to be more effective when using large population size. In fact, both proposed dynamic methods outperformed the predefined methods compared in most cases tested.

Eman Abunawas

Papers

Choosing Mutation and Crossover Ratios for Genetic Algorithms—A Review with a New Dynamic Approach