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.

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)

Schedule planning is one of the most crucial issues for any airline company, because the profit of the company directly depends on the efficiency of the schedule. This paper presents a novel scheduling method which solves problems related to time scheduling, fleet assignment and maintenance routing simultaneously by Genetic Algorithms. Every schedule constraint is embeded in the fitness function, which is described as an object oriented model and works as a simulater developing itself over time, and whose solution is (...) executable without human correction. The schedular is able to solve the problems involving several hundred flights in a few hours, and the solutions are superior or equivalent to those by human experts in terms of the estimated profit. (shrink)

Shane Harwood and Richard Scheines. Genetic Algorithm Search Over Causal Models.

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 paper introduce a new variant of the Genetic Algorithm whichis developed to handle multivariable, multi-objective and very high search space optimization problems like the solving system of non-linear equations. It is an integer coded Genetic Algorithm with conventional cross over and mutation but with Inverse algorithm is varying its search space by varying its digit length on every cycle and it does a fine search followed by a coarse search. And its solution to the (...) optimization problem will converge to precise value over the cycles. Every equation of the system is considered as a single minimization objective function. Multiple objectives are converted to a single fitness function by summing their absolute values. Some difficult test functions for optimization and applications are used to evaluate this algorithm. The results prove that this algorithm is capable to produce promising and precise results. (shrink)

