This respository contains the source code for the Memetic Algorithm with Explicit Diversity Managemente (MA-EDM) and the prefix-suffix lower bounds. The solutions for the VRF dataset obtained by MA-EDM are provided in the file UBKS.xlsx The lower bounds and executions times computed by the prefix-suffix bound are provided in the file LowerBounds.xlsx Installation Clone the repository Build the project with the provided Makefile using make The executables (MA-EDM and PrefixSuffixBound) will be created within the same folder Usage Running the MA-EDM algorithm To execute the algorithm, use the following command: ./MA-EDM [OPTIONS] Parameters The algorithm requires the following parameters in order: Seed Path of instance file (eg. 'VFR300_40_7_Gap.txt') Dataset (VRF or TAILLARD) $N_P$ (population size) Diversity management (ADVANCED_DIVERSITY_CONTROL, BEST_NON_PENALIZED, GENERALIZED_CROWDING_ADAPTIVE, GENERATIONAL_ELITIST, RESTRICTED_TOURNAMENT_SELECTION, REPLACE_WORST) Execution time (in seconds, ignored if use time function is $1$) Use time function (0, 1) File to output summary of execution (like makespan and permutation found) Save intermediate populations (0, 1) Amount generations outputs (ignored if save intermediate populations is 0) File to output intermediate generations (ignored if save intermediate populations is 0) For GENERALIZED_CROWDING_ADAPTIVE 12. $\theta$ For RESTRICTED_TOURNAMENT_SELECTION 12. $w$ (window size) For ADVANCED_DIVERSITY_CONTROL 12. $N_{c}$ (rate to calculate $N_{close} = N_c \times N_P$) 13. $N_{e}$ (rate to calculate $N_{elite} = N_e \times N_P$) Example ./MA-EDM 1 VFR300_40_7_Gap.txt VRF 25 BEST_NON_PENALIZED 0 1 LOG.txt 1 50 POPULATION.txt Running the Prefix-Suffix bounds To execute the algorithm, use the following command: ./PrefixSuffixBound [OPTIONS] Parameters The algorithm requires the following parameters in order: Path of instance file (eg. 'VFR300_40_7_Gap.txt') Dataset (VRF or TAILLARD) File to output the bounds