Crew Pairing is one of the most important and difficult problems for airline companies. Nets to fuel costs, the crew costs constitute the largest cost of airlines, and the crew costs depend on the quality of the solution to the pairing problem. Conventional systems have been used to solve a daily model, which handles only regular flights with many simplifications, so a lot of corrections are needed to get a feasible solution and the quality of the solution is not so (...) high. A fully dated model, which handles regular flights and irregular flights simultaneously, is extremely hard and has not been solved directly hitherto. The number of irregular flights tend to increase in Europe and Japan, hence the resolution of the practical fully dated pairing system is desired. This paper presents a new approach which solves directly the fully dated crew pairing by Genetic Algorithms. GA is improved with stochastic processes to attack the fully dated model, and many heuristics are included in the decoding mecanism of the GA. For several hundred flights per day for fully dated 2 months scheduling period, the system found better or equivalent solutions to the human scheduler’s without any simplification from 5 to 20 times faster. (shrink)

Comprehensive analysis of proteins to evaluate their genetic diversity, study their differences, and respond to the tensions is the main subject of an interdisciplinary field of study called proteomics. The main objective of the proteomics is to detect and quantify proteins and study their post-translational modifications and interactions using protein chemistry, bioinformatics, and biology. Any disturbance in proteins interactive network can act as a source for biological disorders and various diseases such as Alzheimer and cancer. Most current computational methods (...) for discovering protein complexes are usually based on specific topological characteristics of protein-protein networks. To identify the protein complexes, in this paper, we, first, present a new encoding method to represent solutions; we then propose a new clustering algorithm based on the genetic algorithm, named PPI-GA, employing a new multiobjective quality function. The proposed algorithm is evaluated on two gold standard and real-world datasets. The result achieved demonstrates that the proposed algorithm can detect important protein complexes, and it provides more accurate results compared with state-of-the-art protein complex identification algorithms. (shrink)

The aviation industry is one of the most widely used applications in transportation. Due to the limited capacity of aircraft, revenue management in this industry is of high significance. On the other hand, the hub location problem has been considered to facilitate the demands assignment to hubs. This paper presents an integrated p-hub location and revenue management problem under uncertain demand to maximize net revenue and minimize total cost, including hub establishment and transportation costs. A fuzzy programming model and a (...) genetic algorithm are developed to solve the proposed model with different sizes. The mining and petroleum industry is used for case studies. Results show that the proposed algorithm can obtain a suitable solution in a reasonable amount of time. (shrink)

This article presents the design and development of a genetic algorithm to generate long-range transmit codes with low autocorrelation side lobes for radar to minimize target profile estimation error. The GA described in this work has a parallel processing design and has been used to generate codes with multiple constellations for various code lengths with low estimated error of a radar target profile.

With the advent of the cloud computing model allowing a shared access to massive computing facilities, a surging demand emerges for the protection of the intellectual property tied to the programs executed on these uncontrolled systems. If novel paradigm as confidential computing aims at protecting the data manipulated during the execution, obfuscating techniques (in particular at the source code level) remain a popular solution to conceal the purpose of a program or its logic without altering its functionality, thus preventing reverse-engineering (...) on the program even with the help of computing resources. The many advantages of code obfuscation, together with its low cost, makes it a popular technique. This paper proposes a novel methodology for source code obfuscation that can be used together with other traditional obfuscation techniques, making the code more robust against reverse engineering attacks. Three program complexity metrics are used to define three different single-objective combinatorial optimization versions of the problem, which are solved and analysed. Additionally, three multi-objective problems are defined, those considering each of the selected metrics together with the program execution time, in order to avoid strong obfuscations penalizing the performance. The goal of the defined problems is to find sequences of LLVM optimizations that lead to highly obfuscated versions of the original code. These transformations are applied to the back-end pseudo-assembly code (i.e., LLVM Intermediate Representation), thus avoiding any further optimizations by the compiler. Classical genetic algorithms (GAs) are used to solve the studied problems, namely a basic cellular GA for the single-objective problems and the popular NSGA-II for the multi-objective ones. The promising results show the potential of the proposed technique. (shrink)

This study aims to develop a hybrid model to represent the human mind from a functionalist point of view that can be adapted to artificial intelligence. The model is not a realistic theory of the neural network of the brain but an instrumentalist AI model, which means that there can be some other representative models too. It had been thought that the provability of an axiomatic system requires the completeness of a formal system. However, Gödel proved that no consistent formal (...) system can prove its own consistency. There is a paradoxical limit to provability. Both consistency and completeness are impossible together. These formal limits form the basis of our model: the hybrid model of the mind consists of a formal axiomatic system and an evolutionary algorithm (EA) of intelligence, which also includes the genetic algorithm (GA) of consciousness. The GA of consciousness operates based on intentions, functioning in conjunction with the principles of EA. This collaboration allows it to transcend the paradoxical formal limits of intelligence. However, GA overcomes the problem of paradoxicality at the cost of producing illusions. Following this collaboration gives us a GA operating system. After all, if the rational optimization task of the GA in question produces illusions, then the rationality must lie elsewhere in the paradox. (shrink)

