Genetic Algorithm for Document Clustering with Simultaneous and Ranked Mutation

Genetic algorithm is heuristic searching algorithm which based on nature selection of mechanism and nature genetic. The basic concept that inspires the genetic algorithm is that evolution theory. In the process of searching the best solution on classic genetic algorithm often occurs optimum local. Optimum local is a common problem which is often occurs in genetic algorithm, and one of the reasons is that because of the population diversity. If population diversity is too low is led to optimum local, and if it is too high caused more times to look for the best solution. Mutation operator plays an important role in the process of genetic algorithm to manage that population diversity and an important element of mutation operator is mutation rate. On classic genetic algorithm that mutation rate is set in the beginning while the process of genetic algorithm depends on how many generations are. Therefore is needed to control mutation rate in generation. Controlling mutation operator, especially mutation rate based on Fuzzy Logic Controller (FLC) to manage population diversity, not too high or too low, in order to get optimal result. Evaluation is done 10 times execution by comparing the performance of standard genetic algorithm (GA), IAG and genetic algorithm based on Fuzzy Logic Controller (FLC) and experimental results show that there is an improvement on genetic algorithm performance based on FLC. Keywords: Genetic Algorithm, Fuzzy Logic Controller (FLC), Mutation Rate

With the emergence of wireless networking paradigm, several optimization problems are appearing in such networks. Such problem are related to optimizing network connectivity, coverage and stability. The resolution of these problems turns out to be crucial for optimized network performance. In the case of Wireless Mesh Networks, such problems include computing placement of mesh router nodes so that network performance is optimized. However, as these optimization problems are known to be computationally hard to solve, Genetic Algorithms (GAs) have been recently investigated as effective resolution methods. Mutation operator is one of the GA ingredients. Unlike crossover operators, which achieve to transmit genetic information from parents to off springs, mutation operators usually make some small local perturbation of the individuals, having thus less impact on individuals. Moreover, crossover is "a must" operator in GA and is usually applied with high probability, while mutation operators when implemented, are applied with small probability. Due to this, mutation operator is usually considered as a secondary operator. However, many studies in the literature have shown that mutation when effectively combined with selection operators can improve the performance of GAs. In this work we present the results of an experimental study on the effect of mutation and selection operators in GA for mesh router nodes placement problem. The study aims to identify the mutation and selection types that work best for instances of different characteristics.

Based on the traditional grid density clustering algorithm, proposing A Data Stream Clustering Algorithm Based on Density and Extended Grid(DEGDS). The algorithm combines the advantages of grid clustering algorithm and density clustering algorithm, by improving the defects of clustering parameters by artificially set, get any shape of the cluster. The algorithm uses the local density of each sample point and the distance from the other sample points, determining the number of clustering centers in the grid, and realizing the automatic determination of the clustering center, which avoids the influence of improper selection of initial centroid on clustering results. And in the process of combining the Spark parallel framework for partitioning the data to achieve its parallelization. For data points clustered outside the grid, the clustering within the grid has been effectively expanded by extending the grid, to ensure the accuracy of clustering. Introduced density estimation is connected and grid boundaries to merging grid, saving memory consumption. Using the attenuation factor to incremental update grid density, reflect the evolution of spatial data stream. The experimental results show that compared with the traditional clustering algorithm, the DEGDS algorithm has a large performance improvement in accuracy and efficiency, and can be effectively for large data clustering.

Simulated annealing spectral clustering algorithm for image segmentation

BackgroundMining epistatic loci which affects specific phenotypic traits is an important research issue in the field of biology. Bayesian network (BN) is a graphical model which can express the relationship between genetic loci and phenotype. Until now, it has been widely used into epistasis mining in many research work. However, this method has two disadvantages: low learning efficiency and easy to fall into local optimum. Genetic algorithm has the excellence of rapid global search and avoiding falling into local optimum. It is scalable and easy to integrate with other algorithms. This work proposes an epistasis mining approach based on genetic tabu algorithm and Bayesian network (Epi-GTBN). It uses genetic algorithm into the heuristic search strategy of Bayesian network. The individual structure can be evolved through the genetic operations of selection, crossover and mutation. It can help to find the optimal network structure, and then further to mine the epistasis loci effectively. In order to enhance the diversity of the population and obtain a more effective global optimal solution, we use the tabu search strategy into the operations of crossover and mutation in genetic algorithm. It can help to accelerate the convergence of the algorithm.ResultsWe compared Epi-GTBN with other recent algorithms using both simulated and real datasets. The experimental results demonstrate that our method has much better epistasis detection accuracy in the case of not affecting the efficiency for different datasets.ConclusionsThe presented methodology (Epi-GTBN) is an effective method for epistasis detection, and it can be seen as an interesting addition to the arsenal used in complex traits analyses.

