Optimization of the Vertex Separation Problem with Genetic Algorithms

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.

This paper introduces a bi-objective winner determination problem which arises in the procurement of transportation contracts via combinatorial auctions where bundle bidding is possible. The problem is modelled as a bi-objective extension to the set covering problem. We consider both the minimisation of the total procurement costs and the maximisation of the service-quality level at which the transportation contracts are executed. Taking into account the size of real-world transport auctions, a solution method has to cope with problems of up to some hundred contracts and a few thousand bundle bids. To solve the problem, we propose a bi-objective branch-and-bound algorithm and eight variants of a multiobjective genetic algorithm. Artificial benchmark instances that comply with important economic features of the transport domain are introduced to evaluate the methods. The branch-and-bound approach is able to find the optimal trade-off solutions in reasonable time for very small instances only. The eight variants of the genetic algorithm are compared among each other by means of large instances. The best variant is also evaluated using the small instances with known optimal solutions. The results indicate that the performance largely depends on the initialisation heuristic and suggest also that a well-balanced combination of genetic operators is crucial to obtain good solutions.

Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem

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.

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.

An empirical study of impact of crossover operators on the performance of non-binary genetic algorithm based neural approaches for classification

Because of the rapid growth of air traffic, optimizing airport management is becoming necessary in order to improveairport's capacity and better align its resources to the received traffic. In this paper we study the assignment of the arriving aircrafts to the available gates using the fixed daily schedule. We introduce a new approach based on Genetic Algorithms (GA) to solve the gate assignment problem (GAP). The encoding strategy consists in representing the chromosome by a vector of integers. The index of each gene represents the flight number and its value represents the gate to which the flight will be assigned. The method used to generate the initial population is based on three different heuristics and a random sorting of the gates. The selection method is the “In fitness proportionate selection” known as “roulette wheel selection”. In addition to one point and two point Crossover operators, we designed a Greedy procedure Crossover (GPX) operator. The experimentation is based on the use of fictive scenarios generated in accordance with the physical characteristics of the Tunis Carthage Airport and using different flight schedules. The comparison between deterministic approach, simple heuristics and the GA has shown the efficiency of the last approach in terms of solution's quality when we aim at solving the problems of large size. In order to determine the best configuration of the GA, we compared the different crossover operators and we noticed that the use of GPX improves the speed of convergence of the algorithm towards better solutions.

Evolutionary algorithms (EAs) have been extensively used since their invention. EAs are considered as a powerful tool to solve numerous optimisation problems in various fields. Their search mechanisms have been actively developed to improve their search efficiency toward global optima solutions. This study aims to investigate the effects of using different types of recombination (crossover) schemes. It introduces an adaptive version of EA called adaptive multi-crossover evolutionary algorithm (AMCEA). The proposed AMCEA offers multiple forms of heuristic crossover operators based on genetic algorithm (GA) and harmony search algorithm (HSA). The proposed technique improves the search attitude by allowing the effective utilisation of exploration and exploitation strategies during the evolution process. The quality of the proposed AMCEA is evaluated on six real-world numerical optimisation problems (IEEE-CEC2011), and results are compared with those obtained with five variants of GA and HSA. Results demonstrate the superiority of the AMCEA over previously improved algorithms in terms of solution quality; it achieves the lowest mean results and lowest best results in 75% and 66% of the total experiment cases, respectively.

Conventional biomarker discovery focuses mostly on the identification of single markers and thus often has limited success in disease diagnosis and prognosis. This study proposes a method to identify an optimized protein biomarker panel based on MS studies for predicting the risk of major adverse cardiac events (MACE) in patients. Since the simplicity and concision requirement for the development of immunoassays can only tolerate the complexity of the prediction model with a very few selected discriminative biomarkers, established optimization methods, such as conventional genetic algorithm (GA), thus fails in the high-dimensional space. In this paper, we present a novel variant of GA that embeds the recursive local floating enhancement technique to discover a panel of protein biomarkers with far better prognostic value for prediction of MACE than existing methods, including the one approved recently by FDA (Food and Drug Administration). The new pragmatic method applies the constraints of MACE relevance and biomarker redundancy to shrink the local searching space in order to avoid heavy computation penalty resulted from the local floating optimization. The proposed method is compared with standard GA and other variable selection approaches based on the MACE prediction experiments. Two powerful classification techniques, partial least squares logistic regression (PLS-LR) and support vector machine classifier (SVMC), are deployed as the MACE predictors owing to their ability in dealing with small scale and binary response data. New preprocessing algorithms, such as low-level signal processing, duplicated spectra elimination, and outliner patient's samples removal, are also included in the proposed method. The experimental results show that an optimized panel of seven selected biomarkers can provide more than 77.1% MACE prediction accuracy using SVMC. The experimental results empirically demonstrate that the new GA algorithm with local floating enhancement (GA-LFE) can achieve the better MACE prediction performance comparing with the existing techniques. The method has been applied to SELDI/MALDI MS datasets to discover an optimized panel of protein biomarkers to distinguish disease from control.

The aim of this paper is to show the influence of genetic operators such as crossover and mutation on the performance of a genetic algorithm (GA). The GA is applied to the multi-objective permutation flowshop problem. To achieve our goal an experimental study of a set of crossover and mutation operators is presented. A measure related to the dominance relations of different non-dominated sets, generated by different algorithms, is proposed so as to decide which algorithm is the best. The main conclusion is that there is a crossover operator having the best average performance on a very specific set of instances, and under a very specific criterion. Explaining the reason why a given operator is better than others remains an open problem.

Floorplanning is a crucial process in the early stage of VLSI physical design. It determines the performance, reliability, and size of chips. B*-tree is a simple yet efficient representation that encodes the layout of modules in a compact and non-slicing structure. Several B*-tree variants and corresponding operators have been proposed to deal with non-slicing floorplanning. However, these operators are considered and applied individually. A collective manipulation of them remains missing. This study proposes a genetic algorithm (GA) that enables multiple crossover and mutation operators for solving the non-slicing floorplanning problem. In particular, the GA selects one crossover operator and one mutation operator from the pool of operators whenever reproducing an offspring. The probability for an operator to be selected is based on its empirical performance. This study conducts experiments on two well-known benchmarks to examine the effectiveness of the proposed method. The experimental results show that the GA can achieve superior solution quality and efficiency on the non-slicing VLSI floorplanning.

Energy-efficient virtual machine placement in data centres via an accelerated Genetic Algorithm with improved fitness computation

Scheduling is a vital issue in cloud computing in order to facilitate optimized usage of resources. Genetic algorithms are used in optimization techniques as they are class of heuristic approaches that have their inspirations from evolutionary ideas of natural evolution. The cloud scheduling optimization problem is modelled as a population of candidate solutions and the genetic algorithm is applied for benefitting the fittest candidates. This paper presents a broad overview on the formalization of works contributed by variants of Genetic Algorithm to the field of Scheduling which can be applied to cloud computing.

Genetic algorithms (GAs) have achieved lots of success in various applications, but the problem to balance exploration and exploitation of population is still up in the air. In this paper, we propose a variant of genetic algorithm with mating operator GASF to alleviate the problem;GASFmeasures the mating attractiveness of individuals from four aspects: gender, age, similarity and fitness. Individuals are assigned gender to facilitate mimicking human reproduction, and contributions of age, similarity and fitness to the attractiveness are respectively quantified and self-adaptively adjusted. Experimental results indicate that the proposed approach can achieve competitive performance with improved convergence.

Enhancing the genetic-based scheduling in computational grids by a structured hierarchical population