In this paper, we present a hybrid genetic-hierarchical algorithm for the solution of the quadratic assignment problem. The main distinguishing aspect of the proposed algorithm is that this is an innovative hybrid genetic algorithm with the original, hierarchical architecture. In particular, the genetic algorithm is combined with the so-called hierarchical (self-similar) iterated tabu search algorithm, which serves as a powerful local optimizer (local improvement algorithm) of the offspring solutions produced by the crossover operator of the genetic algorithm. The results of the conducted computational experiments demonstrate the promising performance and competitiveness of the proposed algorithm.

To properly and quickly evaluate an object’s shape, in a manner that is suitable for real-time applications, a set of parameters has been created and the shape parametric description (SPD) has been elaborated. This solution is focused on the classification of amber gemstones according to shape. To improve the results obtained by SPD, the most popular machine learning classification algorithms were applied and tested. The proposed method (i.e., SPD) achieved the fastest classification, requiring the least computational resources, while providing an accuracy of approximately 80%. The best results were achieved when the SPD parameters were used in a feedforward neural network (FFNN), and an accuracy of 91.5% was obtained, while the time required for the computations remained in a range that is acceptable for real-time applications.

Publisher: Vilnius University Institute of Data Science and Digital Technologies, Journal: Informatica, Title: Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem, Authors: Alfonsas Misevičius , Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the performance of the genetic search in the context of the grey pattern problem (GPP) are discussed. The main attention is paid to the investigation of the solution recombination, i.e., crossover operators which play an important role by developing robust genetic algorithms. We implemented seven crossover operators within the hybrid genetic algorithm (HGA) framework, and carried out the computational experiments in order to test the influence of the recombination operators to the genetic search process. We examined the one point crossover, the uniform like crossover, the cycle crossover, the swap path crossover, and others. A so-called multiple parent crossover based on a special type of recombination of several solutions was tried, too. The results obtained from the experiments on the GPP test instances demonstrate promising efficiency of the swap path and multiple parent crossovers.

GENERATION OF GREY PATTERNS USING AN IMPROVED GENETICEVOLUTIONARY ALGORITHM: SOME NEW RESULTS