A framework for solving well known NP-hard problems. Current problem support includes:

• Knapsack Problem

There exists a config.properties file that has detailed information on how to configure the framework.

A folder here is generated with all text files of the output from running the framework.

Taking the example of the knapsack problem, an output file would look like this, where each pair is the worst and best objective function value at each generation:

0.123 201
123.12 201
... ...
300 300

gradle wrapper build - from within IntelliJ.

./gradlew build - from command line.

Note: Project SDK must be set to Java 8 or above(best is to use the latest). The gradle-wrapper.properties file will be using the latest version (7.4.1) as of the time of this doc update.

gradle wrapper run - from within IntelliJ.

Run (SHIFT+F10 for IntelliJ, CTRL+F11 for Eclipse) - from within your IDE.

./gradlew run - from command line.

• GUI using FX or Swing
• Adding more framework support e.g. hyperheuritics, operators, problem support e.g. TSP.