/*
* Copyright 2014 Red Hat, Inc. and/or its affiliates.
*
* 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.optaplanner.core.impl.exhaustivesearch.node.bounder;
import org.optaplanner.core.api.domain.solution.PlanningSolution;
import org.optaplanner.core.api.score.Score;
import org.optaplanner.core.impl.score.definition.ScoreDefinition;
import org.optaplanner.core.impl.score.director.ScoreDirector;
public interface ScoreBounder {
/**
* In OR terms, this is called the lower bound if they minimize, and upper bound if they maximize.
* Because we always maximize the {@link Score}, calling it lower bound would be a contradiction.
* @param scoreDirector never null, use {@link ScoreDirector#getWorkingSolution()} to get the working {@link PlanningSolution}
* @param score never null, the {@link Score} of the working {@link PlanningSolution}
* @return never null, never worse than the best possible {@link Score} we can get
* by initializing the uninitialized variables of the working {@link PlanningSolution}.
* @see ScoreDefinition#buildOptimisticBound(InitializingScoreTrend, Score)
*/
Score calculateOptimisticBound(ScoreDirector scoreDirector, Score score);
/**
* In OR terms, this is called the upper bound if they minimize, and lower bound if they maximize.
* Because we always maximize the {@link Score}, calling it upper bound would be a contradiction.
* @param scoreDirector never null, use {@link ScoreDirector#getWorkingSolution()} to get the working {@link PlanningSolution}
* @param score never null, the {@link Score} of the working {@link PlanningSolution}
* @return never null, never better than the worst possible {@link Score} we can get
* by initializing the uninitialized variables of the working {@link PlanningSolution}.
* @see ScoreDefinition#buildPessimisticBound(InitializingScoreTrend, Score)
*/
Score calculatePessimisticBound(ScoreDirector scoreDirector, Score score);
}