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)

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)

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)

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)

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)

Nine selection‐survival strategies were implemented in a genetic algorithm experiment, and differences in terms of evolution were assessed. The moments of evolution (expressed as generation numbers) were recorded in a contingency of three strategies (i.e., proportional, tournament, and deterministic) for two moments (i.e., selection for crossover and mutation and survival for replacement). The experiment was conducted for the first 20,000 generations in 46 independent runs. The relative moments of evolution (where evolution was defined as a (...) significant increase in the determination coefficient relative to the previous generation) when any selection‐survival strategy was used fit a Log‐Pearson type III distribution. Moreover, when distributions were compared to one another, functional relationships were identified between the population parameters, revealing a degeneration of the Log‐Pearson type III distribution in a one‐parametrical distribution that can be assigned to the chosen variable—evolution strategy. The obtained theoretical population distribution allowed comparison of the selection‐survival strategies that were used. © 2012 Wiley Periodicals, Inc. Complexity, 2012. (shrink)

The existing numerous adaptive variants of differential evolution have been improved the search ability of classic DE to certain extent. Nevertheless, those variants of DE do not obtain the promising performance in solving black box problems with unknown features, which is mainly because the adaptive rules of those variants are designed according to their designers’ cognition on the problem features. To enhance the optimization ability of DE in optimizing black box problems with unknown features, a differential evolution with (...) autonomous selection of mutation strategies and control parameters is proposed in this paper, inspired by autonomous decision-making mechanism of reinforcement learning. In ASDE, a historical experience archive with population features is utilized to preserve accumulated historical experience of the combination of mutation strategies and control parameters. Furthermore, the accumulated historical experience can be autonomously mapped into rules repository, and the individuals can choose the combination of mutation strategies and control parameters according to those rules. Additionally, an updating and utilization mechanism of the historical experience is designed to assure that the historical experience can be effectively accumulated and utilized efficiently. Compared with some state-of-the-art intelligence algorithms on 15 functions of CEC2015, 28 functions of CEC2017, and parameter extraction problems of the photovoltaic model, ASDE has the advantages of solution accuracy, convergence speed, and robustness in solving black box problems with unknown features. (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)

Harmony Search Algorithm (HSA) is an evolutionary algorithm which mimics the process of music improvisation to obtain a nice harmony. The algorithm has been successfully applied to solve optimization problems in different domains. A significant shortcoming of the algorithm is inadequate exploitation when trying to solve complex problems. The algorithm relies on three operators for performing improvisation: memory consideration, pitch adjustment, and random consideration. In order to improve algorithm efficiency, we use roulette wheel and tournament selection in memory consideration, (...) replace the pitch adjustment and random consideration with a modified polynomial mutation, and enhance the obtained new harmony with a modified β-hill climbing algorithm. Such modification can help to maintain the diversity and enhance the convergence speed of the modified HS algorithm. β-hill climbing is a recently introduced local search algorithm that is able to effectively solve different optimization problems. β-hill climbing is utilized in the modified HS algorithm as a local search technique to improve the generated solution by HS. Two algorithms are proposed: the first one is called PHSβ–HC and the second one is called Imp. PHSβ–HC. The two algorithms are evaluated using 13 global optimization classical benchmark function with various ranges and complexities. The proposed algorithms are compared against five other HSA using the same test functions. Using Friedman test, the two proposed algorithms ranked 2nd (Imp. PHSβ–HC) and 3rd (PHSβ–HC). Furthermore, the two proposed algorithms are compared against four versions of particle swarm optimization (PSO). The results show that the proposed PHSβ–HC algorithm generates the best results for three test functions. In addition, the proposed Imp. PHSβ–HC algorithm is able to overcome the other algorithms for two test functions. Finally, the two proposed algorithms are compared with four variations of differential evolution (DE). The proposed PHSβ–HC algorithm produces the best results for three test functions, and the proposed Imp. PHSβ–HC algorithm outperforms the other algorithms for two test functions. In a nutshell, the two modified HSA are considered as an efficient extension to HSA which can be used to solve several optimization applications in the future. (shrink)