The travelling salesman problem (TSP) belongs to the class of NP-hard problems, in which an optimal solution to the problem cannot be obtained within a reasonable computational time for large-sized problems. To address TSP, we propose a hybrid algorithm, called GA-TCTIA-LBSA, in which a genetic algorithm (GA), tour construction and tour improvement algorithms (TCTIAs) and a list-based simulated annealing (LBSA) algorithm are used. The TCTIAs are introduced to generate a first population, and after that, a search is continued (...) with the GA. The problem of premature convergence of the GA to local optimum is tackled by a method called social disaster technique. Afterwards, the LBSA is applied to generate a new population based on one of two proposed operators called packing and judgement day. The proposed algorithm is implemented in the MATLAB environment, and its two variants, called GA-TCTIA-LBSA packing and GA-TCTIA-LBSA judgement day, are tested on symmetric and asymmetric instances from TSPLIB. The overall results demonstrate that the proposed GA-TCTIA-LBSAs offer promising results, particularly for small-sized instances. (shrink)

This study is to explore the optimization of the adaptive genetic algorithm in the backpropagation neural network, so as to expand the application of the BPNN model in nonlinear issues. Traffic flow prediction is undertaken as a research case to analyse the performance of the optimized BPNN. Firstly, the advantages and disadvantages of the BPNN and genetic algorithm are analyzed based on their working principles, and the AGA is improved and optimized. Secondly, the optimized AGA is applied to (...) optimize the standard BPNN, and the optimized algorithm is named as OAGA-BPNN. Finally, three different cases are proposed based on the actual scenario of traffic flow prediction to analyse the optimized algorithm on the matrix laboratory platform by simulation. The results show that the average error distribution of the GA-BPNN algorithm is about 1% with small fluctuation range, better calculation accuracy, and generalization performance in contrast to the BPNN. The average output error of the AGA-BPNN fluctuates around 0 and remains in a relatively stable range as a whole in contrast to that of GA-BPNN; the maximum fitness level keeps increasing during the evolution process but approaches the average value in later process, so the population diversity is hard to be guaranteed. The output error of the OAGA-BPNN fluctuates little compared with that of AGA-BPNN, and its maximum fitness continues to increase in the evolution process with guaranteed population diversity. In short, the OAGA-BPNN algorithm can achieve the best performance in terms of calculation accuracy, generalization performance, and population evolution. (shrink)

Porosity is considered as one of the most important indicators for the characterization of the comprehensive performance of thermal barrier coatings. In this study, the ultrasonic technique and the artificial neural network optimized with the genetic algorithm are combined to develop an intelligent method for automatic detection and accurate prediction of TBCs’s porosity. A series of physical models of plasma-sprayed ZrO2 coating are established with a thickness of 288 μm and porosity varying from 5.71% to 26.59%, and the ultrasonic (...) reflection coefficient amplitude spectrum is constructed based on the time-domain numerical simulation signal. The characteristic features f 1, f 2, A max, Δ A of the URCAS, which are highly dependent on porosity, are extracted as input data to train the GA_BPNN model for predicting the unknown porosity. The average error of the prediction results is 1.45%, which suggests that the proposed method can achieve accurate detection and quantitative characterization of the porosity of TBCs with complex pore morphology. (shrink)

Genetic Algorithms(GAs) are effective approximation algorithms which focus on “hopeful area” in the searching process. However, in harder problems, it is often very difficult to maintain a favorable trade-off between exploitation and exploration. All individuals leave the big-valley including the global optimum, and concentrate on another big-valley including a local optimum often. In this paper, we define such a situation on conventional GAs as the “UV-phenomenon”, and suggest UV-structures as hard landscape structures that will cause the UV-phenomenon. (...) We introduce a test function which has explicit UV-structures, and show UV-phenomenon caused by them. Next we analyze Fletcher and Powell function to confirm our hypothesis. Finally we propose a novel framework of GAs which can cope with UV-structures. (shrink)

