Genetic tabu search for the Multi-Objective knapsack problem

We introduce a hybrid algorithm for the 0–1 multidimensional multi-objective knapsack problem. This algorithm, called GTS
^MOKP
, combines a genetic procedure and a tabu search operator. The algorithm is evaluated on 9 well-known benchmark instances and shows highly competitive results compared with two state-of-the-art algorithms.