This is a repository of old Haskell code that will be transformed into a discrete optimization library. It contains parts of ACO and SA solvers for TSP and VRP as well as some heuristics (NN, 2-opt).
http://tomasmcz.github.io/discrete-opt [Not quite complete yet.]
Last version was tested to work with GHC 9.2.5 and default cabal-install.
You can test the program on a simple problem:
discrete_opt tsp aco data/tsp_51 --coords
To see available command-line options, you can run:
discrete_opt -h
This work is licensed under BSD-3 license.
The test data (in directory data/TSPLIB95) were obtained from
TSPLIB95.
Test files in directory data are just TSPLIB problems in a simplified format.