A Simulated Annealing Method with Search Space Smoothing for T-Coloring Problem

T-칼라링 문제를 위한 탐색공간 스무딩 Simulated Annealing 방법

Graph Coloring Problem(GCP) is a problem of assigning different colors to nodes which are connected by an edge. An extended form of GCP is TCP (T-coloring problem) and, in TCP, edge weights are added to GCP and it is possible to extend GCP's applications. To solve TCP, in this paper, we propose an improved Simulated Annealing(SA) method with search space smoothing. It has been observed that the improved SA method obtains better results than SA does.