> has anyone used ant colony optimization algorithm for
> finding shortest paths other than for the tsp?
Are you trying to solve a specific problem? Ant Colony Optmization, or
any other meta-heuristic can be applied to any optimization problem.
The results you will get depend on what kind of domain specific
operators (daemon actions) that you have used in the ACO algorithm.
sorry for not being specific and the insubsequent reply. am just doing some research on aco, i want to try and implement it for best bath planning on a map/graph. I've been looking around for some example on such and noticed that this algorithm is mainly used for tsp problem which got me questioning the possibility of my task. I just want to know if it is definitely possible with aco as i will give it a go in this case. Implementing this algorthm successfully is the main challenge of my project so i cannot contemplate another algorithm option. Thanks for your time.