CAJ | 학술논문

旅行商问题是组合优化中一个广泛研究的NP-hard问题。本文引入了一种新的运算方式：基因片段插入，并利用此运算给出了一种求解旅行商问题的演化算法。实验结果表明，此算法能以较高的概率找到旅行商问题的近似最优解。
여행상문제시조합우화중일개엄범연구적NP-hard문제。본문인입료일충신적운산방식：기인편단삽입，병이용차운산급출료일충구해여행상문제적연화산법。실험결과표명，차산법능이교고적개솔조도여행상문제적근사최우해。
The traveling salesman problem (TSP) is a NP-hard problem which widely studied in combinatorial optimization dom-ain. A new operator, named gene fragment inserting, is proposed in this paper. By using this operator, an evolution algorithm for solving travel salesman problem is presented. Experiment results show that the proposed algorithm can find an approximate optimal solution for TSP with a high probability.