Forecasting blood glucose values for patients can help prevent hypoglycemia and hyperglycemia events in advance. To this end, this study proposes an intelligent ensemble deep learning system to predict BG values in 15, 30, and 60 min prediction horizons based on historical BG values collected via continuous glucose monitoring devices as an endogenous factor and carbohydrate intake and insulin administration information as exogenous factors. Although there are numerous deep learning algorithms available, this study applied five algorithms, namely, recurrent (...) neural network, which is optimized for sequence data, and RNN-based algorithms, stacked LSTM, bidirectional LSTM, and gated recurrent unit). Then, a genetic algorithm was applied to the five prediction models to optimize their weights through ensemble techniques and to yield the final predicted BG values. The performance of the proposed model was compared to that of the autoregressive integrated moving average model as a baseline. The results show that the proposed model significantly outperforms the baseline in terms of the root mean square error and continuous glucose error grid analysis. For the valid 29 diabetic patients for the multivariate models, the RMSE was 11.08, 19.25, and 31.30 mg/DL for 15, 30, and 60 min PH, respectively. When the same data were applied to univariate models, the RMSE was 11.28, 19.99, and 33.13 mg/DL for 15, 30, and 60 min PH, respectively. Both the univariate and multivariate models showed a statistically significant difference compared with the baseline at a 5% statistical significance level. Instead of using a model with a single algorithm, applying a GA based on each output of a model with multiple algorithms was found to play a significant role in improving model performance. (shrink)

The deterministic economic system will also produce chaotic dynamic behaviour, so economic chaos is getting more and more attention, and the research of economic chaos forecasting methods has become an important topic at present. The traditional economic chaos forecasting models are mostly based on large samples, but in actual production activities, there are a large number of small-sample economic chaos problems, and there is still no effective solution. This paper proposes a combined forecasting model based on the traditional economic chaos (...) forecasting method. First of all, through the decision tree classification, priority selection of features, rough prediction is achieved. Secondly, we use BP neural network to make secondary prediction. Because the initial weight is randomly selected, it is easy to fall into the defect of local minimum. This paper optimizes the BP neural network. Finally, the decision tree model and the BP neural network model optimized by the improved genetic algorithm are combined, and the combined model is optimized by the improved GA. This method can take advantage of many prediction models and combine the prediction information of multiple different prediction models to effectively improve the fitting ability of the model and improve the prediction accuracy. (shrink)

The well-known classifier support vector machine has many parameters associated with its various kernel functions. The radial basis function kernel, being the most preferred kernel, has two parameters to be optimized. The problem of optimizing these parameter values is called model selection in the literature, and its results strongly influence the performance of the classifier. Another factor that affects the classification performance of a classifier is the feature subset. Both these factors are interdependent and must be dealt with simultaneously. Following (...) the multiobjective definition of feature selection, we have applied a multiobjective genetic algorithm, NSGA II, to optimize the feature subset and model parameters simultaneously. Comparison of the proposed approach with the grid algorithm and GA-based method suggests that the MOGA-based approach performs better than the grid algorithm and is as good as the GA-based approach. Moreover, it provides multiple solutions instead of a single solution. The users can prefer one feature subset over the other as per their requirement and available resources. (shrink)

For genetic algorithms, it is important to maintain the population diversity. Some genetic algorithms have been proposed, which have an ability to control the diversity. But these algorithms use the distance between two individuals to control the diversity. Therefore, these performances become worse on ill-scaled functions. In this paper, we propose a new genetic algorithm, DIDC(a genetic algorithm with Distance Independent Diversity Control), that does not use a distance to control the population diversity. (...) For controlling the diversity, DIDC uses two GAs that have different natures. For realizing different natures, one GA uses a crossover operator as a search operator, and the other GA uses a mutation operator in DIDC. By applying DIDC to several benchmark problems, we show that DIDC has a good performance on high dimensional, multimodal, non-separable and ill-scaled problems. Finally, we show that the control parameter of DIDC has the same effect on the search with the number of generating children n c. (shrink)

The topology optimization of computer communication network is studied based on improved genetic algorithm, a network optimization design model based on the establishment of network reliability maximization under given cost constraints, and the corresponding improved GA is proposed. In this method, the corresponding computer communication network cost model and computer communication network reliability model are established through a specific project, and the genetic intelligence algorithm is used to solve the cost model and computer communication network reliability model, respectively. (...) It has been proved that GA can solve the complex problems of computer working environment better, which is 80% higher than the general algorithm, and can select the optimal scheme pertinently. (shrink)

This paper presents a GA-based multi-agent reinforce- ment learning bidding approach (GMARLB) for perform- ing multi-agent reinforcement learning. GMARLB inte- grates reinforcement learning, bidding and genetic algo- rithms. The general idea of our multi-agent systems is as follows: There are a number of individual agents in a team, each agent of the team has two modules: Q module and CQ module. Each agent can select actions to be performed at each step, which are done by the Q module. While (...) the CQ module determines at each step whether the agent should continue or relinquish control. Once an agent relinquishes its control, a new agent is selected by bidding algorithms. We applied GA-based GMARLB to the Backgammon game. The experimental results show GMARLB can achieve a su- perior level of performance in game-playing, outperforming PubEval, while the system uses zero built-in knowledge. (shrink)