Recently, decomposition-based multiobjective evolutionary algorithms have good performances in the field of multiobjective optimization problems and have been paid attention by many scholars. Generally, a MOP is decomposed into a number of subproblems through a set of weight vectors with good uniformly and aggregate functions. The main role of weight vectors is to ensure the diversity and convergence of obtained solutions. However, these algorithms with uniformity of weight vectors cannot obtain a set of solutions with good diversity on some (...) MOPs with complex Pareto optimal fronts. To deal with this problem, an improved decomposition-based multiobjective evolutionary algorithm with adaptive weight adjustment is proposed. Firstly, a new method based on uniform design and crowding distance is used to generate a set of weight vectors with good uniformly. Secondly, according to the distances of obtained nondominated solutions, an adaptive weight vector adjustment strategy is proposed to redistribute the weight vectors of subobjective spaces. Thirdly, a selection strategy is used to help each subobjective space to obtain a nondominated solution. Comparing with six efficient state-of-the-art algorithms, for example, NSGAII, MOEA/D, MOEA/D-AWA, EMOSA, RVEA, and KnEA on some benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence. (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 classification frameworks for fault diagnosis of rolling element bearings in rotating machinery are mostly based on analysis in a single time-frequency domain, where sensitive features are not completely extracted. To solve this problem, a new fault diagnosis technique is proposed in the mixed domain, based on the crossover-mutation chaotic particle swarm optimization support vector machine. Firstly, fault features are generated using techniques in the time domain, the frequency domain, and the time-frequency domain. Secondly, the weighted maximum relevance minimum redundancy (...) algorithm is adopted to reduce the dimension of the feature set and to establish the representative feature set. Thirdly, a new crossover-mutation strategy is suggested to reduce the local minima in optimization, and an optimization disturbance is added. Finally, the support vector machine is optimized using the improved chaotic particle swarm to improve fault classification diagnosis. The effectiveness of the proposed new bearing fault diagnostic technique is verified by experimental tests under different bearing conditions. Test results showed that the bearing fault classification accuracy of CMCPSO-SVM in the mixed domain was much higher than those in a single feature domain. (shrink)

Multiobjective evolutionary algorithms have witnessed prosperity in solving many-objective optimization problems over the past three decades. Unfortunately, no one single MOEA equipped with given parameter settings, mating-variation operator, and environmental selection mechanism is suitable for obtaining a set of solutions with excellent convergence and diversity for various types of MaOPs. The reality is that different MOEAs show great differences in handling certain types of MaOPs. Aiming at these characteristics, this paper proposes a flexible ensemble framework, namely, ASES, which is (...) highly scalable for embedding any number of MOEAs to promote their advantages. To alleviate the undesirable phenomenon that some promising solutions are discarded during the evolution process, a big archive that number of contained solutions be far larger than population size is integrated into this ensemble framework to record large-scale nondominated solutions, and also an efficient maintenance strategy is developed to update the archive. Furthermore, the knowledge coming from updating archive is exploited to guide the evolutionary process for different MOEAs, allocating limited computational resources for efficient algorithms. A large number of numerical experimental studies demonstrated superior performance of the proposed ASES. Among 52 test instances, the ASES performs better than all the six baseline algorithms on at least half of the test instances with respect to both metrics hypervolume and inverted generational distance. (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)

In multimodal multiobjective optimization problems, multiple Pareto optimal sets, even some good local Pareto optimal sets, should be reserved, which can provide more choices for decision-makers. To solve MMOPs, this paper proposes an evolutionary algorithm with clustering-based assisted selection strategy for multimodal multiobjective optimization, in which the addition operator and deletion operator are proposed to comprehensively consider the diversity in both decision and objective spaces. Specifically, in decision space, the union population is partitioned into multiple clusters by using (...) a density-based clustering method, aiming to assist the addition operator to strengthen the population diversity. Then, a number of weight vectors are adopted to divide population into N subregions in objective space. Moreover, in the deletion operator, the solutions in the most crowded subregion are first collected into previous clusters, and then the worst solution in the most crowded cluster is deleted until there are N solutions left. Our algorithm is compared with other multimodal multiobjective evolutionary algorithms on the well-known benchmark MMOPs. Numerical experiments report the effectiveness and advantages of our proposed algorithm. (shrink)

In recent years, social networks have made significant progress and the number of people who use them to communicate is increasing day by day. The vast amount of information available on social networks has led to the importance of using friend recommender systems to discover knowledge about future communications. It is challenging to choose the best machine learning approach to address the recommender system issue since there are several strategies with various benefits and drawbacks. In light of this, a solution (...) based on the stacking approach was put out in this study to provide a buddy recommendation system in social networks. Additionally, a decrease in system performance was caused by the large amount of information that was accessible and the inefficiency of some functions. To solve this problem, a particle swarm optimization algorithm to select the most efficient features was used in our proposed method. To learn the model in the objective function of the particle swarm algorithm, a hybrid system based on stacking is proposed. In this method, two random forests and Extreme Gradient Boosting had been used as the base classifiers. The results obtained from these base classifiers were used in the logistic regression algorithm, which has been applied sequentially. The suggested approach was able to effectively address this issue by combining the advantages of the applied strategies. The results of implementation and evaluation of the proposed system show the appropriate efficiency of this method compared with other studied techniques. (shrink)

This paper addresses the job shop scheduling problem including time lag constraints. This is an extension of the job shop scheduling problem with many applications in real production environments, where extra delays can be introduced between successive operations of the same job. It belongs to a category of problems known as NP-hard problem due to large solution space. Biogeography-based optimization is an evolutionary algorithm which is inspired by the migration of species between habitats, recently proposed by Simon in 2008 (...) to optimize hard combinatorial optimization problems. We propose a hybrid biogeography-based optimization algorithm for solving the job shop scheduling problem with additional time lag constraints with minimization of total completion time. In the proposed HBBO, the effective greedy constructive heuristic is adapted to generate the initial population of habitat. Moreover, a local search metaheuristic is investigated in the mutation step in order to ameliorate the solution quality and enhance the diversity of the population. To assess the performance of HBBO, a series of experiments on well-known benchmark instances for job shop scheduling problem with time lag constraints is performed. (shrink)

Combining genetic algorithms that produce complex, fluid, biomorphic shapes with probabilistic systems that incorporate randomness, the designers attempt to mimic adaptive systems in natural evolution in order to arrive at intelligent design solutions. The design processes are said to be interactive and sensitive to varying conditions, behaving like an exceptionally perceptive and adaptive organism during an evolutionary process (Somol 2004: 8687); this process can be compared to the recent attempt by the architectural avant-garde to move beyond the (...) semiotic interests of deconstructionism and tap into the authority of the natural sciences. In some sense, an analogy can be drawn to natural evolution. In the natural world, adaptation and change result from an iterative progress, from one generation to the next, driven by mutation, recombination, and the survival of the fittest in the sense of selection. Following the model of nature in architecture, as proposed by some proponents of parametricism, should not be expected to make buildings more precisely adapted to particular circumstances and optimally functional. Evolutionary theory is used in contemporary architecture as a form of legitimization. It can also cast light on ethical issues, not reducing the human mind's creative intelligence to some sort of genetic determinism, developing in the free market of social choice. Therefore, searching for better ways of managing resources should be at the core of an adaptive concept of architecture. (shrink)

Bound-constrained optimization has wide applications in science and engineering. In the last two decades, various evolutionary algorithms were developed under the umbrella of evolutionary computation for solving various bound-constrained benchmark functions and various real-world problems. In general, the developed evolutionary algorithms belong to nature-inspired algorithms and swarm intelligence paradigms. Differential evolutionary algorithm is one of the most popular and well-known EAs and has secured top ranks in most of the EA competitions in the special session of (...) the IEEE Congress on Evolutionary Computation. In this paper, a customized differential evolutionary algorithm is suggested and applied on twenty-nine large-scale bound-constrained benchmark functions. The suggested C-DE algorithm has obtained promising numerical results in its 51 independent runs of simulations. Most of the 2013 IEEE-CEC benchmark functions are tackled efficiently in terms of proximity and diversity. (shrink)

Resource saving has become an integral aspect of manufacturing in industry 4.0. This paper proposes a multisystem optimization algorithm, inspired by implicit parallelism of heuristic methods, to solve an integrated production scheduling with resource saving problem in textile printing and dyeing. First, a real-world integrated production scheduling with resource saving is formulated as a multisystem optimization problem. Then, the MSO algorithm is proposed to solve multisystem optimization problems that consist of several coupled subsystems, and each of the subsystems may contain (...) multiple objectives and multiple constraints. The proposed MSO algorithm is composed of within-subsystem evolution and cross-subsystem migration operators, and the former is to optimize each subsystem by excellent evolution operators and the later is to complete information sharing between multiple subsystems, to accelerate the global optimization of the whole system. Performance is tested on a set of multisystem benchmark functions and compared with improved NSGA-II and multiobjective multifactorial evolutionary algorithm. Simulation results show that the MSO algorithm is better than compared algorithms for the benchmark functions studied in this paper. Finally, the MSO algorithm is successfully applied to the proposed integrated production scheduling with resource saving problem, and the results show that MSO is a promising algorithm for the studied problem. (shrink)

Grammatical Evolution (GE) has a long history in evolutionary computation. Central to the behaviour of GE is the use of a linear representation and grammar to map individuals from search spaces into problem spaces. This genotype to phenotype mapping is often argued as a distinguishing property of GE relative to other techniques, such as context-free grammar genetic programming (CFG-GP). Since its initial description, GE research has attempted to incorporate information from the grammar into crossover, mutation, and individual (...) initialisation, blurring the distinction between genotype and phenotype and creating GE variants closer to CFG-GP. This is argued to provide GE with the "best of both worlds", allowing degrees of grammatical bias to be introduced into operators to best suit the given problem. This paper examines the behaviour of three grammar-based search methods on several problems from previous GE research. It is shown that, unlike CFG-GP, the performance of "pure" GE on the examined problems closely resembles that of random search. The results suggest that further work is required to determine the cases where the "best of both worlds" of GE are required over a straight CFG-GP approach. (shrink)

Due to the NP-hard nature, the permutation flowshop scheduling problem is a fundamental issue for Industry 4.0, especially under higher productivity, efficiency, and self-managing systems. This paper proposes an improved genetic-shuffled frog-leaping algorithm to solve the permutation flowshop scheduling problem. In the proposed IGSFLA, the optimal initial frog in the initialized group is generated according to the heuristic optimal-insert method with fitness constrain. The crossover mechanism is applied to both the subgroup and the global group to avoid the local (...) optimal solutions and accelerate the evolution. To evolve the frogs with the same optimal fitness more outstanding, the disturbance mechanism is applied to obtain the optimal frog of the whole group at the initialization step and the optimal frog of the subgroup at the searching step. The mathematical model of PFSSP is established with the minimum production cycle as the objective function, the fitness of frog is given, and the IGSFLA-based PFSSP is proposed. Experimental results have been given and analyzed, showing that IGSFLA not only provides the optimal scheduling performance but also converges effectively. (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)

The constraint-handling methods using multiobjective techniques in evolutionary algorithms have drawn increasing attention from researchers. This paper proposes an efficient conical area differential evolution algorithm, which employs biased decomposition and dual populations for constrained optimization by borrowing the idea of cone decomposition for multiobjective optimization. In this approach, a conical subpopulation and a feasible subpopulation are designed to search for the global feasible optimum, along the Pareto front and the feasible segment, respectively, in a cooperative way. In particular, (...) the conical subpopulation aims to efficiently construct and utilize the Pareto front through a biased cone decomposition strategy and conical area indicator. Neighbors in the conical subpopulation are fully exploited to assist each other to find the global feasible optimum. Afterwards, the feasible subpopulation is ranked and updated according to a tolerance-based rule to heighten its diversity in the early stage of evolution. Experimental results on 24 benchmark test cases reveal that CADE is capable of resolving the constrained optimization problems more efficiently as well as producing solutions that are significantly competitive with other popular approaches. (shrink)

This paper discusses DNA-based stochastic optimizations under the constraint that the search starts from a given point in a search space. Generally speaking, a stochastic optimization method explores a search space and finds out the optimum or a sub-optimum after many cycles of trials and errors. This search process could be implemented efficiently by ``molecular computing'', which processes DNA molecules by the techniques of molecular biology to generate and evaluate a vast number of solution candidates at a time. We assume (...) the exploration starting from a single point, and propose a method to embody DNA-based optimization under this constraint, because this method has a promising application in the research field of protein engineering. In this application, a string of nucleotide bases encodes a protein possessing a specific activity, which could be given as a value of an objective function. Thus, a problem of obtaining a protein with the optimum or a sub-optimum about the desired activity corresponds to a combinatorial problem of obtaining a base sequence giving the optimum or a sub-optimum in the sequence space. Biologists usually modify a base sequence corresponding to a naturally occurring protein into another sequence giving a desired activity. In other words, they explore the space in the proximity of a natural protein as a start point. We first examined if the optimization methods that involve a single start point, such as simulated annealing, Gibbs sampler, and MH algorithms, can be implemented by DNA-based operations. Then, we proposed an application of genetic algorithm, and examined the performance of this application on a model fitness landscape by computer experiments. These experiments gave helpful guidelines in the embodiments of DNA-based stochastic optimization, including a better design of crossover operator. (shrink)

The effectiveness of evolutionary algorithms is one of the issues discussed in The Compatibility of Evolution and Design, where it is argued that such algorithms are only effective when stringent preconditions are met. This article considers this issue from the perspective of computer science. It explores the properties of problems that can be effectively solved by evolutionary algorithms, and the extent to which such algorithms need to be carefully adjusted. Although there are important differences between the study (...) of evolutionary algorithms in computer science and the study of biological evolution, it is argued that the experience of computer science can help to strengthen the claim that evolutionary mechanisms generally require a considerable degree of fine-tuning. (shrink)

Constrained optimization plays an important role in many decision-making problems and various real-world applications. In the last two decades, various evolutionary algorithms were developed and still are developing under the umbrella of evolutionary computation. In general, EAs are mainly categorized into nature-inspired and swarm-intelligence- based paradigms. All these developed algorithms have some merits and also demerits. Particle swarm optimization, firefly algorithm, ant colony optimization, and bat algorithm have gained much popularity and they have successfully tackled various test suites (...) of benchmark functions and real-world problems. These SI-based algorithms follow the social and interactive principles to perform their search process while approximating solution for the given problems. In this paper, a multiswarm-intelligence-based algorithm is developed to cope with bound constrained functions. The suggested algorithm integrates the SI-based algorithms to evolve population and handle exploration versus exploitation issues. Thirty bound constrained benchmark functions are used to evaluate the performance of the proposed algorithm. The test suite of benchmark function is recently designed for the special session of EAs competition in IEEE Congress on Evolutionary Computation. The suggested algorithm has approximated promising solutions with good convergence and diversity maintenance for most of the used bound constrained single optimization problems. (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)

Emergency scheduling of public resources on the cloud computing platform network can effectively improve the network emergency rescue capability of the cloud computing platform. To schedule the network common resources, it is necessary to generate the initial population through the Hamming distance constraint and improve the objective function as the fitness function to complete the emergency scheduling of the network common resources. The traditional method, from the perspective of public resource fairness and priority mapping, uses incremental optimization algorithm (...) to realize emergency scheduling of public resources, neglecting the improvement process of the objective function, which leads to unsatisfactory scheduling effect. An emergency scheduling method of cloud computing platform network public resources based on genetic algorithm is proposed. With emergency public resource scheduling time cost and transportation cost minimizing target, initial population by Hamming distance constraints, emergency scheduling model, and the corresponding objective function improvement as the fitness function, the genetic algorithm to individual selection and crossover and mutation probability were optimized and complete the public emergency resources scheduling. Experimental results show that the proposed method can effectively improve the efficiency of emergency resource scheduling, and the reliability of emergency scheduling is better. (shrink)

Maynard Smith’s defenses of adaptationism and of the value of optimization theory in evolutionary biology are both criticized. His defense does not adequately respond to the criticism of adaptationism by Gould and Lewontin. It is also argued here that natural selection cannot be interpreted as an optimization process if the objective function to be optimized is either (i) interpretable as a fitness, or (ii) correlated with the mean population fitness. This result holds even if fitnesses are frequency-independent; the (...) problem is further exacerbated in the frequency-dependent context modeled by evolutionary game theory. However, Eshel and Feldman’s new results on “long-term” evolution may provide some hope for the continuing relevance of the game-theoretic framework. These arguments also demonstrate the irrelevance of attempts by Intelligent Design creationists to use computational limits on optimization algorithms as evidence against evolutionary theory. It is pointed out that adaptation, natural selection, and optimization are not equivalent processes in the context of biological evolution. (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)

This paper proposes a constrained solution update strategy for multiobjective evolutionary algorithm based on decomposition, in which each agent aims to optimize one decomposed subproblem. Different from the existing approaches that assign one solution to each agent, our approach allocates the closest solutions to each agent and thus the number of solutions in an agent may be zero and no less than one. Regarding the agent with no solution, it will be assigned one solution in priority, once offspring (...) are generated closest to its subproblem. To keep the same population size, the agent with the largest number of solutions will remove one solution showing the worst convergence. This improves diversity for one agent, while the convergence of other agents is not lowered. On the agent with no less than one solution, offspring assigned to this agent are only allowed to update its original solutions. Thus, the convergence of this agent is enhanced, while the diversity of other agents will not be affected. After a period of evolution, our approach may gradually reach a stable status for solution assignment; i.e., each agent is only assigned with one solution. When compared to six competitive multiobjective evolutionary algorithms with different population selection or update strategies, the experiments validated the advantages of our approach on tackling two sets of test problems. (shrink)

The mammalian immune system is a subject of great research interest because of its powerful information processing capabilities, namely, adaptivity. The adaptivity of the immune system is characterized by mainly two aspects, responsibility and diversity. The responsibility is a result of the response network of the immune system and the diversity is arise from gene rearrengement of the immune system. Recentry many artificial immune algorithms were devised by inspiring the adaptivity of the immune system. In terms of the two aspects (...) of the immune system, however, those artificial immune algorithms only utilize the responsibility using models of response and regulation networks in the immune system. This paper proposes a new scheme of artificial immune algorithm, called Rearrangement Immune Algorithm, in which the rearrengement of the immune system is utilized combining evolution of the gelmline with an optimization of genetic algorithms. We empirically shows the effectiveness of our new scheme, RIA, with applying the Rosenbrock function and an HP folding problem. (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)

A large number of modern communication technologies and sensing technologies are incorporated into the smart grid, which makes its structure unique. The centralized optimized dispatch method of traditional power grids is difficult to achieve effective dispatch of smart grids. Based on the analysis of power generation plan and maintenance plan optimization model, this paper establishes a smart grid power generation and maintenance collaborative optimization model with distributed renewable energy. The objective function of this collaborative optimization problem is the operating (...) cost of conventional units, the cost of wind power generation, and the cost of overhauling units; the constraints considered mainly include system constraints and overhaul constraints. The solution method of combinatorial optimization is analyzed, and the genetic optimization algorithm adopted in this paper is selected and discussed. According to the characteristics of the system, various loads are modeled, and power supply constraints are considered. By establishing an effective objective function, the adjustable load scheduling problem is transformed into a solvable optimal control problem. Taking into account the uncertain factors in the system, the advantage of the real-time control system is that it can realize the dynamic update scheduling of the load, so it is more in line with the requirements of the actual system. The real-time algorithm proposed in the paper is based on a distributed control strategy, which can not only realize dynamic compensation for random fluctuations in renewable energy power generation but also satisfy the load curve optimization under the premise of making full use of power supply resources. In addition, simulation experiments compare the load dispatching capabilities of the proposed algorithm with the existing algorithms, thereby verifying the performance of the proposed method. (shrink)

Enzyme directed genetic mechanisms causing random DNA sequence alterations are ubiquitous in both eukaryotes and prokaryotes. A number of molecular geneticist have invoked adaptation through natural selection to account for this fact, however, alternative explanations have also flourished. The population geneticist G.C. Williams has dismissed the possibility of selection for mutator activity on a priori grounds. In this paper, I attempt a refutation of Williams' argument. In addition, I discuss some conceptual problems related to recent claims made by microbiologists (...) on the adaptiveness of molecular variety generators in the evolution of prokaryotes. A distinction is proposed between selection for mutations caused by a mutator activity and selection for the mutator activity proper. The latter requires a concept of fitness different from the one commonly used in microbiology. (shrink)

Mechanisms to ensure the integrity of the system stable evolutionary strategy Homo sapiens – genetic and cultural coevolution techno-cultural balance – are analyzed. оe main content of the study can be summarized in the following the- ses: stable adaptive strategy of Homo sapiens includes superposition of three basic types (biological, cultural and technological) of adaptations, the integrity of the system provides by two coevolutionary ligament its elements – the genetic-cultural coevolution and techno-cultural balance, the system (...) takes as result of by develop- ment of genetic and information technologies by advent of genetic and informa- tion technologies extremely unstable conūguration; a harbinger of a radical change in the mechanisms of global evolution religion is a consequence of structural and functional organization of the human psyche; it played (along with science and technology) the role of socio-cultural adaptation of the human mind are present a number of ideas or concepts (the idea of God, including) the genesis of that ideas is associated with the interaction of two information systems, that appear to each other as information substrates – emotional, and verbal-logical (discursive) forms; evolution of the mentality has two nodes, that corresponding to the dominance of rationalism or religion in spiritual culture; the problem of rational justiūcation of religion in modern science is presented by two alternative methodologies – evo- lutionary epistemological and metaphysical-ontological ones; both methodologies are incompatible in a logical perspective; in the evolutionary epistemological im- pact concept of religion and science are equal and alternative building blocks of a stable evolutionary strategy of Homo sapiens, and their balance sheet pro. (shrink)

During the 1920s and 1930s, many biologists questioned the viability of Darwin’s theory as a mechanism of evolutionary change. In the early 1940s, and only after a number of alternatives were suggested, Darwinists succeeded to establish natural selection and gene mutation as the main evolutionary mechanisms. While that move, today known as the neo-Darwinian synthesis, is taken as signalling a triumph of evolutionary theory, certain critical problems in evolution—in particular the evolution of animal function—could (...) not be addressed with this approach. Here I demonstrate this through reconstruction of the evolutionary theory of Joseph Needham (1900–1995), who pioneered the biochemical study of evolution and development. In order to address such problems, Needham employed Herbert Spencer’s principles of emergence and Ernst Haeckel’s theory of recapitulation. While Needham did not reject Darwinian theory, Spencerian and Haeckelian frameworks happened to better fit his findings and their evolutionary relevance. He believed selectionist and genetic approaches to be important but far from sufficient for explaining how evolutionary transformations occur. (shrink)

The increase in the size of universities has greatly increased the number of teachers, students, and courses and has also increased the difficulty of scheduling courses. This study used coevolution to improve the genetic algorithm and applied it to solve the course scheduling problem in universities. Finally, simulation experiments were conducted on the traditional and improved genetic algorithms in MATLAB software. The results showed that the improved genetic algorithm converged faster and produced better solutions than the traditional (...) genetic algorithm under the same crossover and mutation probability. As the mutation probability in the algorithm increased, the fitness values of both genetic algorithms gradually decreased, and the computation time increased. With the increase in crossover probability in the algorithm, the fitness value of the two genetic algorithms increased first and then decreased, and the computational time decreased first and then increased. (shrink)

The purpose of this study is development of a supporting system for teacher's design of lesson plan. Especially design of lesson plan which relates to the new subject "Information Study" is supported. In this study, we developed a system which generates teaching and learning activity sequences by interlinking lesson's activities corresponding to the various conditions according to the user's input. Because user's input is multiple information, there will be caused contradiction which the system should solve. This multiobjective optimization problem is (...) resolved by Distributed Genetic Algorithms, in which some fitness functions are defined with reference models on lesson, thinking and teaching style. From results of various experiments, effectivity and validity of the proposed methods and reference models were verified; on the other hand, some future works on reference models and evaluation functions were also pointed out. (shrink)

The study of genetic developmental disorders originally seemed to hold the promise for those of a nativist persuasion of demonstrating pure dissociations between different cognitive functions, as well as the existence of innately specified modules in the brain and the direct mapping of mutated genes to specific cognitive-level outcomes. However, more recent research within a neuroconstructivist perspective has challenged this promise, arguing that earlier researchers lost sight of one fundamental explanatory factor in both the typical and atypical case: the (...) actual process of ontogenetic development. The paper is divided into three parts on evolution, genetics, and ontogeny. Each section starts by examining nativist claims about innateness and modularity of function, and subsequently evaluates them within a neuroconstructivist approach to human development. (shrink)

Metaheuristic algorithms are often applied to global function optimization problems. To overcome the poor real-time performance and low precision of the basic salp swarm algorithm, this paper introduces a novel hybrid algorithm inspired by the perturbation weight mechanism. The proposed perturbation weight salp swarm algorithm has the advantages of a broad search scope and a strong balance between exploration and exploitation and retains a relatively low computational complexity when dealing with numerous large-scale problems. A new coefficient factor is introduced (...) to the basic salp swarm algorithm, and new update strategies for the leader position and the followers are introduced in the search phase. The new leader position updating strategy has a specific bounded scope and strong search performance, thus accelerating the iteration process. The new follower updating strategy maintains the diversity of feasible solutions while reducing the computational load. This paper describes the application of the proposed algorithm to low-dimension and variable-dimension functions. This paper also presents iteration curves, box-plot charts, and search-path graphics to verify the accuracy of the proposed algorithm. The experimental results demonstrate that the perturbation weight salp swarm algorithm offers a better search speed and search balance than the basic salp swarm algorithm in different environments. (shrink)

During the 1920s and 1930s, many biologists questioned the viability of Darwin’s theory as a mechanism of evolutionary change. In the early 1940s, and only after a number of alternatives were suggested, Darwinists succeeded to establish natural selection and gene mutation as the main evolutionary mechanisms. While that move, today known as the neo-Darwinian synthesis, is taken as signalling a triumph of evolutionary theory, certain critical problems in evolution—in particular the evolution of animal function—could (...) not be addressed with this approach. Here I demonstrate this through reconstruction of the evolutionary theory of Joseph Needham (1900–1995), who pioneered the biochemical study of evolution and development. In order to address such problems, Needham employed Herbert Spencer’s principles of emergence and Ernst Haeckel’s theory of recapitulation. While Needham did not reject Darwinian theory, Spencerian and Haeckelian frameworks happened to better fit his findings and their evolutionary relevance. He believed selectionist and genetic approaches to be important but far from sufficient for explaining how evolutionary transformations occur. (shrink)

The deep formal and conceptual link existing between artificial life and artificial intelligence can be highlighted using conceptual tools derived by Karl Popper's evolutionary epistemology.Starting from the observation that the structure itself of an organism embodies knowledge about the environment which it is adapted to, it is possible to regard evolution as a learning process. This process is subject to the same rules indicated by Popper for the growth of scientific knowledge: causal conjectures (mutations) and successive refutations (extinction). (...) In the field of machine learning such a paradigm is represented by genetic algorithms that, simulating biological processes, emulate cognitive processes. From a practical viewpoint, that perspective allows to identify the two different kinds of learning considered by artificial intelligence, knowledge acquisition and skill improvement, and to get a different view of the problem of heuristic knowledge in learning systems. From a theoretical point of view, these considerations can shade a new light on an old epistemological problem: why do we live in a learnable world? (shrink)

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)

