Uses of Interface
org.cicirello.search.problems.IntegerCostOptimizationProblem

Packages that use IntegerCostOptimizationProblem

Package	Description
org.cicirello.search.hc	This package includes classes and interfaces directly related to implementing hill climbers.
org.cicirello.search.problems	Package of classes and interfaces related to representing computational problems, as well as classes implementing a variety of specific computational problems.
org.cicirello.search.problems.scheduling	Package of classes and interfaces related to representing and solving scheduling problems, which includes implementations of constructive heuristics for scheduling problems.
org.cicirello.search.sa	This package includes classes and interfaces directly related to implementing simulated annealing.
org.cicirello.search.ss	This package includes classes and interfaces directly related to implementing stochastic sampling algorithms.

Uses of IntegerCostOptimizationProblem in org.cicirello.search.hc

Constructors in org.cicirello.search.hc with parameters of type IntegerCostOptimizationProblem

Constructor	Description
FirstDescentHillClimber(IntegerCostOptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer)	Constructs a first descent hill climber object for integer-valued optimization problem.
FirstDescentHillClimber(IntegerCostOptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Constructs a first descent hill climber object for integer-valued optimization problem.
SteepestDescentHillClimber(IntegerCostOptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer)	Constructs a steepest descent hill climber object for integer-valued optimization problem.
SteepestDescentHillClimber(IntegerCostOptimizationProblem<T> problem, IterableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Constructs a steepest descent hill climber object for integer-valued optimization problem.

Uses of IntegerCostOptimizationProblem in org.cicirello.search.problems

Classes in org.cicirello.search.problems that implement IntegerCostOptimizationProblem

Modifier and Type	Class	Description
class	BoundMax	The BoundMax class is an implementation of a generalization of the well-known OneMax problem, often used in benchmarking genetic algorithms and other metaheuristics.
class	IntegerCostFunctionScaler<T extends Copyable<T>>	This is a wrapper class for IntegerCostOptimizationProblem objects that enables scaling all cost values by a positive constant.
class	OneMax	The OneMax class is an implementation of the well-known OneMax problem, often used in benchmarking genetic algorithms and other metaheuristics.
class	OneMaxAckley	The OneMaxAckley class is an implementation of the well-known OneMax problem, often used in benchmarking genetic algorithms and other metaheuristics.
class	PermutationInAHaystack	The Permutation in a Haystack is a family of optimization problems that can be parameterized to the various types of permutation problem (e.g., absolute versus relative positioning).
class	Porcupine	This class implements the Porcupine landscape (Ackley, 1985), which is a very rugged search landscape, with an exponential number of local optima.
class	TwoMax	This class implements the benchmarking problem known as TwoMax.
class	TwoMaxEqualPeaks	This class implements a variation of the benchmarking problem known as TwoMax.

Constructors in org.cicirello.search.problems with parameters of type IntegerCostOptimizationProblem

Constructor	Description
IntegerCostFunctionScaler(IntegerCostOptimizationProblem<T> problem, int scale)	Constructs the IntegerCostFunctionScaler.

Uses of IntegerCostOptimizationProblem in org.cicirello.search.problems.scheduling

Subinterfaces of IntegerCostOptimizationProblem in org.cicirello.search.problems.scheduling

Modifier and Type	Interface	Description
interface	SingleMachineSchedulingProblem	Implement this interface to define a single machine scheduling problem.

Classes in org.cicirello.search.problems.scheduling that implement IntegerCostOptimizationProblem

Modifier and Type	Class	Description
class	MinimizeMakespan	Implements the common scheduling cost function known as makespan.
class	MinimizeMaximumFlowtime	Implements the scheduling cost function known as maximum flowtime (which we want to minimize).
class	MinimizeMaximumLateness	Implements the scheduling cost function known as maximum lateness, which we want to minimize.
class	MinimizeMaximumTardiness	Implements the scheduling cost function known as maximum tardiness, which we want to minimize.
class	WeightedEarlinessTardiness	Implements the scheduling cost function known as weighted earliness plus weighted tardiness.
class	WeightedFlowtime	Implements the scheduling cost function known as weighted flowtime.
class	WeightedLateness	Implements the scheduling cost function known as weighted lateness.
class	WeightedNumberTardyJobs	Implements the scheduling cost function known as weighted number of tardy jobs, which we want to minimize.
class	WeightedSquaredTardiness	Implements the scheduling cost function known as weighted squared tardiness.
class	WeightedTardiness	Implements the scheduling cost function known as weighted tardiness.

Uses of IntegerCostOptimizationProblem in org.cicirello.search.sa

Constructors in org.cicirello.search.sa with parameters of type IntegerCostOptimizationProblem

Constructor	Description
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems, with a default annealing schedule of ModifiedLam, which is the Optimized Modified Lam of Cicirello (2020).
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems, with a default annealing schedule of ModifiedLam, which is the Optimized Modified Lam of Cicirello (2020).
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, ProgressTracker<T> tracker, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems, with a default annealing schedule of ModifiedLam, which is the Optimized Modified Lam of Cicirello (2020), and which runs a hill climber as a post-processing step.
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems.
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, ProgressTracker<T> tracker)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems.
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, ProgressTracker<T> tracker, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems that runs a hill climber as a post-processing step.
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, AnnealingSchedule anneal, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems that runs a hill climber as a post-processing step.
SimulatedAnnealing(IntegerCostOptimizationProblem<T> problem, UndoableMutationOperator<T> mutation, Initializer<T> initializer, SimpleLocalMetaheuristic<T> hc)	Creates a SimulatedAnnealing search instance for integer-valued optimization problems, with a default annealing schedule of ModifiedLam, which is the Optimized Modified Lam of Cicirello (2020), and which runs a hill climber as a post-processing step.

Uses of IntegerCostOptimizationProblem in org.cicirello.search.ss

Constructors in org.cicirello.search.ss with parameters of type IntegerCostOptimizationProblem

Constructor	Description
IterativeSampling(IntegerCostOptimizationProblem<T> problem, Initializer<T> initializer)	Constructs an iterative sampling search for a integer-valued optimization problem.
IterativeSampling(IntegerCostOptimizationProblem<T> problem, Initializer<T> initializer, ProgressTracker<T> tracker)	Constructs an iterative sampling search for a integer-valued optimization problem.