Reinforcement Learning (RL) handles policy search problems: searching a mapping from state space to action space. However RL is based on gradient methods and as such, cannot deal with problems with multimodal landscape. In contrast, though Genetic Algorithm (GA) is promising to deal with them, it seems to be unsuitable for policy search problems from the viewpoint of the cost of evaluation. Minimal Generation Gap (MGG), used as a generation-alternation model in GA, generates many offspring from two or more (...) parents selected from a population. Therefore, evaluating policies of generated offspring requires much trial and error (i.e. interaction between an agent and an environment). In this paper, we incorporate importance sampling into the framework of MGG in order to reduce the cost of evaluation on policy search. The proposed techniques are applied to Markov Decision Process (MDP) with multimodal landscape. The experimental results show that these techniques can reduce the number of interaction between an agent and an environment, and also mean that MGG and importance sampling are good for each other. (shrink)

This paper presents a new method that improves robustness of real-coded Genetic Algorithm (GA) for function optimization. It is reported that most of crossover operators for real-coded GA have sampling bias, which prevents to find the optimum when it is near the boundary of search space. They like to search the center of search space much more than the other. Therefore, they will not work on functions that have their optima near the boundary of the search space. Although several (...) methods have been proposed to relax this sampling bias, they could not cancel whole bias. In this paper, we propose a new method, Toroidal Search Space Conversion (TSC), to remove this sampling bias. TSC converts bounded search space into toroidal one without any parameter. Experimental results show that a GA with TSC has higher performance to find the optimum near the boundary of search space and the GA has more robustness concerning the relative position of the optimum. (shrink)

Artificial Immune Systems (AIS) are intelligent algorithms derived on the principles inspired by human immune system. In this research work, electroencephalography (EEG) signals for four distinct motor movement of human limbs are detected and classified using Negative Selection Classification Algorithm (NSCA). For this study, a widely studied open source EEG signal database (BCI IV - Graz dataset 2a, comprising 9 subjects) has been used. Mel Frequency Cepstral Coefficients (MFCCs) are extracted as selected feature from recorded EEG signals. Dimensionality reduction (...) of data is carried out by applying two hidden layered stacked auto-encoder. Genetic Algorithm (GA) optimized detectors (Artificial Lymphocytes) are trained using Negative Selection Algorithm (NSA) for detection and classification of four motor movements. The trained detectors consist of four sets of detectors, each set is trained for detection and classification of one of the four movements from the other three movements. The optimized radius of detector is small enough not to mis-detect the sample. Euclidean distance of each detector with every training dataset sample is taken and compared with optimized radius of detector as a non-self detector. Our proposed approach achieved a mean classification accuracy of 86.39% for limb movements over 9 subjects with a maximum individual subject classification accuracy of 97.5 % for subject number eight. (shrink)

The Genetic Algorithm (GA) and Simulated Annealing (SA), two techniques for global optimization, were applied to a reduced (simplified) form of the phase problem (RPP) in computational crystallography. Results were compared with those of "enhanced pair flipping" (EPF), a more elaborate problem-specific algorithm incorporating local and global searches. Not surprisingly, EPF did better than the GA or SA approaches, but the existence of GA and SA techniques more advanced than those used in this study suggest that these techniques still (...) hold promise for phase problem applications. The RPP is, furthermore, an excellent test problem for such global optimization methods. (shrink)

In this paper, we perform theoretical analysis and experiments on the Simplex Crossover (SPX), which we have proposed. Real-coded GAs are expected to be a powerful function optimization technique for real-world applications where it is often hard to formulate the objective function. However, we believe there are two problems which will make such applications difficult; 1) performance of real-coded GAs depends on the coordinate system used to express the objective function, and 2) it costs much labor to adjust parameters so (...) that the GAs always find an optimum point efficiently. The result of our theoretical analysis and experiments shows that a performance of SPX is independent of linear coordinate transformation and that SPX always optimizes various test function efficiently when theoretical value for expansion rate, which is a parameter of SPX, is applied. We also show that BLX-α is equivalent to degenerate form of SPX. Experiments show that we have something misunderstood effect of epistasis on performance degradation of real-coded GAs. (shrink)

