摘要
按照费用函数满足约束条件的不同,可以把广义旅行商问题(GeneralizedTravelingSalesmanProblem,简称GTSP)分为两类。目前,对GTSP解法的研究主要是面向费用函数满足三角不等式的第一类问题,而对于费用函数不满足三角不等式的第二类问题,则研究的比较少。文章针对第二类GTSP问题,提出了在广义染色体中加入虚顶点的新遗传算法。经过14个TSP问题库内的基准问题的测试表明,新算法是有效的。
There are two kinds of Generalized Traveling Salesman Problems （GTSP） corresponding to the different restraint conditions,which the cost functions satisfy.At present,most of the researches have focused on the first case,in which the triangular inequality holds for the cost functions.As for the second one,where the triangular inequality does not hold for the cost functions,there have been few studies.In this paper,a novel genetic algorithm,in which generalized chromosomes with yoid vertices are adopted,is presented to deal with this case.Fourteen benchmark problems are tested by the proposed algorithm.The results show that the proposed algorithm is effective for the second kind of GTSP.
出处
《计算机工程与应用》
CSCD
北大核心
2006年第15期78-81,共4页
Computer Engineering and Applications
