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

org.drools.planner.config.EnvironmentMode 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.config;

import org.drools.planner.core.localsearch.decider.DefaultDecider;
import org.drools.planner.core.move.Move;

/**
 * A solver has a single Random instance. Some solver configurations use the Random instance a lot more than others.
 * For example simulated annealing depends highly on random numbers,
 * while tabu search only depends on it to deal with score ties.
 * The environment mode influences the seed of that Random instance.
 * 

* The environment mode also allows you to detect common bugs in your implementation. */ public enum EnvironmentMode { /** * The trace mode does a few more assertions (such as {@link DefaultDecider#assertMoveScoreIsUncorrupted}) * than the {@link #DEBUG} mode at a horrible performance cost. *

* The trace mode is reproducible (see {@link #REPRODUCIBLE} mode). *

* The trace mode is horribly slow. */ TRACE, /** * The debug mode turns on most assertions (such as {@link DefaultDecider#assertUndoMoveIsUncorrupted}) * to fail-fast on a bug in a {@link Move} implementation, in a score rule or something else. *

* The debug mode is reproducible (see {@link #REPRODUCIBLE} mode). *

* The debug mode is slow. */ DEBUG, /** * The reproducible mode is the default mode because it is recommended during development. * In this mode, 2 runs on the same computer will execute the same code in the same order. * They will also yield the same result, except if they use a time based termination * and they have a sufficiently large difference in allocated CPU time. * This allows you to benchmark new optimizations (such as a new Move implementation) fairly. *

* The reproducible mode is not much slower than the production mode. *

* In practice, this mode uses the default random seed, * and it also disables certain concurrency optimizations (such as work stealing). * TODO: JBRULES-681 Multi-threaded support which implement those concurrency optimizations */ REPRODUCIBLE, /** * The production mode is the fastest and the most robust, but not reproducible. * It is recommended for a production environment. *

* The random seed is different on every run, which makes it more robust against an unlucky random seed. * An unlucky random seed gives a bad result on a certain data set with a certain solver configuration. * Note that in most use cases the impact of the random seed is relatively low on the result. * An occasional bad result is far more likely to be caused by another issue (such as a score trap). */ PRODUCTION; }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy