How can I benchmark an application of ant colony optimization? In my research on video games path finding I'm using ant colony optimization, not only to find the shortest path, but also to add some unpredictability and adaptiveness to bots path finding. It works the way as players move in the map, they add some pheromone to the map, so it adds up a probability that bots choose path like players. I have sent the paper, but judges said you need a benchmark and distinguish to previous works. Can you tell me how can I benchmark this work?
I would assume that in this case, they are asking you to compare the performance of your particular algorithm to other similar algorithms used in pathfinding. For example, A*