this a source code to solve TSP problem with obstacle in warehouse. the distance between nodes is calculated by A* algorithm and SA algorithm within the source code returns the sequence which is best sequence.



how to use the code::

First you need to put how many code you wanna visit.



second please put the x coordinate and y coordinate.



( if you want to change the map information, please change the map in SAFuction class.and also change the width and height.-this is a source code to solve TSP problem with obstacle in warehouse. the distance between nodes is calculated by A* algorithm and SA algorithm within the source code returns the sequence which is best sequence.



how to use the code::

First you need to put how many code you wanna visit.



second please put the x coordinate and y coordinate.



( if you want to change the map information, please change the map in SAFuction class.and also change the width and height.