All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.drools.planner.core.solution.Solution Maven / Gradle / Ivy

Go to download

Drools Planner optimizes automated planning by combining metaheuristic search algorithms with rule engine powered score calculation. This is the drools-planner-core module which contains metaheuristic algorithms.

There is a newer version: 6.0.0.Alpha9
Show newest version
/*
 * Copyright 2010 JBoss Inc
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.drools.planner.core.solution;

import java.util.Collection;

import org.drools.WorkingMemory;
import org.drools.planner.core.Solver;
import org.drools.planner.core.score.Score;
import org.drools.planner.core.score.director.drools.DroolsScoreDirector;
import org.drools.planner.core.solver.ProblemFactChange;

/**
 * A Solution represents a problem and a possible solution of that problem.
 * A possible solution does not need to optimal or even feasible.
 * A Solution does not even have to be initialized with a possible solution.
 * 

* A Solution is mutable. * Drools Planner will continuously modify the same solution for scalability reasons * and clone it to recall the best solution. */ public interface Solution { /** * Returns the Score of this Solution. * @return null if the Solution is uninitialized * or the last calculated Score is dirty the new Score has not yet been recalculated */ S getScore(); /** * Called by the {@link Solver} when the Score of this Solution has been calculated. * @param score null if the Solution has changed and the new Score has not yet been recalculated */ void setScore(S score); /** * Called by the {@link DroolsScoreDirector} when the {@link Solution} needs to be inserted * into an empty {@link WorkingMemory}. * These facts can be used by the score rules. * They don't change during planning (except through {@link ProblemFactChange} events). *

* Do not include the planning entities as problem facts: * they are automatically inserted into the {@link WorkingMemory} if and only if they are initialized. * When they are initialized later, they are also automatically inserted. * @return never null (although an empty collection is allowed), * all the facts of this solution except for the planning entities */ Collection getProblemFacts(); /** * Called by the {@link Solver} when the solution needs to be cloned, * for example to store a clone of the current solution as the best solution. *

* A clone must also shallow copy the score. * @return never null, a clone of which the properties that change during solving are deep cloned */ Solution cloneSolution(); }