Behavioral genetics and cultural evolution have both revolutionized our understanding of human behavior – largely independent of each other. Here, we reconcile these two fields under a dual inheritance framework, offering a more nuanced understanding of the interaction between genes and culture. Going beyond typical analyses of gene–environment interactions, we describe the cultural dynamics that shape these interactions by shaping the environment and population structure. A cultural evolutionary approach can explain, for example, how factors such as rates of (...) innovation and diffusion, density of cultural subgroups, and tolerance for behavioral diversity impact heritability estimates, thus yielding predictions for different social contexts. Moreover, when cumulative culture functionally overlaps with genes, genetic effects become masked, unmasked, or even reversed, and the causal effects of an identified gene become confounded with features of the cultural environment. The manner of confounding is specific to a particular society at a particular time, but a WEIRD (western, educated, industrialized, rich, and democratic) sampling problem obscures this boundedness. Cultural evolutionary dynamics are typically missing from models of gene-to-phenotype causality, hindering generalizability of genetic effects across societies and across time. We lay out a reconciled framework and use it to predict the ways in which heritability should differ between societies, between socioeconomic levels, and other groupings within some societies but not others, and over the life course. An integrated cultural evolutionary behavioral genetic approach cuts through the nature–nurture debate and helps resolve controversies in topics such as IQ. (shrink)

