Please use this identifier to cite or link to this item:
Title: Implicit Enumeration for Representation Systems in Multi-objective Optimization
Authors: Jesus, Alexandre Daniel Borges de 
Orientador: Paquete, Luís Filipe dos Santos Coelho
Keywords: Problema de knapsack bi-objectivo sem restrição; Subconjunto representativo; Algoritmo de Nemhauser-Ullman
Issue Date: 25-Sep-2015
Serial title, monograph or event: Implicit Enumeration for Representation Systems in Multi-objective Optimization
Place of publication or event: Coimbra
Abstract: The main focus of this thesis is the design and analysis of algorithms to nd a representative subset, with a given cardinality, of the Pareto-optimal set for the unconstrained bi-objective knapsack problem, according to some notions of representation quality. The representative subset should be obtained without prior knowledge of the Pareto-optimal set. Two main algorithms are discussed in this thesis. The rst reformulates the recurrence of the existing Nemhauser-Ullman algorithm for the unconstrained bi-objective knapsack problem by selecting a representative subset at each recursive step. The second by pruning solutions that may not contribute to nd the optimal representation based on the sum of the weights or the set of supported solutions. Analysis on the time and error regarding the uniformity, coverage and -indicator is performed. Keywords: Unconstrained bi-objective knapsack problem, Nemhauser-Ullman algorithm, Representative subset, Representation quality
Description: Dissertação de Mestrado em Engenharia Informática apresentada à Faculdade de Ciências e Tecnologia da Universidade de Coimbra.
Rights: openAccess
Appears in Collections:UC - Dissertações de Mestrado
FCTUC Eng.Informática - Teses de Mestrado

Files in This Item:
Show full item record

Page view(s)

checked on Apr 23, 2024


checked on Apr 23, 2024

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.