discrete_optimization.generic_tools.mutations package

Submodules

discrete_optimization.generic_tools.mutations.mixed_mutation module

class discrete_optimization.generic_tools.mutations.mixed_mutation.BasicPortfolioMutation(list_mutation: List[Mutation], weight_mutation: List[float] | ndarray)

Bases: Mutation

mutate(solution: Solution) → Tuple[Solution, LocalMove]

mutate_and_compute_obj(solution: Solution) → Tuple[Solution, LocalMove, Dict[str, float]]

class discrete_optimization.generic_tools.mutations.mixed_mutation.BasicPortfolioMutationTrack(list_mutation: List[Mutation], weight_mutation: List[float] | ndarray)

Bases: Mutation

mutate(solution: Solution) → Tuple[Solution, LocalMove]

mutate_and_compute_obj(solution: Solution) → Tuple[Solution, LocalMove, Dict[str, float]]

discrete_optimization.generic_tools.mutations.mutation_bool module

class discrete_optimization.generic_tools.mutations.mutation_bool.BitFlipMove(attribute: str, list_index_flip: Iterable[int])

Bases: LocalMove

apply_local_move(solution: Solution) → Solution

backtrack_local_move(solution: Solution) → Solution

class discrete_optimization.generic_tools.mutations.mutation_bool.MutationBitFlip(problem: Problem, attribute: str | None = None, probability_flip: float = 0.1)

Bases: Mutation

static build(problem: Problem, solution: Solution, **kwargs: Any) → MutationBitFlip

mutate(solution: Solution) → Tuple[Solution, LocalMove]

mutate_and_compute_obj(solution: Solution) → Tuple[Solution, LocalMove, Dict[str, float]]

discrete_optimization.generic_tools.mutations.mutation_catalog module

discrete_optimization.generic_tools.mutations.mutation_catalog.get_available_mutations(problem: Problem, solution: Solution | None = None) → Tuple[Dict[TypeAttribute, Dict[str, Tuple[Type[Mutation], Dict[str, Any]]]], List[Tuple[Type[Mutation], Dict[str, Any]]]]

discrete_optimization.generic_tools.mutations.mutation_integer module

class discrete_optimization.generic_tools.mutations.mutation_integer.MutationIntegerSpecificArity(problem: Problem, attribute: str | None = None, arities: List[int] | None = None, probability_flip: float = 0.1, min_value: int = 1)

Bases: Mutation

static build(problem: Problem, solution: Solution, **kwargs: Any) → MutationIntegerSpecificArity

mutate(solution: Solution) → Tuple[Solution, LocalMove]

mutate_and_compute_obj(solution: Solution) → Tuple[Solution, LocalMove, Dict[str, float]]

discrete_optimization.generic_tools.mutations.mutation_util module

discrete_optimization.generic_tools.mutations.mutation_util.get_attribute_for_type(register: EncodingRegister, type_attribute: TypeAttribute) → str

discrete_optimization.generic_tools.mutations.permutation_mutations module

class discrete_optimization.generic_tools.mutations.permutation_mutations.PermutationPartialShuffleMutation(problem: Problem, solution: Solution, attribute: str | None = None, proportion: float = 0.3)

Bases: Mutation

static build(problem: Problem, solution: Solution, **kwargs: Any) → PermutationPartialShuffleMutation

mutate(solution: Solution) → Tuple[Solution, LocalMove]

mutate_and_compute_obj(solution: Solution) → Tuple[Solution, LocalMove, Dict[str, float]]

class discrete_optimization.generic_tools.mutations.permutation_mutations.PermutationShuffleMutation(problem: Problem, solution: Solution, attribute: str | None = None)

Bases: Mutation

static build(problem: Problem, solution: Solution, **kwargs: Any) → PermutationShuffleMutation

mutate(solution: Solution) → Tuple[Solution, LocalMove]

mutate_and_compute_obj(solution: Solution) → Tuple[Solution, LocalMove, Dict[str, float]]

class discrete_optimization.generic_tools.mutations.permutation_mutations.PermutationSwap(problem: Problem, solution: Solution, attribute: str | None = None, nb_swap: int = 1)

Bases: Mutation

static build(problem: Problem, solution: Solution, **kwargs: Any) → PermutationSwap

mutate(solution: Solution) → Tuple[Solution, LocalMove]

mutate_and_compute_obj(solution: Solution) → Tuple[Solution, LocalMove, Dict[str, float]]

class discrete_optimization.generic_tools.mutations.permutation_mutations.ShuffleMove(attribute: str, new_permutation: List[int] | ndarray, prev_permutation: List[int] | ndarray)

Bases: LocalMove

apply_local_move(solution: Solution) → Solution

backtrack_local_move(solution: Solution) → Solution

class discrete_optimization.generic_tools.mutations.permutation_mutations.SwapsLocalMove(attribute: str, list_index_swap: List[Tuple[int, int]])

Bases: LocalMove

apply_local_move(solution: Solution) → Solution

backtrack_local_move(solution: Solution) → Solution

class discrete_optimization.generic_tools.mutations.permutation_mutations.TwoOptMove(attribute: str, index_2opt: List[Tuple[int, int]])

Bases: LocalMove

apply_local_move(solution: Solution) → Solution

backtrack_local_move(solution: Solution) → Solution

class discrete_optimization.generic_tools.mutations.permutation_mutations.TwoOptMutation(problem: Problem, solution: Solution, attribute: str | None = None)

Bases: Mutation

static build(problem: Problem, solution: Solution, **kwargs: Any) → TwoOptMutation

mutate(solution: Solution) → Tuple[Solution, LocalMove]

mutate_and_compute_obj(solution: Solution) → Tuple[Solution, LocalMove, Dict[str, float]]

Module contents