We generated a set of instances for testing both algorithms. We used Ben Paechter's problem instance generator, which is briefly described in the paper.
The algorithms were implemented in C++. We used the
GNU compiler gcc version 2.95.3. The following files contain the source code of the implemented algorithms:
They contain a makefile. The executable can be generated by simply typing make. Both algorithms use the
same following command line arguments:
<algorithm> -i <instance> -t <time limit in seconds per try>
-n <number of trials> -s <seed for random number generator> [-o <output file>]
Additionally to the parameters specified above, the mmas uses the following command line parameters:
-ant <number of ants>
-evp <evaporation coefficiant (rho)>
-min <minimal pheromone level (tau_min)>