This paper presents the Real-coded Genetic Algorithms(RCGA) which can treat with high-dimensional ill-scaled structures, what is called, k -tablet structure. The k -tablet structure is the landscape that the scale of the fitness function is different between the k -dimensional subspace and the orthogonal (n-k) -dimensional subspace. The search speed of traditional RCGAs degrades when high-dimensional k -tablet structures are included in the landscape of fitness function. In this structure, offspring generated by crossovers is likely to spread wider (...) region than the region where the parental population covers. This phenomenon causes the stagnation of the search. To resolve this problem, we propose a new crossover LUNDX- m, which uses only m -dimensional latent variables. The effectiveness of the proposal method is tested with several benchmark functions including k -tablet structures and we show that our proposal method performs better than traditional crossovers especially when the dimensionality n is higher than 100. (shrink)

Reinforcement learning has recently received much attention as a learning method for complicated systems, e.g., robot systems. It does not need prior knowledge and has higher capability of reactive and adaptive behaviors. However increase in dimensionality of the action-state space makes it diffcult to accomplish learning. The applicability of the existing reinforcement learning algorithms are effective for simple tasks with relatively small action-state space. In this paper, we propose a new reinforcement learning algorithm: “Q-learning with Dynamic Structuring of Exploration (...) Space Based on Genetic Algorithm ”. The algorithm is applicable to systems with high dimensional action and interior state spaces, for example a robot with many redundant degrees of freedom. To demonstrate the effectiveness of the proposed algorithm simulations of obstacle avoidance by a 50 links manipulator have been carried out. It is shown that effective behavior can be learned by using the proposed algorithm. (shrink)

Using the genetic algorithm and fuzzy logic, this study presents a nonlinear approach to the evaluation of biofunctional intelligence. According to the biofunctional model, intelligence may be viewed as a multisource phenomenon resulting in part from the interaction of learning processes and sources of self-regulation. Learning processes are regulated by three sources of control , producing three subprocesses for each learning process. This paper examines the role of five such subprocesses as contributors to intelligence. Fuzzy logic captures the fuzzy (...) nature of human intelligence with GA providing a method for determining and optimizing the contribution of these learning subprocesses. (shrink)

In order to better improve the teaching quality of university teachers, an effective method should be adopted for evaluation and analysis. This work studied the machine learning algorithms and selected the support vector machine (SVM) algorithm to evaluate teaching quality. First, the principles of selecting evaluation indexes were briefly introduced, and 16 evaluation indexes were selected from different aspects. Then, the SVM algorithm was used for evaluation. A genetic algorithm (GA)-SVM algorithm was designed and experimentally analyzed. It was (...) found that the training time and testing time of the GA-SVM algorithm were 23.21 and 7.25 ms, both of which were shorter than the SVM algorithm. In the evaluation of teaching quality, the evaluation value of the GA-SVM algorithm was closer to the actual value, indicating that the evaluation result was more accurate. The average accuracy of the GA-SVM algorithm was 11.64% higher than that of the SVM algorithm (98.36 vs 86.72%). The experimental results verify that the GA-SVM algorithm can have a good application in evaluating and analyzing teaching quality in universities with its advantages in efficiency and accuracy. (shrink)

Job-shop Scheduling Problem (JSP) is one of the most difficult benchmark problems. GA approaches often fail searching the global optimum because of the deception UV-structure of JSPs. In this paper, we introduce a novel framework model of GA, Innately Split Model (ISM) which prevents UV-phenomenon, and discuss on its power particularly. Next we analyze the structure of JSPs with the help of the UV-structure hypothesys, and finally we show ISM's excellent performance on JSP.

This paper investigates the Generalized Traveling Salesman Problem (GTSP), which is an extension of the well-known Traveling Salesman Problem (TSP), and it searches for an optimal tour in a clustered graph, such that every cluster is visited exactly once. In this paper, we describe a novel Memetic Algorithm (MA) for solving efficiently the GTSP. Our proposed MA has at its core a genetic algorithm (GA), completed by a Chromosome Enhancement Procedure (CEP), which is based on a TSP solver and (...) the Shortest Path (SP) algorithm and for improving the convergence characteristics of the GA, a Local Search (LS) operation is applied for the best chromosomes in each generation. We tested our algorithm on a set of well-known instances from the literature and the achieved results prove that our novel memetic algorithm is highly competitive against the existing solution approaches from the specialized literature. (shrink)

A model predictive control method based on recursive backpropagation neural network and genetic algorithm is proposed for a class of nonlinear systems with time delays and uncertainties. In the offline modeling stage, a multistep-ahead predictor with GA-RBP neural network is designed, where GA-BP neural network is used as a one-step prediction model and GA is employed to train the initial weights and bias of the BP neural network. The incorporation of GA into RBP can reduce the possibility of the (...) BP neural network falling into a local optimum instead of reaching global optimization. In the online optimizing stage, a multistep-ahead GA-RBP neural network predictor and an improved gradient descent method are proposed to efficiently solve the online optimization problem of nonlinear MPC by minimizing a modified quadratic criterion. The designed MPC strategy can avoid information loss while linearizing the controlled system and computing the Hessian matrix and its inverse matrix. Experimental results show that the proposed approach can reduce the computational burden and improve the performance of MPC for the solution of nonlinear controlled systems. (shrink)

