discrete_optimization.generic_rcpsp_tools package

Subpackages

• discrete_optimization.generic_rcpsp_tools.solvers package
  • Subpackages
    • discrete_optimization.generic_rcpsp_tools.solvers.lns_cp_mzn package
      • Submodules
      • discrete_optimization.generic_rcpsp_tools.solvers.lns_cp_mzn.neighbor_builder module
      • discrete_optimization.generic_rcpsp_tools.solvers.lns_cp_mzn.neighbor_tools module
      • discrete_optimization.generic_rcpsp_tools.solvers.lns_cp_mzn.postpro_ls module
      • discrete_optimization.generic_rcpsp_tools.solvers.lns_cp_mzn.solution_repair module
      • discrete_optimization.generic_rcpsp_tools.solvers.lns_cp_mzn.solver module
      • Module contents
  • Submodules
  • discrete_optimization.generic_rcpsp_tools.solvers.generic_rcpsp_solver module
    • GenericRcpspSolver
      • GenericRcpspSolver.problem
  • discrete_optimization.generic_rcpsp_tools.solvers.gphh module
    • EvaluationGphh
      • EvaluationGphh.PERMUTATION_DISTANCE
      • EvaluationGphh.SGS
    • FeatureEnum
      • FeatureEnum.ALL_DESCENDANTS
      • FeatureEnum.DUMMY
      • FeatureEnum.EARLIEST_FINISH_DATE
      • FeatureEnum.EARLIEST_START_DATE
      • FeatureEnum.LATEST_FINISH_DATE
      • FeatureEnum.LATEST_START_DATE
      • FeatureEnum.N_PREDECESSORS
      • FeatureEnum.N_SUCCESSORS
      • FeatureEnum.RESSOURCE_AVG
      • FeatureEnum.RESSOURCE_MAX
      • FeatureEnum.RESSOURCE_MIN
      • FeatureEnum.RESSOURCE_NZ_MIN
      • FeatureEnum.RESSOURCE_REQUIRED
      • FeatureEnum.RESSOURCE_TOTAL
      • FeatureEnum.TASK_DURATION
    • GphhGenericRcpspSolver
      • GphhGenericRcpspSolver.build_solution()
      • GphhGenericRcpspSolver.evaluate_heuristic()
      • GphhGenericRcpspSolver.evaluation_method
      • GphhGenericRcpspSolver.init_model()
      • GphhGenericRcpspSolver.init_primitives()
      • GphhGenericRcpspSolver.initialize_cpm_data_for_training()
      • GphhGenericRcpspSolver.params_gphh
      • GphhGenericRcpspSolver.permutation_distance
      • GphhGenericRcpspSolver.pset
      • GphhGenericRcpspSolver.reference_permutations
      • GphhGenericRcpspSolver.solve()
      • GphhGenericRcpspSolver.toolbox
      • GphhGenericRcpspSolver.training_domains
      • GphhGenericRcpspSolver.weight
    • ParametersGphh
      • ParametersGphh.crossover_rate
      • ParametersGphh.deap_verbose
      • ParametersGphh.default()
      • ParametersGphh.default_for_set_features()
      • ParametersGphh.evaluation
      • ParametersGphh.fast_test()
      • ParametersGphh.max_tree_depth
      • ParametersGphh.min_tree_depth
      • ParametersGphh.ms_default()
      • ParametersGphh.ms_fast()
      • ParametersGphh.mutation_rate
      • ParametersGphh.n_gen
      • ParametersGphh.permutation_distance
      • ParametersGphh.pop_size
      • ParametersGphh.set_feature
      • ParametersGphh.set_primitves
      • ParametersGphh.tournament_ratio
    • PermutationDistance
      • PermutationDistance.HAMMING
      • PermutationDistance.KTD
      • PermutationDistance.KTD_HAMMING
    • compute_cpm()
    • feature_all_descendants()
    • feature_average_resource_requirements()
    • feature_efd()
    • feature_esd()
    • feature_lfd()
    • feature_lsd()
    • feature_maximum_resource_requirements()
    • feature_minimum_resource_requirements()
    • feature_n_predecessors()
    • feature_n_successors()
    • feature_non_zero_minimum_resource_requirements()
    • feature_resource_requirements()
    • feature_task_duration()
    • feature_total_n_res()
    • get_dummy()
    • get_resource_requirements_across_duration()
    • if_then_else()
    • max_operator()
    • min_operator()
    • protected_div()
  • discrete_optimization.generic_rcpsp_tools.solvers.ls module
    • LsGenericRcpspSolver
      • LsGenericRcpspSolver.hyperparameters
      • LsGenericRcpspSolver.solve()
    • LsSolverType
      • LsSolverType.HC
      • LsSolverType.SA
  • Module contents

