Package org.opt4j.benchmarks.knapsack

package org.opt4j.benchmarks.knapsack

Provides the classes for the knapsack benchmark. See "E. Zitzler and L. Thiele: Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, vol. 3, no. 4, pp. 257-271, Nov. 1999." .

Related Packages

Package	Description
org.opt4j.benchmarks	Provides the classes for benchmark problems.
org.opt4j.benchmarks.dtlz	Provides the classes for the DTLZ benchmark.
org.opt4j.benchmarks.lotz	Provides the classes for the LOTZ benchmark.
org.opt4j.benchmarks.queens	Provides the classes for the Queen Problem benchmark.
org.opt4j.benchmarks.wfg	Provides the classes for the WFG (Walking Fish Group) benchmarks.
org.opt4j.benchmarks.zdt	Provides the classes for the ZDT benchmarks.

Class	Description
Item	An item.
ItemSelection	The set of selected items.
Knapsack	A knapsack has a given capacity.
KnapsackBinaryCreatorDecoder	The KnapsackBinaryCreatorDecoder creates and decodes the given KnapsackProblemRandom using one bit per item, i.e.
KnapsackModule	The multiobjective 0/1 ILP knapsack problem as proposed in Zitzler and Thiele 1999.
KnapsackModule.Representation
KnapsackModule.TestCase
KnapsackOverloadEvaluator	The KnapsackOverloadEvaluator evaluates a given ItemSelection using one Objective to sum up all knapsack overloads and one Objective for the profit of each knapsack.
KnapsackProblem	The KnapsackProblem defines the basic problem, i.e., the collection of Item and Knapsack elements, respectively.
KnapsackProblemFile	The KnapsackProblemFile is a KnapsackProblem that is initialized by a file.
KnapsackProblemRandom	The KnapsackProblemRandom, see "E.
KnapsackProfitEvaluator	The KnapsackProfitEvaluator evaluates a given ItemSelection using one Objective to sum up all knapsack overloads and one Objective for the profit of each knapsack.
KnapsackSATCreatorDecoder	Use SAT decoding to solve knapsack problem.