一类组合优化问题的混合进化算法

针对问题空间为全排列集合的一类组合优化问题，提出了一种混合进化算法。在自然进位制编码的基础上，算法采用了遗传算法的单点交叉算子和进化规划的高斯扰动算子,并运用了精英保留策略；算法实现时采用逐位运算法实现大数值运算，避免了运算溢出，减少了运算量。分析和模拟计算结果表明，新算法具有可行性、有效性和通用性。

Solving a class of combinatorial optimization problems with mixed evolutionary algorithm

A class of combinatorial optimization problems has the characteristic that problem space can be mapped into a set of permutations. A new method to solve the combinatorial optimization problems with mixed evolutionary algorithm based on natural scale enumerative system coding was proposed in this paper. Elitism strategy, one-point crossover and Gaussian mutation were used in the algorithm. An ingenious method for operation among big parameters was designed, which can avoid overflow and simplify the operation. Simulation results and analysis show that the new method is feasible，effective and all-purpose.