An Empirical Study of Tabu Search for the MOKP

摘要

Three Tabu Search algorithms are presented for the 0-1 multi-dimensional multi-objective knapsack problem. Experiments are carried out to study the role of different diversification techniques for TS and to compare TS with well-known evolutionary algorithms.