|
|
A solver for the three dimensional assignment problmem (3DAP) using a hybrid ant system based on the HAS-QAP algorithm of Gambardella and Taillard.
The source has 3 directories. One is the source for a graphical version of the solver. It's slower but useful to see the solver(s) in action. A second folder has a faster, command-line based version. The third folder is a test problem generator that Don Grundel wrote at UF (it's included only because after searching I couldn't find a link to it; I don't know the license). A paper describing how the algorithm works is also included in the repository.
The code was imported but not fully cleaned up and made 'nice'. The command-line version has blocks of test configuration code commented out, for example, from when I was doing a full factorial experiment.
The source has 3 directories. One is the source for a graphical version of the solver. It's slower but useful to see the solver(s) in action. A second folder has a faster, command-line based version. The third folder is a test problem generator that Don Grundel wrote at UF (it's included only because after searching I couldn't find a link to it; I don't know the license). A paper describing how the algorithm works is also included in the repository.
The code was imported but not fully cleaned up and made 'nice'. The command-line version has blocks of test configuration code commented out, for example, from when I was doing a full factorial experiment.