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.展开更多
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.展开更多
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.展开更多
Scheduling jobs on parallel machines to minimize the total tardiness（p//T） is proved to be NP hard.A new ant colony algorithm to deal with p//T（p//T ACO） is addressed, and the computing model of mapping p//T to th...Scheduling jobs on parallel machines to minimize the total tardiness（p//T） is proved to be NP hard.A new ant colony algorithm to deal with p//T（p//T ACO） is addressed, and the computing model of mapping p//T to the ant colony optimization environment is designed.Besides, based on the academic researches on p//T, some new properties used in the evolutionary computation are analyzed and proved.The theoretical analysis and comparative experiments demonstrate that p//T ACO has much better performance and can be used to solve practical large scale problems efficiently.展开更多
An improved particle swarm optimization (PSO) algorithm based on ensemble technique is presented. The algorithm combines some previous best positions (pbest) of the particles to get an ensemble position (Epbest), whic...An improved particle swarm optimization (PSO) algorithm based on ensemble technique is presented. The algorithm combines some previous best positions (pbest) of the particles to get an ensemble position (Epbest), which is used to replace the global best position (gbest). It is compared with the standard PSO algorithm invented by Kennedy and Eberhart and some improved PSO algorithms based on three different benchmark functions. The simulation results show that the improved PSO based on ensemble technique can get better solutions than the standard PSO and some other improved algorithms under all test cases.展开更多
文摘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.
文摘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.
基金国家自然科学基金(the National Natural Science Foundation of China under Grant No.60473012)国家科技公关计划项目(the KeyTechnologies R&D Program of China under Grant No.2003BA614A-14)+1 种基金江苏省自然科学基金(the Natural Science Foundation of JiangsuProvince of China under Grant No.BK2005047)南京大学软件新技术国家重点实验室开放基金。
文摘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.
基金supported by the National Natural Science Foundation of China (60573159)
文摘Scheduling jobs on parallel machines to minimize the total tardiness（p//T） is proved to be NP hard.A new ant colony algorithm to deal with p//T（p//T ACO） is addressed, and the computing model of mapping p//T to the ant colony optimization environment is designed.Besides, based on the academic researches on p//T, some new properties used in the evolutionary computation are analyzed and proved.The theoretical analysis and comparative experiments demonstrate that p//T ACO has much better performance and can be used to solve practical large scale problems efficiently.
文摘An improved particle swarm optimization (PSO) algorithm based on ensemble technique is presented. The algorithm combines some previous best positions (pbest) of the particles to get an ensemble position (Epbest), which is used to replace the global best position (gbest). It is compared with the standard PSO algorithm invented by Kennedy and Eberhart and some improved PSO algorithms based on three different benchmark functions. The simulation results show that the improved PSO based on ensemble technique can get better solutions than the standard PSO and some other improved algorithms under all test cases.
