Implementation of MemPR
|Reported by:||abeham||Owned by:||abeham|
MemPR is short for MEMetic Path Relinking algorithm. It is a hyper-heuristic that combines various heuristics (crossover, mutation, local search, path relinking, sampling, etc.) in a population-based method with diversity handling. It aims to provide good anytime behavior which can achieve good solutions quickly. MemPR is specific to various encodings, but independent of any concrete problem definition.
MemPR will be available for binary-, LLE-, and permutation-based problems (absolute, relativedirected, and relativeundirected).