TSP 문제를 search-based로 근사적인 해를 구하는 알고리즘
먼저 greedy 기반의 seeding을 적용하고,
- genetic algorithm
- simulated annealing
- steepest ascent
의 방식을 통하여 문제 해결 시도
Finding the nearest solution of TSP problem by using search-based algorithm
First giving seeding based on greedy,
- genetic algorithm
- simulated annealing
- steepest ascent
trying above algorithm to find solution