MLOTZ

The MLOTZ problem is a generalization of the LOTZ problem to an arbitrary even number of objectives, m. This is achieved by concatenating m/2 bi-objective LOTZ problems of 2n/m bits each. The problem has been propsed in the following paper and used therein analyzing the running time of different multiobjective EAs.

• Author: Marco Laumanns
• Documentation
• Relevant Publication: M. Laumanns, L. Thiele and E. Zitzler: Running Time Analysis of Multiobjective Evolutionary Algorithms on Pseudo-Boolean Functions, IEEE Transactions on Evolutionary Computation, 8 (2), 2004.
• License: PISA
• Source in C (tar.gz)
• Binaries:
  • Windows (zip)
  • Solaris (tar.gz)
  • Linux (tar.gz)