Surrogate models have shown to be effective in assisting evolutionary algorithms(EAs)for solving computationally expensive complex optimization problems.However,the effectiveness of the existing surrogate-assisted evo...Surrogate models have shown to be effective in assisting evolutionary algorithms(EAs)for solving computationally expensive complex optimization problems.However,the effectiveness of the existing surrogate-assisted evolutionary algorithms still needs to be improved.A data-driven evolutionary sampling optimization(DESO)framework is proposed,where at each generation it randomly employs one of two evolutionary sampling strategies,surrogate screening and surrogate local search based on historical data,to effectively balance global and local search.In DESO,the radial basis function(RBF)is used as the surrogate model in the sampling strategy,and different degrees of the evolutionary process are used to sample candidate points.The sampled points by sampling strategies are evaluated,and then added into the database for the updating surrogate model and population in the next sampling.To get the insight of DESO,extensive experiments and analysis of DESO have been performed.The proposed algorithm presents superior computational efficiency and robustness compared with five state-of-the-art algorithms on benchmark problems from 20 to 200 dimensions.Besides,DESO is applied to an airfoil design problem to show its effectiveness.展开更多
In this work, focusing on the demerit of AEA (Alopex-based evolutionary algorithm) algorithm, an improved AEA algorithm (AEA-C) which was fused AEA with clonal selection algorithm was proposed. Considering the irratio...In this work, focusing on the demerit of AEA (Alopex-based evolutionary algorithm) algorithm, an improved AEA algorithm (AEA-C) which was fused AEA with clonal selection algorithm was proposed. Considering the irrationality of the method that generated candidate solutions at each iteration of AEA, clonal selection algorithm could be applied to improve the method. The performance of the proposed new algorithm was studied by using 22 benchmark functions and was compared with original AEA given the same conditions. The experimental results show that the AEA-C clearly outperforms the original AEA for almost all the 22 benchmark functions with 10, 30, 50 dimensions in success rates, solution quality and stability. Furthermore, AEA-C was applied to estimate 6 kinetics parameters of the fermentation dynamics models. The standard deviation of the objective function calculated by the AEA-C is 41.46 and is far less than that of other literatures' results, and the fitting curves obtained by AEA-C are more in line with the actual fermentation process curves.展开更多
Due to the limited transmission resources for data relay in the tracking and data relay satellite system （TDRSS）, there are many job requirements in busy days which will be discarded in the conventional job scheduli...Due to the limited transmission resources for data relay in the tracking and data relay satellite system （TDRSS）, there are many job requirements in busy days which will be discarded in the conventional job scheduling model. Therefore, the improvement of scheduling efficiency in the TDRSS can not only help to increase the resource utilities, but also to reduce the scheduling failure ratio. A model of nonhomogeneous parallel machines scheduling problems with time window （NPM-TW） is firstly built up for the TDRSS, considering the distinct features of the variable preparation time and the nonhomogeneous transmission rates for different types of antennas on each tracking and data relay satellite （TDRS）. Then, an adaptive subsequence adjustment （ASA） framework with evolutionary asymmetric path-relinking （EvAPR） is proposed to solve this problem, in which an asymmetric progressive crossover operation is involved to overcome the local optima by the conventional job inserting methods. The numerical results show that, compared with the classical greedy randomized adaptive search procedure （GRASP） algorithm, the scheduling failure ratio of jobs can be reduced over 11% on average by the proposed ASA with EvAPR.展开更多
The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency...The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.展开更多
In the evolutionary game of the same task for groups,the changes in game rules,personal interests,the crowd size,and external supervision cause uncertain effects on individual decision-making and game results.In the M...In the evolutionary game of the same task for groups,the changes in game rules,personal interests,the crowd size,and external supervision cause uncertain effects on individual decision-making and game results.In the Markov decision framework,a single-task multi-decision evolutionary game model based on multi-agent reinforcement learning is proposed to explore the evolutionary rules in the process of a game.The model can improve the result of a evolutionary game and facilitate the completion of the task.First,based on the multi-agent theory,to solve the existing problems in the original model,a negative feedback tax penalty mechanism is proposed to guide the strategy selection of individuals in the group.In addition,in order to evaluate the evolutionary game results of the group in the model,a calculation method of the group intelligence level is defined.Secondly,the Q-learning algorithm is used to improve the guiding effect of the negative feedback tax penalty mechanism.In the model,the selection strategy of the Q-learning algorithm is improved and a bounded rationality evolutionary game strategy is proposed based on the rule of evolutionary games and the consideration of the bounded rationality of individuals.Finally,simulation results show that the proposed model can effectively guide individuals to choose cooperation strategies which are beneficial to task completion and stability under different negative feedback factor values and different group sizes,so as to improve the group intelligence level.展开更多
In the past few decades, applications of geostationary orbit (GEO) satellites have attracted increasing attention, and with the development of optical technologies, GEO optical satellites have become popular worldwide...In the past few decades, applications of geostationary orbit (GEO) satellites have attracted increasing attention, and with the development of optical technologies, GEO optical satellites have become popular worldwide. This paper proposes a general working pattern for a GEO optical satellite, as well as a target observation mission planning model. After analyzing the requirements of users and satellite control agencies, two objectives are simultaneously considered: maximization of total profit and minimization of satellite attitude maneuver angle. An NSGA-II based multi-objective optimization algorithm is proposed, which contains some heuristic principles in the initialization phase and mutation operator, and is embedded with a traveling salesman problem (TSP) optimization. The validity and performance of the proposed method are verified by extensive numerical simulations that include several types of point target distributions.展开更多
Immune evolutionary algorithms with domain knowledge were presented to solve the problem of simultaneous localization and mapping for a mobile robot in unknown environments. Two operators with domain knowledge were de...Immune evolutionary algorithms with domain knowledge were presented to solve the problem of simultaneous localization and mapping for a mobile robot in unknown environments. Two operators with domain knowledge were designed in algorithms, where the feature of parallel line segments without the problem of data association was used to construct a vaccination operator, and the characters of convex vertices in polygonal obstacle were extended to develop a pulling operator of key point grid. The experimental results of a real mobile robot show that the computational expensiveness of algorithms designed is less than other evolutionary algorithms for simultaneous localization and mapping and the maps obtained are very accurate. Because immune evolutionary algorithms with domain knowledge have some advantages, the convergence rate of designed algorithms is about 44% higher than those of other algorithms.展开更多
This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for...This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for locating and setting of thyristor controlled series capacitor(TCSC) and static var compensator(SVC) using the multi-objective optimization approach named strength pareto multi-objective evolutionary algorithm(SPMOEA). Maximization of the static voltage stability margin(SVSM) and minimizations of real power losses(RPL) and load voltage deviation(LVD) are taken as the goals or three objective functions, when optimally locating multi-type FACTS devices. The performance and effectiveness of the proposed approach has been validated by the simulation results of the IEEE 30-bus and IEEE 118-bus test systems. The proposed approach is compared with non-dominated sorting particle swarm optimization(NSPSO) algorithm. This comparison confirms the usefulness of the multi-objective proposed technique that makes it promising for determination of combinatorial problems of FACTS devices location and setting in large scale power systems.展开更多
A new method to solve dynamic nonlinear constrained optimization problems （DNCOP） is proposed. First, the time （environment） variable period of DNCOP is divided into several equal subperiods. In each subperiod, th...A new method to solve dynamic nonlinear constrained optimization problems （DNCOP） is proposed. First, the time （environment） variable period of DNCOP is divided into several equal subperiods. In each subperiod, the DNCOP is approximated by a static nonlinear constrained optimization problem （SNCOP）. Second, for each SNCOP, inspired by the idea of multiobjective optimization, it is transformed into a static bi-objective optimization problem. As a result, the original DNCOP is approximately transformed into several static bi-objective optimization problems. Third, a new multiobjective evolutionary algorithm is proposed based on a new selection operator and an improved nonuniformity mutation operator. The simulation results indicate that the proposed algorithm is effective for DNCOP.展开更多
Autonomous cooperation of unmanned swarms is the research focus on“new combat forces”and“disruptive technologies”in military fields.The mechanism design is the fundamental way to realize autonomous cooperation.Fac...Autonomous cooperation of unmanned swarms is the research focus on“new combat forces”and“disruptive technologies”in military fields.The mechanism design is the fundamental way to realize autonomous cooperation.Facing the realistic requirements of a swarm network dynamic adjustment under the background of high dynamics and strong confrontation and aiming at the optimization of the coordination level,an adaptive dynamic reconfiguration mechanism of unmanned swarm topology based on an evolutionary game is designed.This paper analyzes military requirements and proposes the basic framework of autonomous cooperation of unmanned swarms,including the emergence of swarm intelligence,information network construction and collaborative mechanism design.Then,based on the framework,the adaptive dynamic reconfiguration mechanism is discussed in detail from two aspects:topology dynamics and strategy dynamics.Next,the unmanned swarms’community network is designed,and the network characteristics are analyzed.Moreover,the mechanism characteristics are analyzed by numerical simulation,focusing on the impact of key parameters,such as cost,benefit coefficient and adjustment rate on the level of swarm cooperation.Finally,the conclusion is made,which is expected to provide a theoretical reference and decision support for cooperative mode design and combat effectiveness generation of unmanned swarm operations.展开更多
The decomposition based approach decomposes a multi-objective problem into a series of single objective subproblems, which are optimized along contours towards the ideal point. But non-dominated solutions cannot sprea...The decomposition based approach decomposes a multi-objective problem into a series of single objective subproblems, which are optimized along contours towards the ideal point. But non-dominated solutions cannot spread uniformly, since the Pareto front shows different features, such as concave and convex. To improve the distribution uniformity of non-dominated solutions, a bidirectional decomposition based approach that constructs two search directions is proposed to provide a uniform distribution no matter what features problems have. Since two populations along two search directions show differently on diversity and convergence, an adaptive neighborhood selection approach is presented to choose suitable parents for the offspring generation. In order to avoid the problem of the shrinking search region caused by the close distance of the ideal and nadir points, a reference point update approach is presented. The performance of the proposed algorithm is validated with four state-of-the-art algorithms. Experimental results demonstrate the superiority of the proposed algorithm on all considered test problems.展开更多
Evolutionary algorithms(EAs)were shown to be effective for complex constrained optimization problems.However,inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence reg...Evolutionary algorithms(EAs)were shown to be effective for complex constrained optimization problems.However,inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence regions.In this paper,we propose an iterative dynamic diversity evolutionary algorithm(IDDEA)with contractive subregions guiding exploitation through local extrema to the global optimum in suitable steps.In IDDEA,a novel optimum estimation strategy with multi-agents evolving diversely is suggested to e?ciently compute dominance trend and establish a subregion.In addition,a subregion converging iteration is designed to redistrict a smaller subregion in current subregion for next iteration,which is based on a special dominance estimation scheme.Meanwhile,an infimum penalty function is embedded into IDDEA to judge agents and penalize adaptively the unfeasible agents with the lowest fitness of feasible agents.Furthermore,several engineering design optimization problems taken from the specialized literature are successfully solved by the present algorithm with high reliable solutions.展开更多
There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced se...There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.展开更多
A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not ...A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time, with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.展开更多
The gene sod in Acidithiobacillusferrooxidans may play a crucial role in its tolerance to the extremely acidic, toxic and oxidative environment of bioleaching. For insight into the anti-toxic mechanism of the bacteria...The gene sod in Acidithiobacillusferrooxidans may play a crucial role in its tolerance to the extremely acidic, toxic and oxidative environment of bioleaching. For insight into the anti-toxic mechanism of the bacteria, a three-dimensional （3D） molecular structure of the protein encoded by this gene was built by homology modeling techniques, refined by molecular dynamics simulations, assessed by PROFILE-3D and PROSTAT programs and its key residues were further detected by evolutionary trace analysis. Through these procedures, some trace residues were identified and spatially clustered. Among them, the residues of Asn38, Glyl03 and Glul61 are randomly scattered throughout the mapped structure; interestingly, the other residues are all distinctly clustered in a subgroup near Fe atom. From these results, this gene can be confirmed at 3D level to encode the Fe-depending superoxide dismutase and subsequently play an anti-toxic role. Furthermore, the detected key residues around Fe binding site can be conjectured to be directly responsible for Fe binding and catalytic function.展开更多
A modification of evolutionary programming or evolution strategies for ndimensional global optimization is proposed. Based on the ergodicity and inherentrandomness of chaos, the main characteristic of the new algorith...A modification of evolutionary programming or evolution strategies for ndimensional global optimization is proposed. Based on the ergodicity and inherentrandomness of chaos, the main characteristic of the new algorithm which includes two phases is that chaotic behavior is exploited to conduct a rough search of the problem space in order to find the promising individuals in Phase I. Adjustment strategy of steplength and intensive searches in Phase II are employed. The population sequences generated by the algorithm asymptotically converge to global optimal solutions with probability one. The proposed algorithm is applied to several typical test problems. Numerical results illustrate that this algorithm can more efficiently solve complex global optimization problems than evolutionary programming and evolution strategies in most cases.展开更多
This paper analyzes a problem processing mechanism in a new collaboration system between the main manufacturer and the supplier in the"main manufacturer-supplier"mode,which has been widely applied in the col...This paper analyzes a problem processing mechanism in a new collaboration system between the main manufacturer and the supplier in the"main manufacturer-supplier"mode,which has been widely applied in the collaborative development management of the complex product.This paper adopts the collaboration theory,the evolutionary game theory and numerical simulation to analyze the decision-making mechanism where one upstream supplier and one downstream manufacturer must process an unpredicted problem without any advance contract in common.Results show that both players'decision-makings are in some correlation with the initial state,income impact coefficients,and dealing cost.It is worth noting that only the initial state influences the final decision,while income impact coefficients and dealing cost just influence the decision process.This paper shows reasonable and practical suggestions for the manufacturer and supplier in a new collaboration system for the first time and is dedicated to the managerial implications on reducing risks of processing problems.展开更多
Focussing on unification of concrete portions into a generic form of computational evolution,a generalized theoretical framework is necessary and imperative to be built to construct a universal computational theory of...Focussing on unification of concrete portions into a generic form of computational evolution,a generalized theoretical framework is necessary and imperative to be built to construct a universal computational theory of evolution machine.The NP problem solving capacity can be traced to the nature of metaevolution mechanism with emergence features that determine corresponding homeostasis and diversity ranging in the domain of nonlinnear mapping from genotype to phenotype.In this paper a criterion that guarantees the global optimality of evolutionary computation process is proposed and proven rigorously.The global optimization criterion obtained is based on the nonparametric measarement for the whole evolution system and has great flexibility and evolvability.It leaves room for evolutionary system designing and developement.The formulization of the global description in statistical manifold space of information object family expresses evoluable evolutionary operator architecture and operation procedure in terms of evolution by evolution.The theoretical results are helpful to applications such as machine learning for automatic knowledge acquisition,pattern classification and recognition of complex images(e.q.OCR) and unsupervised system identification of nonlinear dynamical systems as well as chaos phenomena.The kernal of the formal system guided by global evolutionary optimization is proper to the implementation with objectoriented programming paradigm and abstract machine modelling.展开更多
With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evoluti...With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evolutionary programming （CSEP） algorithm. This method brings up the manner of that a cognitive agent inherits a paradigm in clustering to enable the cognitive agent to acquire a chaotic mutation operator in the betrayal. As proven in the experiment, this method can not only effectively increase web clustering efficiency, but it can also practically improve the precision of web clustering.展开更多
Responsive orbits have exhibited advantages in emergencies for their excellent responsiveness and coverage to targets.Generally,there are several conflicting metrics to trade in the orbit design for responsive space.A...Responsive orbits have exhibited advantages in emergencies for their excellent responsiveness and coverage to targets.Generally,there are several conflicting metrics to trade in the orbit design for responsive space.A special multiple-objective genetic algorithm,namely the Nondominated Sorting Genetic AlgorithmⅡ(NSGAⅡ),is used to design responsive orbits.This algorithm has considered the conflicting metrics of orbits to achieve the optimal solution,including the orbital elements and launch programs of responsive vehicles.Low-Earth fast access orbits and low-Earth repeat coverage orbits,two subtypes of responsive orbits,can be designed using NSGAI under given metric tradeoffs,number of vehicles,and launch mode.By selecting the optimal solution from the obtained Pareto fronts,a designer can process the metric tradeoffs conveniently in orbit design.Recurring to the flexibility of the algorithm,the NSGAI promotes the responsive orbit design further.展开更多
基金supported by the National Natural Science Foundation of China(62076225,62073300)the Natural Science Foundation for Distinguished Young Scholars of Hubei(2019CFA081)the Fundamental Research Funds for the Central Universities,China University of Geosciences(Wuhan)(CUGGC03).
文摘Surrogate models have shown to be effective in assisting evolutionary algorithms(EAs)for solving computationally expensive complex optimization problems.However,the effectiveness of the existing surrogate-assisted evolutionary algorithms still needs to be improved.A data-driven evolutionary sampling optimization(DESO)framework is proposed,where at each generation it randomly employs one of two evolutionary sampling strategies,surrogate screening and surrogate local search based on historical data,to effectively balance global and local search.In DESO,the radial basis function(RBF)is used as the surrogate model in the sampling strategy,and different degrees of the evolutionary process are used to sample candidate points.The sampled points by sampling strategies are evaluated,and then added into the database for the updating surrogate model and population in the next sampling.To get the insight of DESO,extensive experiments and analysis of DESO have been performed.The proposed algorithm presents superior computational efficiency and robustness compared with five state-of-the-art algorithms on benchmark problems from 20 to 200 dimensions.Besides,DESO is applied to an airfoil design problem to show its effectiveness.
基金Projects(20976048, 21176072) supported by the National Natural Science Foundation of ChinaProject provided by the Fundamental Research Fund for Central Universities
文摘In this work, focusing on the demerit of AEA (Alopex-based evolutionary algorithm) algorithm, an improved AEA algorithm (AEA-C) which was fused AEA with clonal selection algorithm was proposed. Considering the irrationality of the method that generated candidate solutions at each iteration of AEA, clonal selection algorithm could be applied to improve the method. The performance of the proposed new algorithm was studied by using 22 benchmark functions and was compared with original AEA given the same conditions. The experimental results show that the AEA-C clearly outperforms the original AEA for almost all the 22 benchmark functions with 10, 30, 50 dimensions in success rates, solution quality and stability. Furthermore, AEA-C was applied to estimate 6 kinetics parameters of the fermentation dynamics models. The standard deviation of the objective function calculated by the AEA-C is 41.46 and is far less than that of other literatures' results, and the fitting curves obtained by AEA-C are more in line with the actual fermentation process curves.
基金supported by the National Natural Science Foundation of China(6113200291338101+3 种基金91338108)the National S&T Major Project(2011ZX03004-001-01)the Research Fund of Tsinghua University(2011Z05117)the Co-innovation Laboratory of Aerospace Broadband Network Technology
文摘Due to the limited transmission resources for data relay in the tracking and data relay satellite system （TDRSS）, there are many job requirements in busy days which will be discarded in the conventional job scheduling model. Therefore, the improvement of scheduling efficiency in the TDRSS can not only help to increase the resource utilities, but also to reduce the scheduling failure ratio. A model of nonhomogeneous parallel machines scheduling problems with time window （NPM-TW） is firstly built up for the TDRSS, considering the distinct features of the variable preparation time and the nonhomogeneous transmission rates for different types of antennas on each tracking and data relay satellite （TDRS）. Then, an adaptive subsequence adjustment （ASA） framework with evolutionary asymmetric path-relinking （EvAPR） is proposed to solve this problem, in which an asymmetric progressive crossover operation is involved to overcome the local optima by the conventional job inserting methods. The numerical results show that, compared with the classical greedy randomized adaptive search procedure （GRASP） algorithm, the scheduling failure ratio of jobs can be reduced over 11% on average by the proposed ASA with EvAPR.
基金Project(50775089)supported by the National Natural Science Foundation of ChinaProject(2007AA04Z190,2009AA043301)supported by the National High Technology Research and Development Program of ChinaProject(2005CB724100)supported by the National Basic Research Program of China
文摘The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.
基金supported by the National Key R&D Program of China(2017YFB1400105).
文摘In the evolutionary game of the same task for groups,the changes in game rules,personal interests,the crowd size,and external supervision cause uncertain effects on individual decision-making and game results.In the Markov decision framework,a single-task multi-decision evolutionary game model based on multi-agent reinforcement learning is proposed to explore the evolutionary rules in the process of a game.The model can improve the result of a evolutionary game and facilitate the completion of the task.First,based on the multi-agent theory,to solve the existing problems in the original model,a negative feedback tax penalty mechanism is proposed to guide the strategy selection of individuals in the group.In addition,in order to evaluate the evolutionary game results of the group in the model,a calculation method of the group intelligence level is defined.Secondly,the Q-learning algorithm is used to improve the guiding effect of the negative feedback tax penalty mechanism.In the model,the selection strategy of the Q-learning algorithm is improved and a bounded rationality evolutionary game strategy is proposed based on the rule of evolutionary games and the consideration of the bounded rationality of individuals.Finally,simulation results show that the proposed model can effectively guide individuals to choose cooperation strategies which are beneficial to task completion and stability under different negative feedback factor values and different group sizes,so as to improve the group intelligence level.
基金supported by the National Natural Science Foundation of China(7150118061473301)
文摘In the past few decades, applications of geostationary orbit (GEO) satellites have attracted increasing attention, and with the development of optical technologies, GEO optical satellites have become popular worldwide. This paper proposes a general working pattern for a GEO optical satellite, as well as a target observation mission planning model. After analyzing the requirements of users and satellite control agencies, two objectives are simultaneously considered: maximization of total profit and minimization of satellite attitude maneuver angle. An NSGA-II based multi-objective optimization algorithm is proposed, which contains some heuristic principles in the initialization phase and mutation operator, and is embedded with a traveling salesman problem (TSP) optimization. The validity and performance of the proposed method are verified by extensive numerical simulations that include several types of point target distributions.
基金Projects(60234030 60404021) supported by the National Natural Science Foundation of China
文摘Immune evolutionary algorithms with domain knowledge were presented to solve the problem of simultaneous localization and mapping for a mobile robot in unknown environments. Two operators with domain knowledge were designed in algorithms, where the feature of parallel line segments without the problem of data association was used to construct a vaccination operator, and the characters of convex vertices in polygonal obstacle were extended to develop a pulling operator of key point grid. The experimental results of a real mobile robot show that the computational expensiveness of algorithms designed is less than other evolutionary algorithms for simultaneous localization and mapping and the maps obtained are very accurate. Because immune evolutionary algorithms with domain knowledge have some advantages, the convergence rate of designed algorithms is about 44% higher than those of other algorithms.
文摘This work proposes a novel approach for multi-type optimal placement of flexible AC transmission system(FACTS) devices so as to optimize multi-objective voltage stability problem. The current study discusses a way for locating and setting of thyristor controlled series capacitor(TCSC) and static var compensator(SVC) using the multi-objective optimization approach named strength pareto multi-objective evolutionary algorithm(SPMOEA). Maximization of the static voltage stability margin(SVSM) and minimizations of real power losses(RPL) and load voltage deviation(LVD) are taken as the goals or three objective functions, when optimally locating multi-type FACTS devices. The performance and effectiveness of the proposed approach has been validated by the simulation results of the IEEE 30-bus and IEEE 118-bus test systems. The proposed approach is compared with non-dominated sorting particle swarm optimization(NSPSO) algorithm. This comparison confirms the usefulness of the multi-objective proposed technique that makes it promising for determination of combinatorial problems of FACTS devices location and setting in large scale power systems.
基金supported by the National Natural Science Foundation of China (60374063)the Natural Science Basic Research Plan Project in Shaanxi Province (2006A12)+1 种基金the Science and Technology Research Project of the Educational Department in Shaanxi Province (07JK180)the Emphasis Research Plan Project of Baoji University of Arts and Science (ZK0840)
文摘A new method to solve dynamic nonlinear constrained optimization problems （DNCOP） is proposed. First, the time （environment） variable period of DNCOP is divided into several equal subperiods. In each subperiod, the DNCOP is approximated by a static nonlinear constrained optimization problem （SNCOP）. Second, for each SNCOP, inspired by the idea of multiobjective optimization, it is transformed into a static bi-objective optimization problem. As a result, the original DNCOP is approximately transformed into several static bi-objective optimization problems. Third, a new multiobjective evolutionary algorithm is proposed based on a new selection operator and an improved nonuniformity mutation operator. The simulation results indicate that the proposed algorithm is effective for DNCOP.
基金supported by the National Natural Science Foundation of China(71901217)the Key Primary Research Project of Primary Strengthening Program(2020-JCJQ-ZD-007).
文摘Autonomous cooperation of unmanned swarms is the research focus on“new combat forces”and“disruptive technologies”in military fields.The mechanism design is the fundamental way to realize autonomous cooperation.Facing the realistic requirements of a swarm network dynamic adjustment under the background of high dynamics and strong confrontation and aiming at the optimization of the coordination level,an adaptive dynamic reconfiguration mechanism of unmanned swarm topology based on an evolutionary game is designed.This paper analyzes military requirements and proposes the basic framework of autonomous cooperation of unmanned swarms,including the emergence of swarm intelligence,information network construction and collaborative mechanism design.Then,based on the framework,the adaptive dynamic reconfiguration mechanism is discussed in detail from two aspects:topology dynamics and strategy dynamics.Next,the unmanned swarms’community network is designed,and the network characteristics are analyzed.Moreover,the mechanism characteristics are analyzed by numerical simulation,focusing on the impact of key parameters,such as cost,benefit coefficient and adjustment rate on the level of swarm cooperation.Finally,the conclusion is made,which is expected to provide a theoretical reference and decision support for cooperative mode design and combat effectiveness generation of unmanned swarm operations.
文摘The decomposition based approach decomposes a multi-objective problem into a series of single objective subproblems, which are optimized along contours towards the ideal point. But non-dominated solutions cannot spread uniformly, since the Pareto front shows different features, such as concave and convex. To improve the distribution uniformity of non-dominated solutions, a bidirectional decomposition based approach that constructs two search directions is proposed to provide a uniform distribution no matter what features problems have. Since two populations along two search directions show differently on diversity and convergence, an adaptive neighborhood selection approach is presented to choose suitable parents for the offspring generation. In order to avoid the problem of the shrinking search region caused by the close distance of the ideal and nadir points, a reference point update approach is presented. The performance of the proposed algorithm is validated with four state-of-the-art algorithms. Experimental results demonstrate the superiority of the proposed algorithm on all considered test problems.
基金Supported by National Natural Science Foundation of China(61074020)
文摘Evolutionary algorithms(EAs)were shown to be effective for complex constrained optimization problems.However,inflexible exploration in general EAs would lead to losing the global optimum nearby the ill-convergence regions.In this paper,we propose an iterative dynamic diversity evolutionary algorithm(IDDEA)with contractive subregions guiding exploitation through local extrema to the global optimum in suitable steps.In IDDEA,a novel optimum estimation strategy with multi-agents evolving diversely is suggested to e?ciently compute dominance trend and establish a subregion.In addition,a subregion converging iteration is designed to redistrict a smaller subregion in current subregion for next iteration,which is based on a special dominance estimation scheme.Meanwhile,an infimum penalty function is embedded into IDDEA to judge agents and penalize adaptively the unfeasible agents with the lowest fitness of feasible agents.Furthermore,several engineering design optimization problems taken from the specialized literature are successfully solved by the present algorithm with high reliable solutions.
基金supported by the Aviation Science Funds of China(2010ZC13012)the Fund of Jiangsu Innovation Program for Graduate Education (CXLX11 0203)
文摘There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.
文摘A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time, with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.
基金Project(2004CB619201) supported by the National Basic Research Program of ChinaProject (50321402) supported by the National Natural Science Foundation of China
文摘The gene sod in Acidithiobacillusferrooxidans may play a crucial role in its tolerance to the extremely acidic, toxic and oxidative environment of bioleaching. For insight into the anti-toxic mechanism of the bacteria, a three-dimensional （3D） molecular structure of the protein encoded by this gene was built by homology modeling techniques, refined by molecular dynamics simulations, assessed by PROFILE-3D and PROSTAT programs and its key residues were further detected by evolutionary trace analysis. Through these procedures, some trace residues were identified and spatially clustered. Among them, the residues of Asn38, Glyl03 and Glul61 are randomly scattered throughout the mapped structure; interestingly, the other residues are all distinctly clustered in a subgroup near Fe atom. From these results, this gene can be confirmed at 3D level to encode the Fe-depending superoxide dismutase and subsequently play an anti-toxic role. Furthermore, the detected key residues around Fe binding site can be conjectured to be directly responsible for Fe binding and catalytic function.
文摘A modification of evolutionary programming or evolution strategies for ndimensional global optimization is proposed. Based on the ergodicity and inherentrandomness of chaos, the main characteristic of the new algorithm which includes two phases is that chaotic behavior is exploited to conduct a rough search of the problem space in order to find the promising individuals in Phase I. Adjustment strategy of steplength and intensive searches in Phase II are employed. The population sequences generated by the algorithm asymptotically converge to global optimal solutions with probability one. The proposed algorithm is applied to several typical test problems. Numerical results illustrate that this algorithm can more efficiently solve complex global optimization problems than evolutionary programming and evolution strategies in most cases.
基金supported by the National Natural Science Foundation of China(7117111271502073)。
文摘This paper analyzes a problem processing mechanism in a new collaboration system between the main manufacturer and the supplier in the"main manufacturer-supplier"mode,which has been widely applied in the collaborative development management of the complex product.This paper adopts the collaboration theory,the evolutionary game theory and numerical simulation to analyze the decision-making mechanism where one upstream supplier and one downstream manufacturer must process an unpredicted problem without any advance contract in common.Results show that both players'decision-makings are in some correlation with the initial state,income impact coefficients,and dealing cost.It is worth noting that only the initial state influences the final decision,while income impact coefficients and dealing cost just influence the decision process.This paper shows reasonable and practical suggestions for the manufacturer and supplier in a new collaboration system for the first time and is dedicated to the managerial implications on reducing risks of processing problems.
文摘Focussing on unification of concrete portions into a generic form of computational evolution,a generalized theoretical framework is necessary and imperative to be built to construct a universal computational theory of evolution machine.The NP problem solving capacity can be traced to the nature of metaevolution mechanism with emergence features that determine corresponding homeostasis and diversity ranging in the domain of nonlinnear mapping from genotype to phenotype.In this paper a criterion that guarantees the global optimality of evolutionary computation process is proposed and proven rigorously.The global optimization criterion obtained is based on the nonparametric measarement for the whole evolution system and has great flexibility and evolvability.It leaves room for evolutionary system designing and developement.The formulization of the global description in statistical manifold space of information object family expresses evoluable evolutionary operator architecture and operation procedure in terms of evolution by evolution.The theoretical results are helpful to applications such as machine learning for automatic knowledge acquisition,pattern classification and recognition of complex images(e.q.OCR) and unsupervised system identification of nonlinear dynamical systems as well as chaos phenomena.The kernal of the formal system guided by global evolutionary optimization is proper to the implementation with objectoriented programming paradigm and abstract machine modelling.
文摘With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evolutionary programming （CSEP） algorithm. This method brings up the manner of that a cognitive agent inherits a paradigm in clustering to enable the cognitive agent to acquire a chaotic mutation operator in the betrayal. As proven in the experiment, this method can not only effectively increase web clustering efficiency, but it can also practically improve the precision of web clustering.
文摘Responsive orbits have exhibited advantages in emergencies for their excellent responsiveness and coverage to targets.Generally,there are several conflicting metrics to trade in the orbit design for responsive space.A special multiple-objective genetic algorithm,namely the Nondominated Sorting Genetic AlgorithmⅡ(NSGAⅡ),is used to design responsive orbits.This algorithm has considered the conflicting metrics of orbits to achieve the optimal solution,including the orbital elements and launch programs of responsive vehicles.Low-Earth fast access orbits and low-Earth repeat coverage orbits,two subtypes of responsive orbits,can be designed using NSGAI under given metric tradeoffs,number of vehicles,and launch mode.By selecting the optimal solution from the obtained Pareto fronts,a designer can process the metric tradeoffs conveniently in orbit design.Recurring to the flexibility of the algorithm,the NSGAI promotes the responsive orbit design further.
