| dc.date.accessioned | 2009-07-03T19:15:04Z | |
| dc.date.accessioned | 2018-11-26T22:26:02Z | |
| dc.date.available | 2009-07-03T19:15:04Z | |
| dc.date.available | 2018-11-26T22:26:02Z | |
| dc.date.issued | 2009-07-03 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/46322 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/46322 | |
| dc.description.abstract | 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. | en_US |
| dc.format.extent | 20 p. | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 Unported | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/ | |
| dc.title | The Guided Improvement Algorithm for Exact, General-Purpose, Many-Objective Combinatorial Optimization | en_US |
