遗传算法提供了求解非线性规划的通用框架，它不依赖于问题的具体领域。遗传算法的优点是将问题参数编码成染色体后进行优化， 而不针对参数本身， 从而不受函数约束条件的限制； 搜索过程从问题解的一个集合开始， 而不是单个个体， 具有隐含并行搜索特性， 可大大减少陷入局部最小的可能性。而且优化计算时算法不依赖于梯度信息，且不要求目标函数连续及可导，使其适于求解传统搜索方法难以解决的大规模、非线性组合优化问题。(Genetic algorithm provides a general fr a mework for solving nonlinear programming, which does not depend on the specific problem domain. The advantage of genetic algorithm is that the problem parameters are encoded into chromosomes for optimization, rather than the parameters themselves. The search process starts from a set of problem solutions, rather than a single individual, and has the implicit parallel search feature, which can greatly reduce the possibility of falling into the local minimum. Moreover, the algorithm does not rely on gradient information and does not require the objective function to be continuous and differentiable, which makes it suitable for solving large-scale and nonlinear combinatorial optimization problems that are difficult to be solved by traditional search methods.)