Python version of LKH algorithm for TSP problem. Only for study.
usage:
>>> python main.py -p vlsi/xqf131.tsp
finish ascent, w=555.71, deg=18
* 0 : 596
* 1 : 586
2 : 603
3 : 595
4 : 608
* 5 : 581
6 : 617
7 : 627
8 : 609
9 : 603
Best result is 581,lower bound is 555.71
Consumes 8.330 seconds