Appropriate Combination of Crossover Operator and Mutation Operator in Genetic Algorithms for the Travelling Salesman Problem

Genetic algorithms(GAs)are very good metaheuristic algorithms that are suitable for solving NP-hard combinatorial optimization problems.AsimpleGAbeginswith a set of solutions represented by a population of chromosomes and then uses the idea of survival of the fittest in the selection process to select some fitter chromosomes.It uses a crossover operator to create better offspring chromosomes and thus,converges the population.Also,it uses a mutation operator to explore the unexplored areas by the crossover operator,and thus,diversifies the GA search space.A combination of crossover and mutation operators makes the GA search strong enough to reach the optimal solution.However,appropriate selection and combination of crossover operator and mutation operator can lead to a very good GA for solving an optimization problem.In this present paper,we aim to study the benchmark traveling salesman problem(TSP).We developed several genetic algorithms using seven crossover operators and six mutation operators for the TSP and then compared them to some benchmark TSPLIB instances.The experimental studies show the effectiveness of the combination of a comprehensive sequential constructive crossover operator and insertion mutation operator for the problem.The GA using the comprehensive sequential constructive crossover with insertion mutation could find average solutions whose average percentage of excesses from the best-known solutions are between 0.22 and 14.94 for our experimented problem instances.

Tuning PID Parameters Based on a Combination of the Expert System and the Improved Genetic Algorithms

a new strategy combining an expert system and improved genetic algorithms is presented for tuning proportional-integral-derivative （PID） parameters for petrochemical processes. This retains the advantages of genetic algorithms, namely rapid convergence and attainment of the global optimum. Utilization of an orthogonal experiment method solves the determination of the genetic factors. Combination with an expert system can make best use of the actual experience of the plant operators. Simulation results of typical process systems examples show a good control performance and robustness.

Combining the genetic algorithms with artificial neural networks for optimization of board allocating

This paper introduced the Genetic Algorithms (GAs) and Artificial Neural Networks (ANNs), which have been widely used in optimization of allocating. The combination way of the two optimizing algorithms was used in board allocating of furniture production. In the experiment, the rectangular flake board of 3650 mm 1850 mm was used as raw material to allocate 100 sets of Table Bucked. The utilizing rate of the board reached 94.14 % and the calculating time was only 35 s. The experiment result proofed that the method by using the GA for optimizing the weights of the ANN can raise the utilizing rate of the board and can shorten the time of the design. At the same time, this method can simultaneously searched in many directions, thus greatly in-creasing the probability of finding a global optimum.

Topological optimization of ballistic protective structures through genetic algorithms in a vulnerability-driven environment

Reducing the vulnerability of a platform,i.e.,the risk of being affected by hostile objects,is of paramount importance in the design process of vehicles,especially aircraft.A simple and effective way to decrease vulnerability is to introduce protective structures to intercept and possibly stop threats.However,this type of solution can lead to a significant increase in weight,affecting the performance of the aircraft.For this reason,it is crucial to study possible solutions that allow reducing the vulnerability of the aircraft while containing the increase in structural weight.One possible strategy is to optimize the topology of protective solutions to find the optimal balance between vulnerability and the weight of the added structures.Among the many optimization techniques available in the literature for this purpose,multiobjective genetic algorithms stand out as promising tools.In this context,this work proposes the use of a in-house software for vulnerability calculation to guide the process of topology optimization through multi-objective genetic algorithms,aiming to simultaneously minimize the weight of protective structures and vulnerability.In addition to the use of the in-house software,which itself represents a novelty in the field of topology optimization of structures,the method incorporates a custom mutation function within the genetic algorithm,specifically developed using a graph-based approach to ensure the continuity of the generated structures.The tool developed for this work is capable of generating protections with optimized layouts considering two different types of impacting objects,namely bullets and fragments from detonating objects.The software outputs a set of non-dominated solutions describing different topologies that the user can choose from.

Fuzzy inference system using genetic algorithm and pattern search for predicting roof fall rate in underground coal mines