The Vehicle Routing Problem (VRP) has been extensively studied by different researchers from all over the world in recent years. Multiple solutions have been proposed for different variations of the problem, such as Capacitive Vehicle Routing Problem (CVRP), Vehicle Routing Problem with Time Windows (VRP-TW), Vehicle Routing Problem with Pickup and Delivery (VRPPD), among others, all of them with deterministic times. In the last years, researchers have been interested in including in their different models the variations that travel times may (...) experience when exposed to all kind of phenomena, mainly vehicle traffic. This article addresses the VRP from this perspective, proposing the design and implementation of a genetic algorithm based on neutrosophic theory for calculating the fitness function of each route, considering the variability and uncertainty present in travel times. A deterministic genetic algorithm is also implemented with the average travel times to compare it with the neutrosophic algorithm using simulation. As conclusion, a deterministic algorithm does not necessarily generate the best solution in the real world, full of uncertainty. Also, the quantification of uncertainty using neutrosophic theory can be used in route planning, opening a broad and interesting field of research for future investigations. (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 paper is about representations for Artificial Intelligence systems. All of the results described in it involve engineering the representation to make AI systems more effective. The main AI techniques studied here are varieties of search: path-finding in graphs, and probablilistic searching via simulated annealing and genetic algorithms. The main results are empirical findings about the granularity of representation in implementations of genetic algorithms. We conclude by proposing a new algorithm, called “Long-Term Evolution,” which is a (...) class='Hi'>genetic algorithm running on an evolving problem description. We see this as modelling the evolution of a species from simpler (more coarsely described— fewer genes) types of organisms to more complex ones. The results, which are reported here of our experiments with the algorithm make it seem a promising optimisation technique. (shrink)

The heuristic search processes like simple genetic algorithms help in achieving optimization but do not guarantee robustness so there is an immediate need of a machine learning technique that also promises robustness. Diploid genetic algorithms ensure consistent results and can therefore replace Simple genetic algorithms in applications such as test data generation and regression testing, where robustness is more important. However, there is a need to review the work that has been done so far in the field. (...) It is also important to analyse the applicability of the premise of the dominance techniques applied so far in order to implement the technique. The work presents a systematic review of diploid genetic algorithms, examines the premise of the dominance relation used in different works and discusses the future scope. The work also discusses the biological basis of evaluating dominance. The work is important as the future of machine learning relies on techniques that are robust as well as efficient. (shrink)

A crucial question for artificial cognition systems is what meaning is and how it arises. In pursuit of that question, this paper extends earlier work in which we show that emergence of simple signaling in biologically inspired models using arrays of locally interactive agents. Communities of "communicators" develop in an environment of wandering food sources and predators using any of a variety of mechanisms: imitation of successful neighbors, localized genetic algorithms and partial neural net training on successful neighbors. Here (...) we focus on environmental variability, comparing results for environments with (a) constant resources, (b) random resources, and (c) cycles of "boom and bust." In both simple and complex models across all three mechanisms of strategy change, the emergence of communication is strongly favored by cycles of "boom and bust." These results are particularly intriguing given the importance of environmental variability in fields as diverse as psychology, ecology and cultural anthropology. (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 the application of the standard genetic algorithm in illustration art design, there are still problems such as low search efficiency and high complexity. This paper proposes an illustration art design model based on operator and clustering optimization genetic algorithm. First, during the operation of the genetic algorithm, the values of the crossover probability and the mutation probability are dynamically adjusted according to the characteristics of the population to improve the search efficiency of the (...) algorithm, then the k-medoids algorithm is introduced to optimize the clustering of the genetic algorithm, and a cost function is used to carry out and evaluate the quality of clustering to optimize the complexity of the original algorithm. In addition, a multiobjective optimization genetic algorithm with complex constraints based on group classification is proposed. This algorithm focuses on the problem of group diversity and uses k-means cluster analysis operation to solve the problem of group diversity. The algorithm divides the entire group into four subgroups and assigns appropriate fitness values to reflect the optimal preservation strategy. A large number of computer simulation calculations show that the algorithm can obtain a widely distributed and uniform Pareto optimal solution, the evolution speed is fast, usually only a few iterations can achieve a good optimization effect, and finally the improved genetic algorithm is used to design the random illustration art. The example simulation shows that the improved algorithm proposed in this paper can achieve higher artistic and innovative illustration art design. (shrink)

The paper discusses the problem of assignment production resources in executing a production order on the example of the car rims manufacturing process. The more resources are involved in implementing the manufacturing process and the more they can be used interchangeably, the more complex and problematic the scheduling process becomes. Special attention is paid to the effective scheduling and assignment of rim machining operations to production stations in the considered manufacturing process. In this case, the use of traditional scheduling methods (...) based on simple calculations, or the know-how of process engineers often turns out to be insufficient to achieve the intended results. Due to the scale of the problems faced in practice, the methods based on approximate approaches (Genetic and Tabu Search) were used to solve them. In this perspective, the problem under consideration involves the extension of the classic assignment problem with the possibility of taking into account: the times of operations, potential changeovers and the capacity of production resources. (shrink)

Due to the huge amount of data being generating from different sources, the analyzing and extracting of useful information from these data becomes a very complex task. The difficulty of dealing with big data optimization problems comes from many factors such as the high number of features, and the existing of lost data. The feature selection process becomes an important step in many data mining and machine learning algorithms to reduce the dimensionality of the optimization problems and increase the performance (...) of the classification or clustering algorithms. In this paper, a set of hybrid and efficient genetic algorithms are proposed to solve feature selection problem, when the handled data has a large feature size. The proposed algorithms use a new gene-weighted mechanism that can adaptively classify the features into strong relative features, weak or redundant features, and unstable features during the evolution of the algorithm. Based on this classification, the proposed algorithm gives the strong features high priority and the weak features less priority when generating new candidate solutions. In the same time, the proposed algorithm tries to more concentrate on unstable features that sometimes appear and sometimes disappear from the best solutions of the population. The performance of proposed algorithms is investigated by using different datasets and feature selection algorithms. The results show that our proposed algorithms can outperform the other feature selection algorithms and effectively enhance the classification performance over the tested datasets. (shrink)

Evolution is often characterized as a tinkerer that creates efficient but messy solutions to problems. We analyze the nature of the problems that arise when we try to explain and understand cognitive phenomena created by this haphazard design process. We present a theory of explanation and understanding and apply it to a case problem – solutions generated by genetic algorithms. By analyzing the nature of solutions that genetic algorithms present to computational problems, we show that the reason for (...) why evolutionary designs are often hard to understand is that they exhibit non-modular functionality, and that breaches of modularity wreak havoc on our strategies of causal and constitutive explanation. (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)

The coaxiality and unbalance are the two important indexes to evaluate the assembly quality of an aeroengine. It often needs to be tested and disassembled repeatedly to meet the double-objective requirements at the same time. Therefore, an intelligent assembly method is urgently needed to directly predict the optimal assembly orientations of the rotors at each stage to meet the double-objective requirements simultaneously. In this study, an assembly optimization method for the multistage rotor of an aeroengine is proposed based on the (...) genetic algorithm. Firstly, a spatial location propagation model is developed to accurately predict the spatial position of each rotor after assembly. The alignment process of the assembly screw holes of the adjacent rotors is considered for the first time. Secondly, a new assembly optimization strategy is proposed to select different assembly data for the specific values of the coaxiality and unbalance, respectively. Finally, a double-objective fitness function is constructed based on the coaxiality and unbalance. The simulation and experimental results show that the assembly optimization method proposed in this study can be utilized to achieve synchronous optimization of the coaxiality and unbalance of an aeroengine during preassembly. (shrink)

The potential of the soil to hold plant nutrients is governed by the cation-exchange capacity of any soil. Estimating soil CEC aids in conventional soil management practices to replenish the soil solution that supports plant growth. In this study, a multiple model integration scheme supervised with a hybrid genetic algorithm-neural network was developed and employed to predict the accuracy of soil CEC in Tabriz plain, an arid region of Iran. The standalone models and extreme learning machine ) were (...) implemented for incorporation into the MM-GANN. In addition, it was tested to enhance the prediction accuracy of the standalone models. The soil parameters such as clay, silt, pH, carbonate calcium equivalent, and soil organic matter were used as model inputs to predict soil CEC. With the use of several evaluation criteria, the results showed that the MM-GANN model involving the predictions of ELM and ANN models calibrated by considering all the soil parameters as inputs provided superior soil CEC estimates with a Nash Sutcliffe Efficiency = 0.87, Root Mean Square Error = 2.885, Mean Absolute Error = 2.249, Mean Absolute Percentage Error = 12.072, and coefficient of determination = 0.884. The proposed MM-GANN model is a reliable intelligence-based approach for the assessment of soil quality parameters intended for sustainability and management prospects. (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)

Since the opening of the economy, China’s regional economy has developed rapidly, the overall national strength has been increasing, and the people’s living standards have been continuously improved. The issue of coordinated regional development has become an important issue in today’s society. Genetic algorithm is a kind of prediction algorithm that has developed rapidly in recent years and is widely used. However, when solving engineering prediction problems, there are often problems such as premature convergence and easiness to (...) fall into local optimal solutions. Therefore, on the basis of studying the related theories of genetic algorithm and artificial immune algorithm, this paper uses the advantages of the two algorithms, combines the two algorithms, and proposes an improved algorithm for genetic algorithm-adaptive immune genetic algorithm. Taking genetic algorithm as the basic framework, the operators and selection methods of artificial immune algorithm are integrated. Using the adaptive concept, the formulas of adaptive crossover probability and mutation probability are innovatively designed. Compared with the fixed value of the immune genetic algorithm, the introduction of the adaptive concept can intelligently adjust the optimization process and increase the optimization speed. Considering the double uncertain factors of product market demand and waste product recycling in the remanufacturing supply chain system, the maximization of logistics network operating profit, the minimization of environmental impact, and the maximization of customer satisfaction are the forecast goals. The market demand of uncertain products is effectively controlled through the option contract mechanism, and a multiobjective forecasting model based on the option contract mechanism is established. According to the characteristics of the model, an improved immune genetic algorithm is designed to solve the problem, and the effectiveness of the immune genetic algorithm is verified through an example. (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)

Based on the problem of e-commerce logistics and distribution network optimization, this paper summarizes the solution ideas and solutions proposed by domestic and foreign scholars and designs a method to optimize the B2C e-commerce logistics and distribution network by taking into account the special traffic conditions in the city. The logistics network optimization model is established and solved by combining various methods. Taking into account the new target requirements constantly proposed in the modern logistics environment, the vehicle path problem under (...) the generalized objective function is studied, and the multidimensional impact maximization problem in this type of problem is proposed and modeled. The problem follows from the path planning for emergency material delivery. Given locations, roads, and multiple classes of supplies in a map, each road allows vehicles to deliver each class of supplies with a certain probability. The goal of the problem is how to select a finite number of locations in the map as centers of supplies so that the number of locations that can be effectively covered by vehicle paths from them is maximized with the desired probability. For the first time, we used a hybrid genetic algorithm to optimize the e-commerce logistics path, and the optimized results are more reasonable than other algorithms. (shrink)

On the basis of analyzing the complexity of railway flatcar loading optimization problem, according to the characteristics of railway flatcar loading, based on the situation of railway transport loading unit of multiple railway flatcars, this study puts forward the optimal loading optimization method of multimodel railway flatcars based on improved genetic algorithm, constructs the linear programming model of railway flatcar loading optimization problem, and combines with the improved genetic algorithm to solve the problem. The study also (...) analyzes the structural characteristics of the optimal loading materials of multimodel railway flatcars, selects the optimal materials and inputs the relevant data into the computer, and uses MATLAB to program the optimal loading algorithm of multimodel railway flatcars. Through the analysis of the calculation example, the study discusses its scope of application. The experimental results show that the average general utilization rate of the proposed method is 73%, which has higher universality, more effective application, and fully meets the research requirements. It is verified that the proposed method has a statistically significant impact on the optimal loading of multi-type railway flatcars. (shrink)