We are experiencing minor difficulties with some of our submission forms, which we are working to resolve. You should still be able to submit items, but if you have any issues while submitting, please contact us at dspace-lib@mit.edu.
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.
Terms of Use
Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 Unported
