Biblioteca.Net

HOME | LOGIN

The Guided Improvement Algorithm for Exact, General-Purpose, Many-Objective Combinatorial Optimization

Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).

Para poder solicitar este recurso debe identificarse como usuario de la biblioteca

Ver

The Guided Improvement Algorithm for Exact, General-Purpose, Many-Objective Combinatorial Optimization
Id.	45166916
Titulo	The Guided Improvement Algorithm for Exact, General-Purpose, Many-Objective Combinatorial Optimization
Autor(es)	Jackson, Daniel Estler, H.-Christian Rayside, Derek
Localización	http://hdl.handle.net/1721.1/46322
Versión	1.0
Estado	Final
Descripción	This paper presents a new general-purpose algorithm for exact solving of combinatorial many-objective optimization problems. We call this new algorithm the guided improvement algorithm. The algorithm is implemented on top of the non-optimizing relational constraint solver Kodkod. We compare the performance of this new algorithm against two algorithms from the literature [Gavanelli 2002, Lukasiewycz et alia 2007, Laumanns et alia 2006]) on three micro-benchmark problems (n-Queens, n-Rooks, and knapsack) and on two aerospace case studies. Results indicate that the new algorithm is better for the kinds of many-objective problems that our aerospace collaborators are interested in solving. The new algorithm returns Pareto-optimal solutions as it computes.
Tipo	20 p.
Tipo de Interactividad	Expositivo
Nivel de Interactividad	muy bajo
Audiencia	Estudiante Profesor Autor
Estructura	Atomic
Coste	no
Copyright	sí
	Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 Unported
Formatos	20 p.
Requerimientos técnicos	Browser: Any
Relación	[References] MIT-CSAIL-TR-2009-033
Fecha de contribución	05-jul-2009
Contacto

No hay ninguna valoración para este recurso. Sea el primero en valorar este recurso.