MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem

• Main Author: Alves, Maria João
• Publication Date: 2007
• Other Authors: Almeida, Marla
• Format: Article
• Language: eng
• Source: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Download full: http://hdl.handle.net/10316/5482; https://doi.org/10.1016/j.cor.2006.02.008
• topic: Genetic algorithms; Multiple objective programming; Knapsack problem

This paper presents a new multiobjective genetic algorithm based on the Tchebycheff scalarizing function, which aims to generate a good approximation of the nondominated solution set of the multiobjective problem. The algorithm performs several stages, each one intended for searching potentially nondominated solutions in a different part of the Pareto front. Pre-defined weight vectors act as pivots to define the weighted-Tchebycheff scalarizing functions used in each stage. Therefore, each stage focuses the search on a specific region, leading to an iterative approximation of the entire nondominated set.