A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similar...A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.展开更多
A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that...A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that AGA takes objective function as adaptability function directly,so it cuts down some unnecessary time expense because of float-point calculation of function conversion.The difference from SAA is that AGA need not execute a very long Markov chain iteration at each point of temperature, so it speeds up the convergence of solution and makes no assumption on the search space,so it is simple and easy to be implemented.It can be applied to a wide class of problems.The optimizing principle and the implementing steps of AGA were expounded. The example of the parameter optimization of a typical complex electromechanical system named temper mill shows that AGA is effective and superior to the conventional GA and SAA.The control system of temper mill optimized by AGA has the optimal performance in the adjustable ranges of its parameters.展开更多
This paper presents an adaptive fuzzy control scheme based on modified genetic algorithm. In the control scheme, genetic algorithm is used to optimze the nonlinear quantization functions of the controller and some key...This paper presents an adaptive fuzzy control scheme based on modified genetic algorithm. In the control scheme, genetic algorithm is used to optimze the nonlinear quantization functions of the controller and some key parameters of the adaptive control algorithm. Simulation results show that this control scheme has satisfactory performance in MIMO systems, chaotic systems and delay systems.展开更多
A fuzzy modeling method for complex systems is studied. The notation of general stochastic neural network (GSNN) is presented and a new modeling method is given based on the combination of the modified Takagi and Suge...A fuzzy modeling method for complex systems is studied. The notation of general stochastic neural network (GSNN) is presented and a new modeling method is given based on the combination of the modified Takagi and Sugeno's (MTS) fuzzy model and one-order GSNN. Using expectation-maximization(EM) algorithm, parameter estimation and model selection procedures are given. It avoids the shortcomings brought by other methods such as BP algorithm, when the number of parameters is large, BP algorithm is still difficult to apply directly without fine tuning and subjective tinkering. Finally, the simulated example demonstrates the effectiveness.展开更多
针对形状不规则复杂面目标多弹瞄准点优化算法计算效率低、稳定性差、优化能力不足的问题,提出一种基于弹药圆概率偏差(Circular Error Probable,CEP)的毁伤概率矩阵库(Damage Probability Matrix Library,DPML)和改进启发式退火优化机...针对形状不规则复杂面目标多弹瞄准点优化算法计算效率低、稳定性差、优化能力不足的问题,提出一种基于弹药圆概率偏差(Circular Error Probable,CEP)的毁伤概率矩阵库(Damage Probability Matrix Library,DPML)和改进启发式退火优化机制的高效瞄准点优化算法(Efficient Aiming Point Optimization Algorithm,EAPOA)。构建多弹瞄准点优化模型时,除考虑目标形状、导弹毁伤能力外,还考虑导弹直接毁伤、间接毁伤和多弹种联合毁伤等复杂因素对目标毁伤效果的影响。提出一种基于DPML的毁伤概率快速估计算法,提升算法优化效率和鲁棒性;设计一种基于候选瞄准点序列化的优化算法框架,并提出基于全局搜索和改进退火机制的启发式优化算法,降低瞄准点组合求解空间大小并提升算法优化能力。通过6个复杂面目标测试用例验证算法性能。研究结果表明,所提的EAPOA相比于增强精英保留策略遗传算法具有更强的优化能力,且平均优化时间仅为其1/5~1/3,在优化收益和计算效率上具有明显优势。展开更多
文摘A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.
文摘A new searching algorithm named the annealing-genetic algorithm(AGA) was proposed by skillfully merging GA with SAA. It draws on merits of both GA and SAA ,and offsets their shortcomings.The difference from GA is that AGA takes objective function as adaptability function directly,so it cuts down some unnecessary time expense because of float-point calculation of function conversion.The difference from SAA is that AGA need not execute a very long Markov chain iteration at each point of temperature, so it speeds up the convergence of solution and makes no assumption on the search space,so it is simple and easy to be implemented.It can be applied to a wide class of problems.The optimizing principle and the implementing steps of AGA were expounded. The example of the parameter optimization of a typical complex electromechanical system named temper mill shows that AGA is effective and superior to the conventional GA and SAA.The control system of temper mill optimized by AGA has the optimal performance in the adjustable ranges of its parameters.
文摘This paper presents an adaptive fuzzy control scheme based on modified genetic algorithm. In the control scheme, genetic algorithm is used to optimze the nonlinear quantization functions of the controller and some key parameters of the adaptive control algorithm. Simulation results show that this control scheme has satisfactory performance in MIMO systems, chaotic systems and delay systems.
文摘A fuzzy modeling method for complex systems is studied. The notation of general stochastic neural network (GSNN) is presented and a new modeling method is given based on the combination of the modified Takagi and Sugeno's (MTS) fuzzy model and one-order GSNN. Using expectation-maximization(EM) algorithm, parameter estimation and model selection procedures are given. It avoids the shortcomings brought by other methods such as BP algorithm, when the number of parameters is large, BP algorithm is still difficult to apply directly without fine tuning and subjective tinkering. Finally, the simulated example demonstrates the effectiveness.
文摘针对形状不规则复杂面目标多弹瞄准点优化算法计算效率低、稳定性差、优化能力不足的问题,提出一种基于弹药圆概率偏差(Circular Error Probable,CEP)的毁伤概率矩阵库(Damage Probability Matrix Library,DPML)和改进启发式退火优化机制的高效瞄准点优化算法(Efficient Aiming Point Optimization Algorithm,EAPOA)。构建多弹瞄准点优化模型时,除考虑目标形状、导弹毁伤能力外,还考虑导弹直接毁伤、间接毁伤和多弹种联合毁伤等复杂因素对目标毁伤效果的影响。提出一种基于DPML的毁伤概率快速估计算法,提升算法优化效率和鲁棒性;设计一种基于候选瞄准点序列化的优化算法框架,并提出基于全局搜索和改进退火机制的启发式优化算法,降低瞄准点组合求解空间大小并提升算法优化能力。通过6个复杂面目标测试用例验证算法性能。研究结果表明,所提的EAPOA相比于增强精英保留策略遗传算法具有更强的优化能力,且平均优化时间仅为其1/5~1/3,在优化收益和计算效率上具有明显优势。