One of the most dangerous safety hazard in underground coal mines is roof falls during retreat mining.Roof falls may cause life-threatening and non-fatal injuries to miners and impede mining and transportation operations.As a result,a reliable roof fall prediction model is essential to tackle such challenges.Different parameters that substantially impact roof falls are ill-defined and intangible,making this an uncertain and challenging research issue.The National Institute for Occupational Safety and Health assembled a national database of roof performance from 37 coal mines to explore the factors contributing to roof falls.Data acquired for 37 mines is limited due to several restrictions,which increased the likelihood of incompleteness.Fuzzy logic is a technique for coping with ambiguity,incompleteness,and uncertainty.Therefore,In this paper,the fuzzy inference method is presented,which employs a genetic algorithm to create fuzzy rules based on 109 records of roof fall data and pattern search to refine the membership functions of parameters.The performance of the deployed model is evaluated using statistical measures such as the Root-Mean-Square Error,Mean-Absolute-Error,and coefficient of determination(R_(2)).Based on these criteria,the suggested model outperforms the existing models to precisely predict roof fall rates using fewer fuzzy rules.

Solar Radiation Estimation Based on a New Combined Approach of Artificial Neural Networks (ANN) and Genetic Algorithms (GA) in South Algeria

When designing solar systems and assessing the effectiveness of their many uses,estimating sun irradiance is a crucial first step.This study examined three approaches(ANN,GA-ANN,and ANFIS)for estimating daily global solar radiation(GSR)in the south of Algeria:Adrar,Ouargla,and Bechar.The proposed hybrid GA-ANN model,based on genetic algorithm-based optimization,was developed to improve the ANN model.The GA-ANN and ANFIS models performed better than the standalone ANN-based model,with GA-ANN being better suited for forecasting in all sites,and it performed the best with the best values in the testing phase of Coefficient of Determination(R=0.9005),Mean Absolute Percentage Error(MAPE=8.40%),and Relative Root Mean Square Error(rRMSE=12.56%).Nevertheless,the ANFIS model outperformed the GA-ANN model in forecasting daily GSR,with the best values of indicators when testing the model being R=0.9374,MAPE=7.78%,and rRMSE=10.54%.Generally,we may conclude that the initial ANN stand-alone model performance when forecasting solar radiation has been improved,and the results obtained after injecting the genetic algorithm into the ANN to optimize its weights were satisfactory.The model can be used to forecast daily GSR in dry climates and other climates and may also be helpful in selecting solar energy system installations and sizes.

A Hybrid Genetic Algorithm for Reduct of Attributes in Decision System Based on Rough Set Theory

Knowledge reduction is an important issue when dealing with huge amounts of data. And it has been proved that computing the minimal reduct of decision system is NP-complete. By introducing heuristic information into genetic algorithm, we proposed a heuristic genetic algorithm. In the genetic algorithm, we constructed a new operator to maintaining the classification ability. The experiment shows that our algorithm is efficient and effective for minimal reduct, even for the special example that the simple heuristic algorithm can’t get the right result.

Application of a neural network system combined with genetic algorithm to rank coalbed methane reservoirs in the order of exploitation priority

A new method based on the combination of a neural network and a genetic algorithm was proposed to rank the order of exploitation priority of coalbed methane reservoirs. The neural network was used to acquire the weights of reservoir parameters through sample training and genetic algorithm was used to optimize the initial connection weights of nerve cells in case the neural network fell into a local minimum. Additionally, subordinate functions of each parameter were established to normalize the actual values of parameters of coalbed methane reservoirs in the range between zero and unity. Eventually, evaluation values of all coalbed methane reservoirs could be obtained by using the comprehensive evaluation method, which is the basis to rank the coalbed methane reservoirs in the order of exploitation priority. The greater the evaluation value, the higher the exploitation priority. The ranking method was verified in this paper by ten exploited coalbed methane reservoirs in China. The evaluation results are in agreement with the actual exploitation cases. The method can ensure the truthfulness and credibility of the weights of parameters and avoid the subjectivity caused by experts. Furthermore, the probability of falling into local minima is reduced, because genetic the algorithm is used to optimize the neural network system.

Genetic Algorithms for the Optimal Design of Electromagnetic Micro-Motors

