Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (23): 53-55.DOI: 10.3778/j.issn.1002-8331.2008.23.016
• 理论研究 • Previous Articles Next Articles
ZHU Ming-fang
Received:
Revised:
Online:
Published:
Contact:
朱明放
通讯作者:
Abstract: 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.
Key words: TSP problem, Gene Expression Programming(GEP), inversion, insertion/deletion sequence
摘要: 利用遗传算法求解组合优化问题时,需要特有的遗传算子,才能在候选解空间中有效搜索和进化。基因表达式编程(GEP)是进化计算家族的新成员。旅游商问题(TSP)是典型的组合优化问题,得到了广泛的研究,它的研究成果将对求解NP类问题产生重要影响。基于基因表达式编程(GEP)来解决TSP问题,引入适用组合优化的遗传算子:逆串,基因串的删/插等,最后进行了实验,展示GEP解决TSP问题的方法。实验表明GEP能有效解决TSP问题,设计的系统是强壮健康,其求解速度快且解的质量好。
关键词: TSP问题, 基因表达式编程, 逆串算子, 插/删串算子
ZHU Ming-fang. Method of TSP problem based on gene expression programming[J]. Computer Engineering and Applications, 2008, 44(23): 53-55.
朱明放. 基于基因表达式编程的TSP问题求解[J]. 计算机工程与应用, 2008, 44(23): 53-55.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2008.23.016
http://cea.ceaj.org/EN/Y2008/V44/I23/53