Robert Trivers has proposed perhaps the only serious adaptationist account of self-deception—that the primary function of self-deception is to better deceive others. But this account covers only a subset of cases and needs further refinement. A better evolutionary account of self-deception and cognitive biases more generally will more rigorously recognize the various ways in which false beliefs affect both the self and others. This article offers formulas for determining the optimal doxastic orientation, giving special consideration to conflicted self-deception (...) as an alternative to outright self-delusion. A novel taxonomy of self-deception, as it relates to the beliefs held by others, is also presented. While Trivers makes a plausible case for the adaptive value of certain cognitive biases, a more fragmented and nuanced account of the social forces impacting the evolution of self-deception is needed. (shrink)

The placenta arose during mammalian evolution, which is recent in evolutionary terms. Genetic changes underlying placental development remain identifiable by the new science of comparative genomics (approximately post‐2000). Randomly arising features of genomes including endogenous retroviruses and transposable elements have provided structural genes and gene‐regulatory motifs responsible for innovations in placental biology. Stochastic genetic events indeed contribute to new functionality. Theologically, random mutations are part of the strategy by which the divine purpose for humanity is (...) attained. Placental function critically underlies human brain development, and suboptimal function, associated with environmental conditions and maternal distress, contributes to mental health deficits in the offspring. Many enter life with handicaps arising from contingent events in utero, mandating understanding, compassion, and socioemotional support, imperatives native to moral including biblical values. The extended period of development afforded by placentation enables prenatal parenting, with implications for sensitive and devoted parental commitment. (shrink)