Submodules

discrete_optimization.generic_rcpsp_tools.attribute_type module

class discrete_optimization.generic_rcpsp_tools.attribute_type.ListIntegerRcpsp(length: int, lows: list[int] | int = 0, ups: list[int] | int | None = None, arities: list[int] | int | None = None)

Bases: ListInteger

Attribute type permutation specific to RcpspSolution.

Useful to make mutation catalog map RcpspSolution attribute to specific mutations.

class discrete_optimization.generic_rcpsp_tools.attribute_type.PermutationRcpsp(range: Collection[int])

Bases: Permutation

Attribute type permutation specific to RcpspSolution.

Useful to make mutation catalog map RcpspSolution attribute to specific mutations.

discrete_optimization.generic_rcpsp_tools.graph_tools module

class discrete_optimization.generic_rcpsp_tools.graph_tools.GraphRcpsp(problem: RcpspProblem | PreemptiveRcpspProblem | MultiskillRcpspProblem | VariantMultiskillRcpspProblem)

Bases: object

check_loop()

compute_component_in_non_dummy_graph()

get_ancestors_activities(task)

get_descendants_activities(task)

get_next_activities(task)

get_pred_activities(task)

class discrete_optimization.generic_rcpsp_tools.graph_tools.GraphSpecialConstraintsRcpsp(problem: RcpspProblem | SpecialConstraintsPreemptiveRcpspProblem)

Bases: GraphRcpsp

get_neighbors_constraints(task)

get_pred_constraints(task)

discrete_optimization.generic_rcpsp_tools.graph_tools.build_graph_rcpsp_object(rcpsp_problem: RcpspProblem | PreemptiveRcpspProblem)

discrete_optimization.generic_rcpsp_tools.graph_tools.build_unrelated_task(graph: GraphRcpsp)

discrete_optimization.generic_rcpsp_tools.mutation module

class discrete_optimization.generic_rcpsp_tools.mutation.DeadlineRcpspMutation(problem: RcpspProblem | PreemptiveRcpspProblem | SpecialConstraintsPreemptiveRcpspProblem | VariantMultiskillRcpspProblem, attribute: str | None = None, nb_swap: int = 1, **kwargs: Any)

Bases: SingleAttributeMutation

attribute_type: PermutationRcpsp

attribute_type_cls

alias of PermutationRcpsp

mutate(solution: PreemptiveRcpspSolution | RcpspSolution | VariantMultiskillRcpspSolution | VariantPreemptiveMultiskillRcpspSolution) → tuple[PreemptiveRcpspSolution | RcpspSolution | VariantMultiskillRcpspSolution | VariantPreemptiveMultiskillRcpspSolution, LocalMove]

problem: ANY_RCPSP_FOR_MUTATION

class discrete_optimization.generic_rcpsp_tools.mutation.RcpspMutation(problem: RcpspProblem | PreemptiveRcpspProblem | SpecialConstraintsPreemptiveRcpspProblem | VariantMultiskillRcpspProblem, other_mutation: SingleAttributeMutation, **kwargs: Any)

Bases: SingleAttributeMutation

Wrapper around other mutations which makes recompute the schedule.

attribute_type: PermutationRcpsp

attribute_type_cls

alias of PermutationRcpsp

classmethod build(problem: Problem, other_mutation_cls: type[SingleAttributeMutation], **kwargs: Any) → RcpspMutation

mutate(solution: PreemptiveRcpspSolution | RcpspSolution | VariantMultiskillRcpspSolution | VariantPreemptiveMultiskillRcpspSolution) → tuple[PreemptiveRcpspSolution | RcpspSolution | VariantMultiskillRcpspSolution | VariantPreemptiveMultiskillRcpspSolution, LocalMove]

mutate_and_compute_obj(solution: PreemptiveRcpspSolution | RcpspSolution | VariantMultiskillRcpspSolution | VariantPreemptiveMultiskillRcpspSolution) → tuple[PreemptiveRcpspSolution | RcpspSolution | VariantMultiskillRcpspSolution | VariantPreemptiveMultiskillRcpspSolution, LocalMove, dict[str, float]]

problem: ANY_RCPSP_FOR_MUTATION

discrete_optimization.generic_rcpsp_tools.typing module

discrete_optimization.generic_rcpsp_tools.typing.is_instance_any_rcpsp_problem(problem: Problem) → bool

discrete_optimization.generic_rcpsp_tools.typing.is_instance_any_rcpsp_solution(solution: Solution) → bool

Module contents