Description: 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.
To Search:
File list (Check if you may need any files):
Logger.java
Node.java
NodeForArrayList.java
Path.java
SAFunction.java
StopWatch.java
TestAStar.java
TSP.java
AreaMap.java
AStar.java
AStarHeuristic.java
ClosestHeuristic.java
Download