Given that natural selection is so powerful at optimizing complex adaptations, why does it seem unable to eliminate genes (susceptibility alleles) that predispose to common, harmful, heritable mental disorders, such as schizophrenia or bipolar disorder? We assess three leading explanations for this apparent paradox from evolutionary genetic theory: (1) ancestral neutrality (susceptibility alleles were not harmful among ancestors), (2) balancing selection (susceptibility alleles sometimes increased fitness), and (3) polygenic mutation-selection balance (mental disorders reflect the inevitable mutational load on (...) the thousands of genes underlying human behavior). The first two explanations are commonly assumed in psychiatric genetics and Darwinian psychiatry, while mutation-selection has often been discounted. All three models can explain persistent genetic variance in some traits under some conditions, but the first two have serious problems in explaining human mental disorders. Ancestral neutrality fails to explain low mental disorder frequencies and requires implausibly small selection coefficients against mental disorders given the data on the reproductive costs and impairment of mental disorders. Balancing selection (including spatio-temporal variation in selection, heterozygote advantage, antagonistic pleiotropy, and frequency-dependent selection) tends to favor environmentally contingent adaptations (which would show no heritability) or high-frequency alleles (which psychiatric genetics would have already found). Only polygenic mutation-selection balance seems consistent with the data on mental disorder prevalence rates, fitness costs, the likely rarity of susceptibility alleles, and the increased risks of mental disorders with brain trauma, inbreeding, and paternal age. This evolutionary genetic framework for mental disorders has wide-ranging implications for psychology, psychiatry, behavior genetics, molecular genetics, and evolutionary approaches to studying human behavior. (Published Online November 9 2006) Key Words: adaptation; behavior genetics; Darwinian psychiatry; evolution; evolutionary genetics; evolutionary psychology; mental disorders; mutation-selection balance; psychiatric genetics; quantitative trait loci (QTL). (shrink)

This paper considers two kinds of stochastic reentrant job shop scheduling problems, i.e., the SRJSSP with the maximum tardiness criterion and the SRJSSP with the makespan criterion. Owing to the NP-complete complexity of the considered RJSSPs, an effective differential evolutionary algorithm combined with two uncertainty handling techniques, namely, DEA_UHT, is proposed to address these problems. Firstly, to reasonably control the computation cost, the optimal computing budget allocation technique is applied for allocating limited computation budgets to assure reliable evaluation and (...) identification for excellent solutions or individuals, and the hypothesis test technique is added to execute a statistical comparison to reduce some unnecessary repeated evaluation. Secondly, a reentrant-largest-order-value rule is designed to convert the DEA’s individual to the SRJSSP’s solution. Thirdly, a conventional active decoding scheme for the job shop scheduling problem is extended to decode the solution for obtaining the criterion value. Fourthly, an Insert-based exploitation strategy and an Interchange-based exploration strategy are devised to enhance DEA’s exploitation ability and exploration ability, respectively. Finally, the test results and comparisons manifest the effectiveness and robustness of the proposed DEA_UHT. (shrink)