As a brand-new marketing method, network marketing has gradually become one of the main ways and means for enterprises to improve profitability and competitiveness with its unique advantages. Using these marketing data to build a model can dig out useful information that the business is concerned about, and the company can then formulate marketing strategies based on this information. Sales forecasting is to speculate on the future based on historical sales. It is a tool for companies to determine production volume (...) and ensure the balance of product supply and sales. It can help companies make correct business decisions to maximize profits. The neural network can approximate the nonlinear function with arbitrary precision, and the time series prediction model based on the neural network can well reflect the nonlinear development trend of information. Based on the analysis of the shortcomings of the traditional BP network, this paper uses a genetic algorithm with good global search capabilities to improve the neural network. The thought and theory of optimizing the initial weight and threshold of the neural network of the GA algorithm are discussed in detail. While expounding the forecasting method, it uses specific examples to analyze the performance and characteristics of the GA-BP network in the enterprise network marketing forecasting. The results show that the GA-BP neural network is higher than the traditional BP neural network in terms of prediction accuracy and adaptability. (shrink)

We propose a new Real-coded GA(RCGA) using the combination of two crossovers, UNDX-m and EDX. The search region of UNDX-m is biased to the inside area that the population of the RCGA covers. Because of this search bias, the GA using UNDX-m causes stagnation of its search if the cost function has a kind of structure, so called, a ridge structure or a multiple-peak structure. In order to overcome this stagnation, we propose a new crossover EDX, whose search is biased (...) toward extrapolative one. Experimental results show that RCGA with EDX can deal with both ridge-structure function whose dimension reaches more than hundreds and multiple-peak function whose optimum resides at the corner of the search area. (shrink)

In this paper, we propose an extension of the Minimal Generation Gap (MGG) to reduce the number of fitness evaluation for the real-coded GAs (RCGA). When MGG is applied to actual engineering problems, for example applied to optimization of design parameters, the fitness calculating time is usually huge because MGG generates many children from one pair of parents and the fitness is calculated by repetitive simulation or analysis. The proposed method called Saving MGG reduces the number of fitness evaluation by (...) estimating the promising degrees of children using individual distribution and fitness information of population, and selecting children based on the promising degree before evaluating the fitness. Experimental results show that RCGA with Saving MGG can provide large reducing effects on 20 or 30 dimensional Sphere functions, Rosenbrock functions, ill-scaled Rosenbrock functions, and Rastrigin function. (shrink)

In this article, an in-depth study and analysis of economic structure are carried out using a neural network fusion release algorithm. The method system defines the weight space and structure space of neural networks from the perspective of optimization theory, proposes a bionic optimization algorithm under the weight space and structure space, and establishes a neuroevolutionary method with shallow neural network and deep neural network as the research objects. In the shallow neuroevolutionary, the improved genetic algorithm based on elite (...) heuristic operation and migration strategy and the improved coyote optimization algorithm based on adaptive influence weights are proposed, and the shallow neuroevolutionary method based on IGA and the shallow neuroevolutionary method based on ICOA are applied to the weight space of backpropagation neural networks. In deep neuroevolutionary method, the structure space of convolutional neural network is proposed to solve the search space design of neural structure search, and the GA-based deep neuroevolutionary method under the structure space of convolutional neural network is proposed to solve the problem that numerous hyperparameters and network structure parameters can produce explosive combinations when designing deep learning models. The neural network fusion bionic algorithm used has the application value of exploring the spatial structure and dynamics of the socioeconomic system, improving the perception of the socioeconomic situation, and understanding the development law of society, etc. The idea is also verifiable through the present computer technology. (shrink)

Demodulating harmful nodes and diminishing the energy waste in sensor nodes can prolong the lifespan of wireless sensor networks. In this study, a genetic algorithm and an adaptive neuro fuzzy inference system were used to diminish the energy waste of sensors. Weighted trust evaluation was applied to search for harmful nodes in the network to prolong the lifespan of WSNs. A low-energy adaptive clustering hierarchy method was used to analyze the results. It was discovered that searching for harmful nodes (...) with GA-ANFIS using weighted trust evaluation significantly increased the lifespan of WSNs. For evaluation of the proposed method we used the mean of energy of all sensors against of the round, data packets received in base station, minimum energy versus rounds and number of alive sensors versus rounds. Also, in this paper we compared the proposed method results with LEACH, LEACH-DT, Random, SIF and GA-Fuzzy methods. As results the proposed method has high life time than other methods. A representation of the overall system was implemented using MATLAB software. (shrink)

