MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimens...

• Author(s): Alves, Maria João ; Almeida, Marla
• Date: 2007
• Persistent ID: http://hdl.handle.net/10316/5482
• Origin: Estudo Geral - Universidade de Coimbra
• Subject(s): Genetic algorithms; Multiple objective programming; Knapsack problem
• Document Type: Article
• Language: English

Description

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. http://www.sciencedirect.com/science/article/B6VC5-4JHMS76-3/1/3ecf973fae987229df46569c9f563065