A GRASP-based memetic algorithm with path relinking for the far from most string problem

José E. Gallardo, Carlos Cotta

The FAR FROM MOST STRING PROBLEM (FFMSP) is a string selection problem. The objective is to find a string whose distance to other strings in a certain input set is above a given th…