基于基因表达式编程的TSP问题求解

利用遗传算法求解组合优化问题时，需要特有的遗传算子，才能在候选解空间中有效搜索和进化。基因表达式编程（GEP）是进化计算家族的新成员。旅游商问题（TSP）是典型的组合优化问题，得到了广泛的研究，它的研究成果将对求解NP类问题产生重要影响。基于基因表达式编程（GEP）来解决TSP问题，引入适用组合优化的遗传算子：逆串，基因串的删/插等，最后进行了实验，展示GEP解决TSP问题的方法。实验表明GEP能有效解决TSP问题，设计的系统是强壮健康，其求解速度快且解的质量好。

Method of TSP problem based on gene expression programming

Combinatorial optimization problem requires specific genetic operators so that populations of candidate solution can evolve efficiently.Gene Expression Programming(GEP) is a new member of computational algorithms.TSP problem delegates a classic combinatorial optimization problem.It is also one of combinatorial optimization which has been gained extensive research.The research fruit will help to solve to NP-hard question.Solving TSP problem based on gene expression programming will be presented this paper.Especial genetic operators are introduced inversion and insertion/deletion gene.At last the study of experiment is presented,the results indicate this algorithm is fast and can obtain good quality solutions.