Travelling salesman problems#
-
namespace problems
Implementations of some benchmark functions that can be used to test the genetic algorithms. There are some benchmark problems implemented for every encoding type, and the real-encoded problems can also be used for the binary-encoded GAs.
All of the problems are implemented for maximization.
class TSP#
#include <problems/travelling_salesman.hpp>
-
class TSP : public gapp::problems::BenchmarkFunction<PermutationGene>#
The base class used for the travelling salesman benchmark functions. The last node is fixed to be the last node of the city list supplied in the ctor. The travelling salesman problems are modified for maximization, so they will always return negative distance values.
Subclassed by gapp::problems::TSP124, gapp::problems::TSP152, gapp::problems::TSP226, gapp::problems::TSP299, gapp::problems::TSP439, gapp::problems::TSP52, gapp::problems::TSP76
class TSP52#
#include <problems/travelling_salesman.hpp>
class TSP76#
#include <problems/travelling_salesman.hpp>
class TSP124#
#include <problems/travelling_salesman.hpp>
class TSP152#
#include <problems/travelling_salesman.hpp>
class TSP226#
#include <problems/travelling_salesman.hpp>
class TSP299#
#include <problems/travelling_salesman.hpp>
class TSP439#
#include <problems/travelling_salesman.hpp>