基于Grefenstette编码和2-opt优化的遗传算法

将Grefenstette编码和2-opt优化算法共同运用到遗传算法中，采用一定数目的城市坐标对路径搜索进行求解。仿真试验取得良好的效果，初始路径接近最优路径，且经过122次迭代后快速得到最优路径。证明本研究提出的搜索空间路径方案实现了遗传算法可以快速收敛到最优解，同时保持较强的搜索能力，实现全局最优，又可以防止陷入局部最优。

Genetic algorithm based on Grefenstette coding and 2-opt optimized

Grefenstette coding and 2-opt were applied simultaneously into genetic algorithm to obtain the space searching path, using a certain number of city coordinates. The synthetic experimentation achieved good result: the optimal path could be approximately represented by initial path, and could be accurately achieved via 122 iterations. And this result demonstrated that the proposed solution of search space path enabled genetic algorithm quickly converge to the optimal solution, maintained a strong search capability, achieved global optimization, and prevented local optimum.