mPOEMS in JAVA is designed to provide optimisation problem developers with a tool to apply mPOEMS to their problem, without the need to know the complex algorithm in detail. Main goal is to use a state-of-the-art optimisation algorithm with small development effort.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.



mPOEMS in JAVA is designed to provide optimisation problem developers with a tool to apply mPOEMS to their problem, without the need to know the complex algorithm in detail. Main goal is to use a state-of-the-art optimisation algorithm with small development effort.

The JAVA implementation of mPOEMS

mPOEMS in JAVA is the generic JAVA implementation of an evolutionary algorithm called Multiobjective Prototype Optimization with Evolved Improvement Steps (mPOEMS - The framework was designed to provide optimisation problem engineers with an interface to use mPOEMS, without detailed understanding of the algorithm.

All needed methods and fields to use the framework are presented in the documentation of the framework which can be found at the following location: .

About mPOEMS

Crossover, mutation, and evolution of a population are the basic principles of the evolution and natural selection. Evolutionary algorithms (EA) imitate the nature’s behaviour, and adapt the basic principles, to evolve a set of solutions, towards the optimum solution of a problem.

mPOEMS is an optimisation framework, in the domain of evolutionary algorithms. It was designed to solve optimisation problems, with an unrestricted number of objectives. The algorithm has shown excellent performance in comparison with other state-of-the-art search algorithms. The paper including these results can be found using google scholar or directly using this link.

The drawback of Evolutionary Algorithms is their complexity, and the development effort one has to conduct to create an implementation of such an algorithm. An impressing approach to test and compare various evolutionary algorithms, with little programming effort, is presented by the PISA project. The project website can be found by following this link.

PISA is a platform and programming language independent interface for search algorithms. The use of PISA ensure easy, fast and reliable comparison of different optimization algorithms on various problems or benchmarks. With litte programming effort, one can create the problem specific part of an optimisation problem, and combine it with arbitrary ready-to-use, pre-compiled and very complex optimisation search algorithms.

The project "mPOEMS in JAVA" shares the goal of providing an easy-to-use framework, to use complex search algorithms, with PISA. The PISA framework is applicable to almost any search algorithm. mPOEMS in JAVA focus on providing a framework to use the evolutionary algorithm mPOEMS, without the need to know the algorithm in detail.

The project was initially published at google code:


The framework was created at the Technical University of Vienna and was a major part of the authors (Thomas Kremmel) thesis.

Dr. Jiří Kubalík and Prof. Dr. Stefan Biffl had the idea for this project and supported / supervised the progress. Dr. Jiří Kubalík has written the optimization algorithm the framework implements. He is an assistant professor at the Department of Cybernetics at the Czech Technical University in Prague:

Prof. Dr. Stefan Biffl is associate professor of software engineering at the Institute of Software Technology and Interactive Systems, Vienna University of Technology.


This is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with mpoems-in-java. If not, see <>.

Getting Started

Best starting point is to read the documentation .

To see the framework in action just download the ready-to-start .jars at the downloads tab. There you can find two downloads. A mpoems-in-java solution for the knapsack problem and the .jar for the project selection problem. Get more information about the knapsack problem at _Wikipedia: The knapsack problem implementation is maintained in a separate github repository:

With JAVA installed you can start the .jars with double-clicking on them and waiting for a while, checking out the resulting .xls after a few minutes or you can use this command to see the command-line output:

  • java -jar tuwien.ifs.mpoems.knapsackProblem-1.0-SNAPSHOT-all.jar

You can also change the settings mpoems-in-java is running with opening the .jar with win rar., change the settings file and then save it.

You can find the settings file in the folder

  • tuwien.ifs.mpoems.knapsackProblem-1.0-SNAPSHOT-all.jartuwienifsmpoemsknapsackProblemmPOEMSConf.cfg

The docs folder section also provides a file with the most common maven commands. These commands should be enough to create an eclipse project out of the source code and get started.


For people/researchers interested in the topic the papers below are worth a read:

Multiobjective prototype optimization with evolved improvement steps (mPOEMS) :

mpoems-in-java proof-of-concept: "Software project portfolio optimization with advanced multiobjective evolutionary algorithms" where mpoems-in-java has been used to solve the project portfolio selection problem, which is considered to be a NP-hard problem (

evocop08) Kubalik, J., Mordinyi, R., Biffl, S.: Multiobjective Prototype Optimization with Evolved Improvement Steps. In Evolutionary Computation in Combinatorial Optimization. Heidelberg: Springer, 2008, p. 218-229. ISBN 978-3-540-78603-0.

icannga09) Kubalik, J.: Solving the Multiple Sequence Alignment Problem Using Prototype Optimization with Evolved Improvement Steps. In Adaptive and Natural Computing Algorithms. Heidelberg: Springer, 2009, p. 183-192. ISBN 978-3-642-04920-0.

gecco09) Kubalik, J.: Solving the Sorting Network Problem Using Iterative Optimization with Evolved Hypermutations. In Genetic and Evolutionary Computation Conference 2009 [CD-ROM]. New York: ACM, 2009, p. 301-308. ISBN 978-1-60558-325-9.

smc-c) Kubalik, J., Tichy, P., Sindelar, R., Staron, R. J.: Clustering Methods for Agent Distribution Optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, Volume 40, Issue 1, Jan. 2010 Page(s):78 - 86.

Kubalik J., R. Mordinyi, S. Biffl (2008): "Multiobjective Prototype Optimization with Evolved Im-provement Steps"; in: "Evolutionary Computation in Combinatorial Optimization", LNCS/Springer Berlin, 4972/2008/ Heidelberg, ISSN: 0302-9743; S. 218 - 229.

Auer M., Trendowicz A., Graser B., Haunschmid E., Biffl S.; (2006) "Optimal Project Feature Weights in Analogy-Based Cost Estimation: Improvement and Limitations", IEEE Transactions on Software Engineering.

Rus, I., Halling, M., Biffl S. (2003) "Supporting Decision-Making in Software Engineering with Process Simulation and Empirical Studies", Int. Jour. of Software Engineering and Knowledge Engineering (IJSEKE), 13 (5): 531-545.