Improved random selection strategy, self-adaptive crossover and mutation operators, population co-evolution algorithm are adopted in this paper to set up a new genetic algorithm(GA), guaranteeing the universality of population, the thoroughness of solution and the execution efficiency of algorithm in solving multi-process, process crossover, work-piece flow and other condition based scheduling problem of flexible manufacturing system(FMS). The problem of GA in solving FMS scheduling is summarized in this paper, reasons and countermeasures for GA's pre-maturing are studied, longitudinal and transverse comprehensive state-based correlative self-adaptive crossover and mutation operators are raised according to the analysis on GA to avoid local optimization and pre-maturity, the co-evolutionary GA is designed to solve the scheduling model for FMS, and the algorithm is validated for the scheduling of box-type parts for precise machine tools.

In this paper the image compression problem is analyzed using genetic clustering algorithms based on the pixels of the image. The main problem to solve is to find an algorithm that performs the clustering efficiently. The possibility of solving clustering problems with genetic algorithms provides optimal solution. The present work makes use of genetic clustering algorithms to obtain an ordered representation of the image and then applies the DWT (Discrete Wavelet Transformation) to compress the image. The image quality is measured using PSNR measure. The genetic algorithm (GA)-based compression image has more PSNR value compared to the image without GA. It shows that the quality of the image is good for GA based compression. Also it reduces the problem of memory utilization efficiently due to compression and at the same time quality of the image is maintained due to GA. Keywords: Genetic algorithms, clustering, image compression, discrete wavelet transformation.

BackgroundProtein structure prediction (PSP) has important applications in different fields, such as drug design, disease prediction, and so on. In protein structure prediction, there are two important issues. The first one is the design of the structure model and the second one is the design of the optimization technology. Because of the complexity of the realistic protein structure, the structure model adopted in this paper is a simplified model, which is called off-lattice AB model. After the structure model is assumed, optimization technology is needed for searching the best conformation of a protein sequence based on the assumed structure model. However, PSP is an NP-hard problem even if the simplest model is assumed. Thus, many algorithms have been developed to solve the global optimization problem. In this paper, a hybrid algorithm, which combines genetic algorithm (GA) and tabu search (TS) algorithm, is developed to complete this task.ResultsIn order to develop an efficient optimization algorithm, several improved strategies are developed for the proposed genetic tabu search algorithm. The combined use of these strategies can improve the efficiency of the algorithm. In these strategies, tabu search introduced into the crossover and mutation operators can improve the local search capability, the adoption of variable population size strategy can maintain the diversity of the population, and the ranking selection strategy can improve the possibility of an individual with low energy value entering into next generation. Experiments are performed with Fibonacci sequences and real protein sequences. Experimental results show that the lowest energy obtained by the proposed GATS algorithm is lower than that obtained by previous methods.ConclusionsThe hybrid algorithm has the advantages from both genetic algorithm and tabu search algorithm. It makes use of the advantage of multiple search points in genetic algorithm, and can overcome poor hill-climbing capability in the conventional genetic algorithm by using the flexible memory functions of TS. Compared with some previous algorithms, GATS algorithm has better performance in global optimization and can predict 3D protein structure more effectively.

Performance evaluation results of evolutionary clustering algorithm star for clustering heterogeneous datasets

Outpatient scheduling is a complex and time-consuming task. To address this challenge, numerous studies have developed various optimization methods, including genetic algorithms. This study aims to develop a task-specific genetic algorithm and investigate the effect of different mutation operators on its performance, focusing on minimizing the earliest completion time of scheduled examinations. Random and two heuristic mutation operators were designed and compared. The effect of these mutation operators and their parameters were evaluated across four fundamentally distinct scheduling scenarios. The exponential mutation operator outperformed all others across all scheduling problems. It achieved an optimal schedule in 100% of runs for the simplest task and in 74.5% of runs for the most complex one. In comparison, the random mutation operator achieved 100% and 1%, while the polynomial operator reached 75.66% and only 0.22%, respectively. The efficiency of the genetic algorithm developed for outpatient scheduling is strongly influenced by the choice of mutation operator. The performance of the algorithm can be greatly enhanced by employing a specialized mutation operator tailored to the objective function.