The genetic algorithm (GA) to the design of electromagnetic micro motor to optimize parameter design. Besides the different oversize from macro motor, the novel structure of micro motor which the rotor is set between the two stators make its design different, too. There are constraint satisfaction problems CSP) in the design. It is shown that the use GA offers a high rate of global convergence and the ability to get the optimal design of electromagnetic micro motors.

Comparative study of kinetic modeling for the oxidative coupling of methane by genetic and marquardt algorithms

Overall kinetic studies on the oxidative coupling of methane,OCM,have been conducted in a tubular fixed bed reactor,using perovskite titanate as the reaction catalyst.The appropriate operating conditions were found to be：temperature 750-775 ℃,total feed flow rate of 160 ml/min,CH4 /O2 ratio of 2 and GHSV of 100·min-1 .Under these conditions,C 2 yield of 28% was achieved.Correlations of the kinetic data have been performed with lumped rate equations for C2 and COx formation as functions of temperature,O2 and CH4 partial pressures.Six models have been selected among the common lumped kinetic models.The selected models have been regressed with the experimental data which were obtained from the Catatest system by genetic algorithm in order to obtain optimized parameters.The kinetic coefficients in the overall reactions were optimized by different numerical optimization methods such as：the Levenberg-Marquardt and genetic algorithms and the results were compared with one another.It has been found that the Santamaria model is in good agreement with the experimental data.The Arrhenius parameters of this model have been obtained by linear regression.It should be noted that the Marquardt algorithm is sensitive to the first guesses and there is possibility to trap in the relative minimum.

Analysis of the diversity of population and convergence of genetic algorithms based on Negentropy

With its wide use in different fields, the problem of the convergence of simple genetic algorithms (GAs) has been concerned. In the past, the research on the convergence of GAs was based on Holland's model theorem. The diversity of the evolutionary population and the convergence of GAs are studied by using the concept of negentropy based on the discussion of the characteristic of GA. Some test functions are used to test the convergence of GAs, and good results have been obtained. It is shown that the global optimization may be obtained by selecting appropriate parameters of simple GAs if the evolution time is enough.

Application of Genetic Algorithms in Identification ofLinear Time-Varying System

By applying genetic algorithms (GA) to on-line identification of linear time-varying systems; a number of modifications are made to the Simple Genetic Algorithm to improve the performance of the algorithm in identification applications. The simulation results indicate that the method is not only capable of following the changing parameters of the system, but also has improved the identification accuracy compared with that using the least square method.

Simultaneous scheduling of machines and automated guided vehicles in flexible manufacturing systems using genetic algorithms

The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain independent general purpose GA was used,which was an add-in to the spreadsheet software.An adaptation of the propritary GA software was demonstrated to the problem of minimizing the total completion time or makespan for simultaneous scheduling of machines and vehicles in flexible manufacturing systems.Computational results are presented for a benchmark with 82 test problems,which have been constructed by other researchers.The achieved results are comparable to the previous approaches.The proposed approach can be also applied to other problems or objective functions without changing the GA routine or the spreadsheet model.

Forecasting and Evaluating the Efficiency of Test Generation Algorithms by Genetic Algorithm

To generate a test set for a given circuit (including both combinational and sequential circuits), choice of an algorithm within a number of existing test generation algorithms to apply is bound to vary from circuit to circuit. In this paper, the genetic algorithms are used to construct the models of existing test generation algorithms in making such choice more easily. Therefore, we may forecast the testability parameters of a circuit before using the real test generation algorithm. The results also can be used to evaluate the efficiency of the existing test generation algorithms. Experimental results are given to convince the readers of the truth and the usefulness of this approach.

DETERMINING THE STRUCTURES AND PARAMETERS OF RADIAL BASIS FUNCTION NEURAL NETWORKS USING IMPROVED GENETIC ALGORITHMS

The method of determining the structures and parameters of radial basis function neural networks(RBFNNs) using improved genetic algorithms is proposed. Akaike′s information criterion (AIC) with generalization error term is used as the best criterion of optimizing the structures and parameters of networks. It is shown from the simulation results that the method not only improves the approximation and generalization capability of RBFNNs ,but also obtain the optimal or suboptimal structures of networks.

Correcting the systematic error of the density functional theory calculation:the alternate combination approach of genetic algorithm and neural network

