| Package | Description |
|---|---|
| com.google.ortools.constraintsolver |
| Modifier and Type | Class and Description |
|---|---|
class |
OptimizeVar
This class encapsulates an objective.
|
| Modifier and Type | Method and Description |
|---|---|
ObjectiveMonitor |
Solver.makeGenericTabuSearch(boolean maximize,
IntVar v,
long step,
IntVar[] tabu_vars,
long forbid_tenure)
Creates a Tabu Search based on the vars |vars|.
A solution is "tabu" if all the vars in |vars| keep their value. |
ObjectiveMonitor |
Solver.makeGuidedLocalSearch(boolean maximize,
IntVar objective,
java.util.function.LongBinaryOperator objective_function,
long step,
IntVar[] vars,
double penalty_factor)
Creates a Guided Local Search monitor.
Description here: http://en.wikipedia.org/wiki/Guided_Local_Search |
ObjectiveMonitor |
Solver.makeGuidedLocalSearch(boolean maximize,
IntVar objective,
java.util.function.LongBinaryOperator objective_function,
long step,
IntVar[] vars,
double penalty_factor,
boolean reset_penalties_on_new_best_solution)
Creates a Guided Local Search monitor.
Description here: http://en.wikipedia.org/wiki/Guided_Local_Search |
ObjectiveMonitor |
Solver.makeGuidedLocalSearch(boolean maximize,
IntVar objective,
LongTernaryOperator objective_function,
long step,
IntVar[] vars,
IntVar[] secondary_vars,
double penalty_factor) |
ObjectiveMonitor |
Solver.makeGuidedLocalSearch(boolean maximize,
IntVar objective,
LongTernaryOperator objective_function,
long step,
IntVar[] vars,
IntVar[] secondary_vars,
double penalty_factor,
boolean reset_penalties_on_new_best_solution) |
ObjectiveMonitor |
Solver.MakeLexicographicSimulatedAnnealing(SWIGTYPE_p_std__vectorT_bool_t maximize,
IntVar[] vars,
long[] steps,
long[] initial_temperatures) |
ObjectiveMonitor |
Solver.MakeLexicographicTabuSearch(SWIGTYPE_p_std__vectorT_bool_t maximize,
IntVar[] objectives,
long[] steps,
IntVar[] vars,
long keep_tenure,
long forbid_tenure,
double tabu_factor) |
ObjectiveMonitor |
Solver.makeSimulatedAnnealing(boolean maximize,
IntVar v,
long step,
long initial_temperature)
Creates a Simulated Annealing monitor.
|
ObjectiveMonitor |
Solver.makeTabuSearch(boolean maximize,
IntVar objective,
long step,
IntVar[] vars,
long keep_tenure,
long forbid_tenure,
double tabu_factor)
MetaHeuristics which try to get the search out of local optima.
Creates a Tabu Search monitor. In the context of local search the behavior is similar to MakeOptimize(), creating an objective in a given sense. |
| Modifier and Type | Method and Description |
|---|---|
protected static long |
ObjectiveMonitor.getCPtr(ObjectiveMonitor obj) |
static void |
mainJNI.ObjectiveMonitor_accept(long jarg1,
ObjectiveMonitor jarg1_,
long jarg2,
ModelVisitor jarg2_) |
static boolean |
mainJNI.ObjectiveMonitor_acceptDelta(long jarg1,
ObjectiveMonitor jarg1_,
long jarg2,
Assignment jarg2_,
long jarg3,
Assignment jarg3_) |
static boolean |
mainJNI.ObjectiveMonitor_atSolution(long jarg1,
ObjectiveMonitor jarg1_) |
static long |
mainJNI.ObjectiveMonitor_BestValue(long jarg1,
ObjectiveMonitor jarg1_,
int jarg2) |
static void |
mainJNI.ObjectiveMonitor_enterSearch(long jarg1,
ObjectiveMonitor jarg1_) |
static boolean |
mainJNI.ObjectiveMonitor_Maximize(long jarg1,
ObjectiveMonitor jarg1_,
int jarg2) |
static long |
mainJNI.ObjectiveMonitor_MinimizationVar(long jarg1,
ObjectiveMonitor jarg1_,
int jarg2) |
static long |
mainJNI.ObjectiveMonitor_ObjectiveVar(long jarg1,
ObjectiveMonitor jarg1_,
int jarg2) |
static int |
mainJNI.ObjectiveMonitor_Size(long jarg1,
ObjectiveMonitor jarg1_) |
static long |
mainJNI.ObjectiveMonitor_Step(long jarg1,
ObjectiveMonitor jarg1_,
int jarg2) |
protected static long |
ObjectiveMonitor.swigRelease(ObjectiveMonitor obj) |
Copyright © 2024. All rights reserved.