선후행 관계제약을 갖는 TSP 문제의 유전알고리즘 해법

Abstract

I'he traveling salesman problem with precedence relations (TSPPR) is harder than general traveling salesman problem. In this paper we propose an efficient genetic algorithm (GA) to solve the TSPPR. The key concept of the proposed genetic algorithm is a topological sort (TS)' The results of numerical experiments show that the proposed GA approach produces an optimal Solution for the TSPPR.