Re: Travelling Salesman Problem and GAs


Vend ha scritto:

Alessandro Presta wrote:

Hello,
I've recently released a multi-threaded C++ library for genetic
algorithms and an example application that finds an approximate
solution to the TSP using GAs.
http://fga.sourceforge.net
I'd like to know your opinions and I hope someone will find it useful.
Greetings,
Alessandro Presta

You call it 'fast', but it actually allocates and deallocates arrays on
the heap on every cycle.

Good suggestion.
I've just released a new version that uses two arrays allocated only
once when the object is created.
Now it should _actually_ be faster.

.