A REAL-VALUED GENETIC ALGORITHM FOR OPTIMIZATION PROBLEM WITH CONTINUOUS VARIABLES

提出一种用于连续变量函数优化的遗传算法。它由一种简单、适应面广的动态刻度适应值和选择算子、杂交与变异算子，以及这些算子相应的自适应概率组成。该算法经两个常用函数检验，并在图象识别的神经网络权值训练中得到应用。实验结果表明，该算法是一种快速有效的全局优化算法。     

一种新的求解TSP问题的杂交算子

TSP(TravelingSalesmanProblem)问题是最经典的NP-hard组合优化问题之一。长期以来,人们一直在寻求快速、高效的近似算法,以便在合理的时间内解决大规模问题。在文[5]提出的两交换启发交叉算子的基础上,通过分析,发现该算子的杂交结果与所选择的首城市有关,因而不同的首城市的选择会大大影响该算子的效率。为此,提出了一种新的有效利用局部信息的杂交算子,该算子能够有效的保存母体信息,进一步摆脱首城市的选择问题。实例仿真证明该算子的有效性。     

舰艇编队防空火力分配问题的改进遗传算法

在建立舰艇编队防空火力分配模型的基础上,设计了求解该问题的改进遗传算法。实验结果表明,该算法可以有效求得舰艇编队防空火力分配问题的最优解或近似最优解,是求解舰艇编队防空火力分配问题的一个较好的方案。     

Improved NSGA-Ⅱ Multi-objective Genetic Algorithm Based on Hybridization-encouraged Mechanism

To improve performances of multi-objective optimization algorithms,such as convergence and diversity,a hybridization-encour-aged mechanism is proposed and realized in elitist nondominated sorting genetic algorithm (NSGA-Ⅱ).This mechanism uses the nor-malized distance to evaluate the difference among genes in a population.Three possible modes of crossover operators-"Max Distance","Min-Max Distance",and "Neighboring-Max"-are suggested and analyzed.The mode of "Neighboring-Max",which not only takes advantage of hybridization but also improves the distribution of the population near Pareto optimal front,is chosen and used in NSGA-II on the basis of hybridization-encouraged mechanism (short for HEM-based NSGA-Ⅱ).To prove the HEM-based algorithm,several problems are studied by using standard NSGA-II and the presented method.Different evaluation criteria are also used to judge these algorithms in terms of distribution of solutions,convergence,diversity,and quality of solutions.The numerical results indicate that the application of hybridization-encouraged mechanism could effectively improve the performances of genetic algorithm.Finally,as an example in engineering practices,the presented method is used to design a longitudinal flight control system,which demonstrates the obtainability of a reasonable and correct Pareto front.     

基于新型自适应遗传算法的混合可靠性优化模型

提出一种新型的自适应遗传算法。结合Logistic函数和余弦函数,对交叉、变异算子曲线进行非线性化处理,实现了交叉算子和变异算子的非线性自适应调整。用新算法求解测试函数,结果表明新算法能够提高收敛速度和精确度,有效地跳出局部收敛,避免早熟现象发生。并基于提出的新型自适应遗传算法,研究了截尾随机-模糊-区间变量的混合可靠性模型的优化问题,建立了以混合可靠性指标作为优化约束条件的混合可靠性优化模型。以某型飞机变速箱同步器系统的优化设计为例,验证了该模型在工程应用中的有效性。     

智能交通系统中车辆调度问题的遗传算法研究

在智能交通系统(ITS, Intellignet Transportation Systems)的各个子系统中,先进的公共交通系统(APTS, Advanced Public Transportation System)具有重要地位和作用,其中车辆调度问题是APTS的关键.为了提高车辆调度的智能化,提出了一种基于遗传算法(GA, Genetic Algorithm)的公交车辆智能调度方法,采用最小费用作为目标函数,考虑了车辆配置、时间、运营效率及资源利用等方面因素,通过选择、交叉及变异等遗传操作,得到了最优的调度排序方案,并对2种交叉方式进行了比较,仿真结果表明,利用GA解决车辆调度问题具有可行性、先进性和快速性.