The alternate combinational approach of genetic algorithm and neural network （AGANN） has been presented to correct the systematic error of the density functional theory （DFT） calculation. It treats the DFT as a black box and models the error through external statistical information. As a demonstration, the ACANN method has been applied in the correction of the lattice energies from the DFT calculation for 72 metal halides and hydrides. Through the AGANN correction, the mean absolute value of the relative errors of the calculated lattice energies to the experimental values decreases from 4.93% to 1.20% in the testing set. For comparison, the neural network approach reduces the mean value to 2.56%. And for the common combinational approach of genetic algorithm and neural network, the value drops to 2.15%. The multiple linear regression method almost has no correction effect here.

SELECTION OF OBJECTIVE FUNCTIONS AND APPLICATION OF GENETIC ALGORITHMS IN DAMPING DESIGN OF PIPE SYSTEM

The vibration failure of pipe system of aeroengine seriously influences the safety of aircraft.Its damping design is determined by the selection of the design target,method and their feasibility.Five objective functions for the vibration design of a pipeline or pipe system are introduced,namely,the frequency,amplitude,transfer ratio,curvature and deformation energy as options for the optimization process.The genetic algorithms(GA)are adopted as the opti- mization method,in which the selection of the adaptive genetic operators and the method of implementation of the GA process are crucial.The optimization procedure for all the above ob- jective functions is carried out using GA on the basis of finite element software-MSC/NASTRAN. The optimal solutions of these functions and the stress distribution on the structure are calculated and compared through an example,and their characteristics are analyzed.Finally we put forward two new objective functions,curvature and deformation energy for pipe system optimization.The calculations show that using the curvature as the objective function can reflect the case of minimal stress,and the optimization results using the deformation energy represent lesser and more uni- form stress distribution.The calculation results and process showed that the genetic algorithms can effectively implement damping design of engine pipelines and satisfy the efficient engineering design requirement.

Understanding the Nature of Predatory Pricing in Large-Scale Market Economy with Genetic Algorithms

In this paper the nature of predatory pricing is analyzed with genetic algorithms. It is found that, even under the same payoff structure, the results of the coevolution of weak monopolists and entrants are sensitive to the representationof the decisionmaking process. Two representations are studied in this paper. One is the actionbased representation and the other the strategybased representation. The former is to represent a naive mind and the latter is to capture a sophisticated mind. For the actionbased representation, the convergence results are easily obtained and predatory pricing is only temporary in all simulations. However, for the strategybased representation, predatory pricing is not a rare phenomenon and its appearance is cyclical but not regular. Therefore, the snowball effect of a little craziness observed in the experimental game theory wins its support from this representation. Furthermore, the nature of predatory pricing has something to do with the evolution of the sophisticated rather than the naive minds.

Stabilization of Chaotic Time Series by Proportional Pulse in the System Variable Based on Genetic Algorithm

The PPSV (Proportional Pulse in the System Variable) algorithm is a convenient method for the stabilization of the chaotic time series. It does not require any previous knowledge of the system. The PPSV method also has a shortcoming, that is, the determination off. is a procedure by trial and error, since it lacks of optimization. In order to overcome the blindness, GA (Genetic Algorithm), a search algorithm based on the mechanics of natural selection and natural genetics, is used to optimize the λi The new method is named as GAPPSV algorithm. The simulation results show that GAPPSV algorithm is very efficient because the control process is short and the steady-state error is small.

Using Genetic Algorithms to Improve the Search of the Weight Space in Cascade－Correlation Neural Network

In this paper, we use the global search characteristics of genetic algorithms to help search the weight space of the neurons in the cascade-correlation architecture. The cascade-correlation learning architecture is a technique of training and building neural networks that starts with a simple network of neurons and adds additional neurons as they are needed to suit a particular problem. In our approach, instead ofmodifying the genetic algorithm to account for convergence problems, we search the weight-space using the genetic algorithm and then apply the gradient technique of Quickprop to optimize the weights. This hybrid algorithm which is a combination of genetic algorithms and cascade-correlation is applied to the two spirals problem. We also use our algorithm in the prediction of the cyclic oxidation resistance of Ni- and Co-base superalloys.