Package org.ddolib.examples.knapsack

Class KSDdoMainWithCluster

java.lang.Object

org.ddolib.examples.knapsack.KSDdoMainWithCluster

public class KSDdoMainWithCluster
extends Object

Knapsack Problem (KS) with Ddo.

This class demonstrates how to solve an instance of the bounded Knapsack Problem (BKP) using a Decision Diagram Optimization (DDO) algorithm.

The program performs the following steps:

1. Loads a knapsack instance from a data file.
2. Defines a DdoModel with:
   • A relaxation function for merging states (KSRelax).
   • A state ranking heuristic (KSRanking).
   • A fast lower bound heuristic (KSFastLowerBound).
   • A dominance checker (KSDominance).
   • A frontier of type CutSetType.Frontier (SimpleFrontier).
   • A width heuristic (FixedWidth) and cache usage.
   • Verbose output level (VerbosityLevel).
3. Creates a Solvers and runs the DDO algorithm.
4. Prints updates when a new incumbent solution is found and stops after 10 seconds of runtime.
5. Outputs the final search statistics.

The DDO solver leverages relaxed decision diagrams, caching, and state ranking to efficiently explore the search space for high-quality solutions.

Constructor Summary

Constructors

Constructor	Description
KSDdoMainWithCluster()

Method Summary

Modifier and Type	Method	Description
static void	main(String[] args)	Entry point of the DDO demonstration for the Knapsack Problem.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

KSDdoMainWithCluster

public KSDdoMainWithCluster()

Method Details

main

public static void main(String[] args)
                 throws IOException

Entry point of the DDO demonstration for the Knapsack Problem.

Parameters:

args - command-line arguments (not used)

Throws:

IOException - if the instance file cannot be read