customization issue about isula HOT 4 CLOSED

Hello @drissDean !

Isula's implementation of ACO algorithms look for solutions with the minimum cost. These solutions are generated by instances of Ant, and the cost is obtained by the method Ant::getSolutionCost(). In a TSP instance, the cost is expressed in terms of distance. If you have a different cost metric, just override Ant::getSolutionCost() with the logic that suits your domain.

from isula.

Thank you very much.
I'm striving to keep the minimum cost too. The issue with the Euclidean system is that no two cities in a country are joined with a straightforward path. We can even find watercourses or other things we would have to bypass and that would make the distance much longer. So I need to take into account certain real factors for the system I have to build. I actually try to deliver the best itinerary given the actual traffic data, not only distances between points.
Since I've taken the aco-acs-tsp implementation, then I have to create my own class which would extend AntForTsp class (and overload the getSolutionCost() method) and use it anywhere we had AntForTsp class before?

from isula.

Hi @drissDean ,

I would approach it this way:

1. Extend AntForTsp , for example CustomAntForTsp, overriding getSolutionCost(). According to your problem, you might also need to override getHeuristicValue().
2. Use these new type CustomAntForTsp when creating the AntColony instance for your AcoProblemSolver. Take a look at the getAntColony method at AcoTspWithIsula.

Good luck!

from isula.

Alright, sir. Thank you so much.

from isula.