This OpenGA aims at solving different kinds of problems, including continuous, discrete, or sequencing problems. In addition, these problems may accompany with multiple objective problems. OpenGA is able to solve them because this library adopts many evolutionary strategies.
Continuous problem:
$ java -classpath .; build/classes/src/openga.applications.Himmelblau
Traveling Salesman Problem (TSP):
$ java -classpath .; build/classes/src/openga.applications.TSP
Multiple Traveling Salesman Problem (mTSP):
$ java -classpath .; build/classes/src/openga.applications.mTSPSGA
Parallel machine problem:
$ java -classpath .; build/classes/src/openga.applications.ParallelMachine
Multi-Objective Evolutionary Algorithm for Flowshop Problems (SPGA2):
$ java -classpath .; build/classes/src/openga.applications.SPGA2_forFlowShop