Control of the population diversity in genetic algorithms applied to the protein structure prediction problem. Genetic Algorithms (GAs), a successful approach for optimization problems, usually fail when employed in the standard configuration in the protein structure prediction problem, since the solution space is very large and the population converges before a reasonable percentage of the possible solutions is explored. Thus, this work investigates the effect of increasing the diversity of the population on this problem by using (...) Hypermutation and Random Immigrants, two traditional population diversity control schemes, in the structure prediction of the proteins Crambin (PDB 1CRN), Met-Enkephalin (PDB 1PLW), and DNA-Ligand (PDB 1ENH). Results show a significant reduction of the minimal energy found, thanks to the diversity, but this does not necessarily means a higher similarity to the original structure.(Portuguese). (English) Copyright of Scientia is the property of Universidade do Vale do Rio dos Sinos and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (shrink)

Evolutionary computation has been applied to numerous design tasks, including design of electric circuits, neural networks, and genetic circuits. Though it is a very effective solution for optimizing network structures, genetic algorithm faces many difficulties, often referred to as the permutation problems, when both topologies and the weights of the network are the target of optimization. We propose a new crossover method used in conjunction with a genotype with information tags. The information tags allow GA to recognize and (...) preserve the common structure of parent chromosomes during genetic crossover. The method is implemented along with subpopulating strategies to make the parallel evolution of network topology and weights feasible and efficient. The proposed method is evaluated on a few typical and practical problems, and shows improvement from conventional methodologies and genotypes. (shrink)

Biologically inspired Evolution Algorithms, that use individuals as searching points and progress search by evolutions or adaptations of the individuals, are widely applied to many optimization problems. Many real world problems, which could be transformed to optimization problems, are very often difficult because the problems have complex landscapes that are multimodal, epistatic and having strong local minima. Current real-coded genetic algorithms could solve high-dimensional multimodal functions, but could not solve strong deceptive functions. Niching GAs are applied to (...) low-dimensional multimodal functions by maintaining diversity of searching population, but could not be applicable to highdimensional functions. In order to optimize high dimensional deceptive multimodal functions, we propose a new EA called Adaptive Neighboring Search, that is structured with a selection for reproduction by restricting mating individuals to neighbors, a crossover-like mutation using the mating individuals and an elitist selection for survival within one centered parent and its offsprings. By individualized generation alternation and complementary crossover-like mutation, the ANS realizes self-distributive and locally adaptive search, and individuals in the search divide into plural promising valleys and converge within same valley. The ANS is applicable to high dimensional deceptive multimodal function optimization, because the feature is independent of number of problem’s dimensions. By applying to high dimensional Fletcher and Powell function as a deceptive multimodal one, we show the ANS can obtain various solutions and several optimal solutions in high probability. (shrink)

This paper describes a method for optimal hypothesis search in Inductive Logic Programming. The method is based on symbiotic evolution, a variant of genetic algorithm, for improving the predictive accuracy in classifying unknown examples. Progol, the representative ILP system, employs a refinement operator and finds an optimal hypothesis which subsumes the most specific hypothesis. Progol focuses on a hypothesis which has maximum explanatory power for training data. However, ILP systems should be evaluated by their explanatory powers for unknown data. (...) In contrast, the proposed method produces a hypothesis using symbiotic evolution, which maintains and evolves two populations: a population of partial solutions to the problem and a population of complete solutions which are formed by grouping several partial solutions together. Symbiotic evolution can conduct balanced optimization of partial solutions and complete solutions. We postulate that the diversity of the results in GA increases the fitness to unknown data. We have developed an ILP system called ILP/SE, which uses symbiotic evolution for the hypothesis search task and uses the learning algorithm of Progol for the other task. ILP/SE judges the class of unknown data by majority using multiple hypothesises obtained in repeated execution. Experiments were conducted to show the performance of ILP/SE using the mutagenesis dataset. The result indicates that the ILP/SE approach outperforms the previous method using Progol for classification accuracy. (shrink)

Offshore micro integrated energy systems are the basis of offshore oil and gas engineering and play an important role in developing and utilizing marine resources. By introducing offshore wind power generation, the carbon emissions of offshore micro integrated energy systems can be effectively reduced; however, greater challenges have been posted to the reliable operation due to the uncertainty. To reduce the influence brought by the uncertainty, a multiobjective optimization model was proposed based on the chance-constrained programming ; the operating cost (...) and penalty cost of natural gas emission were selected as objectives. Then, the improved hybrid constraints handling strategy based on nondominated sorting genetic algorithm II was introduced to solve the model efficiently. Finally, the numerical studies verified the efficiency of the proposed algorithm, as well as the validity and feasibility of the proposed model in improving the economy of OMIES under uncertainty. (shrink)

