Lin-Kernighan-Heuristic-approach-to-solving-TSP

The LK Heuristic is used to solve the Traveling Salesman Problem.

Step 1

Compile Code

g++ LKMain.cpp LKMatrix.cpp -o LKSolver

Run Code

./exec.sh <input_file> out.tsp

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
test_data		test_data
LKMain.cpp		LKMain.cpp
LKMatrix.cpp		LKMatrix.cpp
LKMatrix.h		LKMatrix.h
LKSolver		LKSolver
README.md		README.md
exec.sh		exec.sh
out.tsp		out.tsp
p.tsp		p.tsp
run_program		run_program
sample_1.tsp		sample_1.tsp
sample_test.tsp		sample_test.tsp
tsp.jar		tsp.jar