[英文文章及翻译.docVIP

　2.1　算法思想的提出 2.1 algorithm proposed ideas 　　所谓赋权汉密尔顿回路最小化问题是指，给定n个点及n个点两两之间的距离(或权数)，求一条回路，使之经过所有的点，且经过每个点仅一次，而整条回路(也称路径或边界)的总距离(或总权数)最小。 The so-called empowerment Hamilton loop minimization problem is to point to, given n points and n points of the distance between (or opposite); a circuit weight, make through all the points, and after each point only once, and the whole loop (also called path or boundary) total distance (or total weighted function) minimum. 　　这一问题总是可以通过枚举法求出其解的，但由于枚举法的计算量过大，达到(n－1)!的数量级，因而，不是可行的方法。由此，人们提出了启发式算法来求解问题的近似解。所谓启发式算法，一般地讲，就是发现某些最优解所具备的特征或不应具备的特征，对应有特征而言，求出含应有特征的可行解；对不应有特征而言，从解空间中剔除不应有特征的解，再从剩余空间中找一个解。因而，启发式算法可以定义为：从最优解的必要条件出发，设计一个有效算法，使之求出的解满足这些必要条件。 This problem can always through the enumeration method find out the solution, but due to the enumeration method of computing dimension, achieve (n - 1)! The magnitude of the issue, therefore, is not feasible method. Thus, people put forward to solve the problem of heuristic algorithm approximate solution. Alleged heuristic algorithm, generally speaking, is that some optimal solution has the characteristics or not should possess the characteristics of concerned, should ask the characteristics of the feasible solution containing should have characteristics; Should not have characteristics of concerned, from the solution space to remove the solution should not feature, and again from the remaining space looking for a solution. Therefore, heuristic algorithm can be defined as: from the optimal solution of the necessary conditions, and to design an effective algorithm, make out the solution meet these necessary condition. 　　就一般算法的本质而言，它是提供一种规范的过程，经由该过程得出的解满足问题最优解的充分条件，即算法应该是问题最优解的充分条件的一种规范实现过程；而算法设计本身要求，算法必须给出解，因此，算法实际上还要满足最优解的必要条件，即算法可以定义为：算法是问题最优解的充分必要条件的一种规范实现过程。 The essence on the general algorithm, it is to provide a standard of process through this process, that the optimal solution meet problem, namely, the sufficient conditions for the existence of the optimal algorithm should be prob