The following program uses the Simulated Annealing Heuristic to find solutions to the Travelling Salesman Problem.
Run:
meson setup -Dbuildtype=release build
and:
meson compile -C build/
in the root directory.
Run:
./build/TSP_SA [tsp-parameters] [cities-ids-or-file] [options]
in the root directory.
-t
Sets the desired temperature for the execution.
-m
Sets the desired maximum number of iterations to find a proper batch.
-l
Sets the desired batch size.
-e
Sets the desired epsilon value.
-p
Sets the desired phi value.
-a
Sets the desired average of accepted cities.
-k
Sets the desired temperature batch size.
-s
Sets the initial seed the program will use.
-n
Sets the number of seeds the program will use.
-v
Prints the evaluation for each path the program finds.
-c
Sets the ids of the desired instance. It can be a file or a list of ids.
-f
Parses a file which contains the parameters.
meson
Version: 1.0.0
sqlite3
Version: 3.40.1 2022-12-28