Uses of Class
org.ddolib.common.solver.Solution
Packages that use Solution
Package
Description
This package implement Acs solver.
This package implement As Star solver.
This contains the implementation of a Anytime Weighted A* solver for decision diagram-based optimization problems.
This package contains interfaces that must be extended to implements solvers.
This package contains solvers using DDO algorithm.
This package implement LNS solver.
This package contains the interfaces and abstract classes that must be implemented as problem
specific classes to model a problem.It also contains default implementation.
-
Uses of Solution in org.ddolib.acs.core.solver
Methods in org.ddolib.acs.core.solver that return SolutionModifier and TypeMethodDescriptionACSSolver.minimize(Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) Minimizes the problem using the ACS strategy. -
Uses of Solution in org.ddolib.astar.core.solver
Methods in org.ddolib.astar.core.solver that return SolutionModifier and TypeMethodDescriptionAStarSolver.minimize(Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) -
Uses of Solution in org.ddolib.awastar.core.solver
Methods in org.ddolib.awastar.core.solver that return SolutionModifier and TypeMethodDescriptionAwAstarSolver.minimize(Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) -
Uses of Solution in org.ddolib.common.solver
Methods in org.ddolib.common.solver that return SolutionModifier and TypeMethodDescriptionSolver.minimize(Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) Minimizes the objective function according to the solver strategy. -
Uses of Solution in org.ddolib.ddo.core.solver
Methods in org.ddolib.ddo.core.solver that return SolutionModifier and TypeMethodDescriptionExactSolver.minimize(Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) Minimizes the problem by compiling an exact decision diagram (MDD).RelaxationSolver.minimize(Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) RestrictionSolver.minimize(Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) SequentialSolver.minimize(Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) -
Uses of Solution in org.ddolib.lns.core.solver
Methods in org.ddolib.lns.core.solver that return SolutionModifier and TypeMethodDescriptionLNSSolver.minimize(Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) -
Uses of Solution in org.ddolib.modeling
Methods in org.ddolib.modeling that return SolutionModifier and TypeMethodDescriptionstatic <T> SolutionSolvers.minimizeAcs(AcsModel<T> model) Solves the given model using the Anytime Column Search (ACS) algorithm.static <T> SolutionSolvers.minimizeAcs(AcsModel<T> model, BiConsumer<int[], SearchStatistics> onSolution) Solves the given model using ACS and calls the callback when a new incumbent is found.static <T> SolutionSolvers.minimizeAcs(AcsModel<T> model, Predicate<SearchStatistics> limit) Solves the given model using ACS, stopping when the limit condition is satisfied.static <T> SolutionSolvers.minimizeAcs(AcsModel<T> model, Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) Core method for solving an ACS model with custom stopping condition and solution callback.static <T> SolutionSolvers.minimizeAstar(Model<T> model) Solves the given model using the A* search algorithm with default parameters.static <T> SolutionSolvers.minimizeAstar(Model<T> model, BiConsumer<int[], SearchStatistics> onSolution) Solves the given model using A* and calls back when new incumbent solutions are found.static <T> SolutionSolvers.minimizeAstar(Model<T> model, Predicate<SearchStatistics> limit) Solves the given model using A* with a specified stop condition.static <T> SolutionSolvers.minimizeAstar(Model<T> model, Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) Core method for solving a model with the A* search algorithm, with custom limit and callback.static <T> SolutionSolvers.minimizeAwAStar(AwAstarModel<T> model) Solves the given model using the Anytime Weighted A* (AWA*) algorithm.static <T> SolutionSolvers.minimizeAwAStar(AwAstarModel<T> model, BiConsumer<int[], SearchStatistics> onSolution) Solves the given model using AWA* and calls the callback when a new incumbent is found.static <T> SolutionSolvers.minimizeAwAStar(AwAstarModel<T> model, Predicate<SearchStatistics> limit) Solves the given model using AWA*, stopping when the limit condition is satisfied.static <T> SolutionSolvers.minimizeAwAStar(AwAstarModel<T> model, Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) Core method for solving a model with the Anytime Weighted A* search algorithm, with custom limit and callback.static <T> SolutionSolvers.minimizeDdo(DdoModel<T> model) Solves the given model using the DDO (Decision Diagram Optimization) algorithm with default stopping criteria and no solution callback.static <T> SolutionSolvers.minimizeDdo(DdoModel<T> model, BiConsumer<int[], SearchStatistics> onSolution) Solves the given model using DDO and triggers a callback each time a new incumbent solution is found.static <T> SolutionSolvers.minimizeDdo(DdoModel<T> model, Predicate<SearchStatistics> limit) Solves the given model using DDO, stopping when the provided limit condition becomes true.static <T> SolutionSolvers.minimizeDdo(DdoModel<T> model, Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) Core method for solving a DDO model with a custom stop condition and a solution callback.static <T> SolutionSolvers.minimizeExact(ExactModel<T> model) Solves the given model using the Exact DDO algorithm.static <T> SolutionSolvers.minimizeExact(ExactModel<T> model, BiConsumer<int[], SearchStatistics> onSolution) Core method for solving an DDO model with solution callback.static <T> SolutionSolvers.minimizeLns(LnsModel<T> model, BiConsumer<int[], SearchStatistics> onSolution) Runs a Large Neighborhood Search (LNS) on the specified model without any termination condition and without processing intermediate solutions.static <T> SolutionSolvers.minimizeLns(LnsModel<T> model, Predicate<SearchStatistics> limit) Runs a Large Neighborhood Search (LNS) on the specified model with a termination condition but without processing intermediate solutions.static final <T> SolutionSolvers.minimizeLns(LnsModel<T> model, Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) Runs a Large Neighborhood Search (LNS) on the specified model with a given termination condition and a callback for each solution found.static <T> SolutionSolvers.relaxedDdo(DdoModel<T> model) static <T> SolutionSolvers.relaxedDdo(DdoModel<T> model, BiConsumer<int[], SearchStatistics> onSolution) static <T> SolutionSolvers.relaxedDdo(DdoModel<T> model, Predicate<SearchStatistics> limit) static <T> SolutionSolvers.relaxedDdo(DdoModel<T> model, Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution) static <T> SolutionSolvers.restrictedDdo(DdoModel<T> model) static <T> SolutionSolvers.restrictedDdo(DdoModel<T> model, BiConsumer<int[], SearchStatistics> onSolution) static <T> SolutionSolvers.restrictedDdo(DdoModel<T> model, Predicate<SearchStatistics> limit) static <T> SolutionSolvers.restrictedDdo(DdoModel<T> model, Predicate<SearchStatistics> limit, BiConsumer<int[], SearchStatistics> onSolution)