Predicting suspended sediment load in water resource management requires efficient and reliable predicted models. This study considers the support vector regression method to predict daily suspended sediment load. Since the SVR has unknown parameters, the observer-teacher-learner-based Optimization method is integrated with the SVR model to provide a novel hybrid predictive model. The SVR combined with the genetic algorithm is used as an alternative model. To explore the performance and application of the proposed models, five input combinations of rainfall and (...) discharge data of Cham Siah River catchment are provided. The predictive models are assessed using various numerical and visual indicators. The results indicate that the SVR-OTLBO model offers a higher prediction performance than other models employed in the current study. Specifically, SVR-OTLBO model offers highest Pearson correlation coefficient, Willmott’s Index, ratio of performance to IQ, and modified index of agreement and the lowest relative root mean square error in comparison with SVR-GA and SVR models, respectively. (shrink)

Accurate and reliable prediction of Perfobond Rib Shear Strength Connector is considered as a major issue in the structural engineering sector. Besides, selecting the most significant variables that have a major influence on PRSC in every important step for attaining economic and more accurate predictive models, this study investigates the capacity of deep learning neural network for shear strength prediction of PRSC. The proposed DLNN model is validated against support vector regression, artificial neural network, and M5 tree model. In the (...) second scenario, a comparable AI model hybridized with genetic algorithm as a robust bioinspired optimization approach for optimizing the related predictors for the PRSC is proposed. Hybridizing AI models with GA as a selector tool is an attempt to acquire the best accuracy of predictions with the fewest possible related parameters. In accordance with quantitative analysis, it can be observed that the GA-DLNN models required only 7 input parameters and yielded the best prediction accuracy with highest correlation coefficient and lowest value root mean square error. However, the other comparable models such as GA-M5Tree, GA-ANN, and GA-SVR required 10 input parameters to obtain a relatively acceptable level of accuracy. Employing GA as a feature parameter selection technique improves the precision of almost all hybrid models by optimally removing redundant variables which decrease the efficiency of the model. (shrink)

A computer-based age estimation is a technique that predicts an individual's age based on visual traits derived by analyzing a 2D picture of the individual's face. Age estimation is critical for access control, e-government, and effective human–computer interaction. The other-race effect has the potential to cause techniques designed for white faces to underperform when used in a region with black faces. The outcome is the consequence of intermittent training with faces of the same race and the encoding structure of the (...) trained face images, which is based on the feature extraction technique used. This study contributes to a constructive comparison of three feature-extraction techniques, namely, local binary pattern, Gabor Wavelet, and wavelet transformation, used in the development of a genetic algorithm -artificial neural network -based age estimation system. The feature extraction techniques used are proven to produce a wealth of shape and textural information. The GA-ANN constitutes the age classifier module. The correct classification rate was chosen as the performance metrics in this study. The results demonstrated that the LBP is a more robust representation of the black face than the GW and Wavelet transformations, as evidenced by its accuracy rate of 91.76 compared to 89.41 and 84.71 achieved with the GW and Wavelet transformation age estimation systems, respectively. (shrink)

Function optimization underlies many real-world problems and hence is an important research subject. Most of the existing optimization methods were developed to solve primarily unconstrained problems. Since real-world problems are often constrained, appropriate handling of constraints is necessary in order to use the optimization methods. In particular, the performances of some methods such as Genetic Algorithms can be substantially undermined by ineffective constraint handling. Despite much effort devoted to the studies of constraint-handling methods, it has been reported that (...) each of them has certain limitations. Hence, further studies for designing more effective constraint-handling methods are needed. For this reason, we investigated the guidelines for a method to effectively handle constraints. The guidelines are that the method 1) takes the approach of repair operators, 2) monotonically decreases both the number of violated constraints and constraint violations, and 3) searches over the boundaries of violated constraints. Based on these guidelines, we designed a new constraint-handling method Pareto Descent Repair operator in which ideas derived from multi-objective local search and gradient projection method are incorporated. Experiments comparing GA that use PDR and some of the existing constraint-handling methods confirmed the effectiveness of PDR. (shrink)

This paper presents a kernel density estimation method by means of real-coded crossovers. Functions of real-coded crossover operators are composed of probabilistic density estimation from parental populations and sampling from estimated models. Real-coded Genetic Algorithm (RCGA) does not explicitly estimate probabilistic distributions, however, probabilistic model estimation is implicitly included in algorithms of real-coded crossovers. Based on this understanding, we exploit the implicit estimation of probabilistic distribution of crossovers as a kernel density estimator. We also propose an application of (...) crossover kernels to Expectation-Maximization estimation (EM) of Gaussian mixtures. (shrink)