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.

This paper investigates the use of more than one crossover operator to enhance the performance of genetic algorithms. Novel crossover operators are proposed such as the collision crossover, which is based on the physical rules of elastic collision, in addition to proposing two selection strategies for the crossover operators, one of which is based on selecting the best crossover operator and the other randomly selects any operator. Several experiments on some travelling salesman problems have been conducted to evaluate the proposed methods, which are compared to the well-known modified crossover operator and partially mapped crossover. The results show the importance of some of the proposed methods, such as the collision crossover, in addition to the significant enhancement of the genetic algorithms performance, particularly when using more than one crossover operator.

Biometric technology has received a lot of attention in recent years. One of the most prevalent biometric traits is the finger-knuckle print (FKP). Because the dorsal region of the finger is not exposed to surfaces, FKP would be a dependable and trustworthy biometric. We provide an FKP framework that uses the VGG-19 deep learning model to extract deep features from FKP images in this paper. The deep features are collected from the VGG-19 model’s fully connected layer 6 (F6) and fully connected layer 7 (F7). After applying multiple preprocessing steps, such as combining features from different layers and performing dimensionality reduction using principal component analysis (PCA), the extracted deep features are put to the test. The proposed system’s performance is assessed using experiments on the Delhi Finger Knuckle Dataset employing a variety of common classifiers. The best identification result was obtained when the Artificial neural network (ANN) classifier was applied to the principal components of the averaged feature vector of F6 and F7 deep features, with 95% of the data variance preserved. The findings also demonstrate the feasibility of employing these deep features in an FKP recognition system.

The genetic algorithm (GA) is a well-known metaheuristic approach for dealing with complex problems with a wide search space. In genetic algorithms (GAs), the quality of individuals in the initial population is important in determining the final optimal solution. The classic GA using the random population seeding technique is effective and straightforward, but the generated population may contain individuals with low fitness, delaying convergence to the best solution. On the other side, heuristic population seeding strategies provide the advantages of producing individuals with high fitness and encouraging rapid convergence to the optimal solution. Using background information on the problem being solved, researchers have developed several population seeding approaches. In this paper, to enhance the genetic algorithm efficiency, we propose a new method for the initial population seeding based on a greedy approach. The proposed method starts by adding four extreme cities to the route, creating a loop, and then adding each city to the route through a greedy strategy that calculates the cost of adding every city to different locations along the route. This method identifies the best position to place the city as well as the best city to add. Employing local constant permutations improves the resultant route even more. Together with the suggested approach, we examine the GA’s effectiveness while employing conventional population seeding methods like nearest-neighbor, regression-based, and random seeding. Utilizing some of the well-known Traveling Salesman Problem (TSP) examples from the TSPLIB, the standard library for TSPs, tests were conducted. In terms of the error rate, average convergence, and time, the experimental results demonstrate that the GA that employs the suggested population seeding technique performs better than other GAs that use conventional population seeding strategies.

Genetic algorithms (GAs) are powerful heuristic search techniques that are used successfully to solve problems for many different applications. Seeding the initial population is considered as the first step of the GAs. In this work, a new meth...

The k-nearest neighbor (KNN) algorithm remains one of the most fundamental and widely-used methods in machine learning. A common rule of thumb sets the number of neighbors as k = √n, where n is the size of the training set. Despite its widespread adoption, the theoretical justification for this choice has remained obscure. We provide a comprehensive rate-based analysis. First, we derive the minimax-optimal exponent β★ = 4/(d+4) for k = n^β under standard Hölder-smoothness assumptions, recovering as a special case Theorem 1: k = √n is minimax-optimal if and only if the feature space has dimensionality d = 4. Second, Theorem 2 quantifies the sub-optimality of any fixed β as R_n(n^β) = Θ(n^(−r(β,d))) with r(β,d) = min{β, 4(1−β)/d}, yielding an asymmetric penalty for the classical rule when d ≠ 4 that we make precise in Corollary 1. The predicted rate is empirically verified across d ∈ {2,…,20} on controlled synthetic data. On 48 datasets from the OpenML-CC18 benchmark suite, the dimension-aware rule k = ⌊n^(4/(d+4))⌋ outperforms the classical √n rule in 32 of 48 head-to-head comparisons (paired Wilcoxon p = 4.6 × 10⁻⁴, mean accuracy gain +2.5 percentage points), demonstrating that the theoretical improvement translates to a practical one. We further test the Hassanat distance metric against Euclidean across all KNN variants on the same 48 datasets, finding that Hassanat outperforms Euclidean in five of six configurations (paired Wilcoxon p < 0.05), with the largest gains on unstandardized data. Cross-validation remains the strongest k-selection strategy when computationally feasible, and the theoretical results provide a principled non-cross-validated alternative.