MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization. We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the first parent. A local search is then applied to the offspring. We experiment this scheme with a new multiobjective tabu search called PRTS, which leads to the memetic algorithm MEMOTS. We show on the multidimensional multiobjective knapsack problem that if the number of objectives increase, it is preferable to have a diversified research rather using an advanced local search. We compare the memetic algorithm MEMOTS to other multiobjective memetic algorithms by using different quality indicators and show that the performances of the method are very interesting.
Keywords for this software
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Gorski, Jochen; Paquete, Luís; Pedrosa, Fábio: Greedy algorithms for a class of knapsack problems with binary weights (2012)
- Lust, Thibaut; Teghem, Jacques: MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization (2008)