Bus scheduling problem is vital to ensure service quality and save operational cost. Electric bus scheduling problem is difficult to solve because of vehicles' limited driving range and charging requirements. This article investigates the multi-depot electric bus scheduling problem (MD-EBSP). A genetic algorithm with trip-adjustment strategy (GA-TAS) is proposed for the MD-EBSP. Firstly, a genetic algorithm (GA) with three crossover operators and seven mutation operators is devised to find a set of solutions. In each generation, a randomly selected crossover (mutation) operator is used to update the individuals. The solutions found by the GA are further improved by a trip-adjustment strategy (TAS) to obtain the final solution. The GA-TAS is compared with an adaptive large neighbourhood search method, a heuristic procedure, and experience-based scheduling schemes on seven problem instances. Experiments show that the GA-TAS outperforms comparative approaches on a number of vehicle and balancing vehicle driving tasks.

Detecting quality community structures in complex networks is an important and highly active research area. Plenty of methods have been proposed for community detection in recent years. Among them, Genetic Algorithms (GAs) have been widely explored for community detection due to their strong competence at exploring the global discrete search space. However, existing GA algorithms for community detection still face major challenges when handling large and complex networks due to their use of random mutation operators. Whenever any candidate community structure in a GA population is mutated, a mutated node of the network under processing is often associated to a community with loose connections, seriously hurting GA’s effectiveness and scalability. To address this issue, a newly designed Leiden-based GA (LGA) with a novel mutation operator based on the Leiden algorithm is proposed in this paper to improve the effectiveness of the mutation operator and the performance of the GA approach. Experiment results clearly show that LGA can achieve highly competitive performance in comparison to several state-of-the-art GA and non-GA community detection algorithms on multiple synthetic and real-world networks.KeywordsCommunity detectionLeiden algorithmGenetic algorithm

Clustering in wireless sensor networks has been one of the most effective mechanisms for addressing the issues of network lifetime, scalability and bandwidth reusability. In this paper, application of a relatively new meta-heuristic called as quantum inspired genetic algorithm has been proposed for dealing with the problem of multi-hop energy balanced unequal clustering and prolonging the network lifetime. Quantum inspired genetic algorithm conflates the concepts of evolutionary computation with the principles of quantum computing. The quantum computing principles impart huge parallel processing capabilities to the genetic algorithm due to which these algorithms provide better quality solutions in lesser amount of time. Quantum inspired algorithms are capable of providing competitive solutions even with a very small population size which results in reduced computational cost as population size is a factor in complexity calculation for evolutionary and swarm algorithms. The effectiveness of proposed approach has been evaluated by comparing it with traditional genetic algorithm based clustering for wireless sensor networks. Simulation results clearly indicate that quantum inspired genetic algorithm is capable of performing clustering in more efficient way and increasing the network lifetime as compared to traditional genetic algorithm.

Dynamic programming decision path encoding of genetic algorithms for production allocation problems

University examination timetabling problem is a complicated, multi-constraint combinatorial optimization problem. The current grouping genetic algorithm could get a better optimistic solution. Although the block encoding technique was applied in, the probabilities of crossover and mutation operation were still based on simple genetic algorithm. So the universality of this algorithm is not very well because the same probabilities of crossover and mutation operation could obtain different effects in different cases of examination arrangements. To find a more general algorithm, an Improved Adaptive Genetic Algorithm (IAGA) for practical applications was presented in this paper. IAGA can reconstruct the probabilities of crossover and mutation operation according to different cases of examination arrangements. To make further improvement of its convergence speed and overcome premature problem, IAGA appropriately adjusts mutation operation by Population's Maturity in addition. Moreover, the Memory Operator was added into the Algorithm to ensure getting the global optimization solution. Finally, IAGA was tested in function optimization and Examination Timetabling problems, and the experiments show that the results are promoted very well.