[CP-SAT] Ortools stops when solving a RCPSP - Memory exhausted?

376 views
Skip to first unread message

Dan G

unread,
Sep 12, 2023, 9:03:52 AM9/12/23
to or-tools-discuss
Hello,

I am trying to solve a RCPSP problem with the CP-SAT solver. I am solving it with Python. I think I have an issue of memory consumption.
I am solving a hierarchical model with the use of hints. The program stops after the first solve when solving the second one. The logs and the program stops. I have 64GB of RAM and an intel I9.

Do you have an idea how to avoid this behaviour?

Thanks in advance.
Dan

Laurent Perron

unread,
Sep 12, 2023, 9:53:37 AM9/12/23
to or-tools...@googlegroups.com
did you specify the number of workers ?
Laurent Perron | Operations Research | lpe...@google.com | (33) 1 42 68 53 00



--
You received this message because you are subscribed to the Google Groups "or-tools-discuss" group.
To unsubscribe from this group and stop receiving emails from it, send an email to or-tools-discu...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/or-tools-discuss/6584ae89-6595-4237-9d0e-73641b1945b8n%40googlegroups.com.

Dan G

unread,
Sep 12, 2023, 10:00:28 AM9/12/23
to or-tools-discuss
No, I did not.
What is the best way to use this option?

Laurent Perron

unread,
Sep 12, 2023, 10:05:33 AM9/12/23
to or-tools...@googlegroups.com
How many cores does your processor have ?
What is the size of your model ?

Have you turned on logging ?


Laurent Perron | Operations Research | lpe...@google.com | (33) 1 42 68 53 00


Dan G

unread,
Sep 13, 2023, 2:29:28 PM9/13/23
to or-tools-discuss
Hello Laurent,

I have 8 cores and 16 logical ones.
I did not succeed to use ModelStats() function but below is the log of the run.

Thanks in advance.

Dan

Log:

Starting CP-SAT solver v9.4.1874
Parameters: max_time_in_seconds: 1800 log_search_progress: true
Setting number of workers to 16

Initial optimization model '':
#Variables: 121430 (#ints:1 in objective)
  - 3128 Booleans in [0,1]
  - 56821 in [0,4]
  - 2 in [0,1565]
  - 4658 in [1,200]
  - 9 in [466,1569]
  - 9 in [469,1569]
  - 48 in [472,1569]
  - 9 in [479,1569]
  - 24 in [485,1569]
  - 18 in [486,1569]
  - 18 in [487,1569]
  - 9 in [492,1569]
  - 18 in [493,1569]
  - 18 in [498,1569]
  - 18 in [500,1569]
  - 27 in [501,1569]
  - 36 in [506,1569]
  - 54 in [508,1569]
  - 99 in [512,1569]
  - 27 in [514,1569]
  - 117 in [521,1569]
  - 81 in [522,1569]
  - 468 in [526,1569]
  - 360 in [528,1569]
  - 180 in [532,1569]
  - 234 in [533,1569]
  - 234 in [535,1569]
  - 225 in [536,1569]
  - 243 in [539,1569]
  - 261 in [540,1569]
  - 261 in [541,1569]
  - 270 in [542,1569]
  - 234 in [543,1569]
  - 315 in [546,1569]
  - 611 in [548,1569]
  - 279 in [549,1569]
  - 180 in [550,1569]
  - 450 in [553,1569]
  - 315 in [554,1569]
  - 243 in [555,1569]
  - 340 in [556,1569]
  - 324 in [557,1569]
  - 252 in [560,1569]
  - 403 in [561,1569]
  - 602 in [562,1569]
  - 464 in [563,1569]
  - 189 in [564,1569]
  - 207 in [567,1569]
  - 288 in [568,1569]
  - 189 in [569,1569]
  - 270 in [570,1569]
  - 216 in [571,1569]
  - 189 in [574,1569]
  - 423 in [575,1569]
  - 198 in [576,1569]
  - 306 in [577,1569]
  - 1044 in [578,1569]
  - 340 in [581,1569]
  - 287 in [582,1569]
  - 366 in [583,1569]
  - 465 in [584,1569]
  - 476 in [585,1569]
  - 151 in [588,1569]
  - 323 in [589,1569]
  - 349 in [590,1569]
  - 134 in [591,1569]
  - 555 in [592,1569]
  - 255 in [595,1569]
  - 251 in [596,1569]
  - 529 in [597,1569]
  - 279 in [599,1569]
  - 60 in [602,1569]
  - 78 in [603,1569]
  - 106 in [604,1569]
  - 244 in [611,1569]
  - 38875 in [618,1569]
  - 54 in [646,1569]
  - 738 constants in {487,490,491,504,512,513,514, ... 594,595,596,597,598,599,600,601,602,603,604,611}
#kCumulative: 2 (#intervals: 47197, #optional: 47197, #variable_sizes: 4658)
#kInterval: 61479 (#enforced: 61479)
#kLinear2: 7998 (#enforced: 7998)
#kLinear3: 4658 (#enforced: 4658)
#kLinearN: 2 (#terms: 3130)

Starting presolve at 0.10s
[ExtractEncodingFromLinear] #potential_supersets=0 #potential_subsets=0 #at_most_one_encodings=0 #exactly_one_encodings=0 #unique_terms=0 #multiple_terms=0 #literals=0 time=0.000535543s
[Probing] deterministic_time: 0.00080936 (limit: 1) wall_time: 4.57417 (3830/3830)
[Probing] implications and bool_or (work_done=151398).
[DetectDuplicateConstraints] #duplicates=3999 #without_enforcements=0 time=0.0287838s
[DetectDominatedLinearConstraints] #relevant_constraints=0 #work_done=0 #num_inclusions=0 #num_redundant=0 time=0.000392519s
[DetectOverlappingColumns] #processed_columns=0 #work_done=0 #nz_reduction=0 time=0.00442396s
[ProcessSetPPC] #relevant_constraints=0 #num_inclusions=0 work=0 time=0.00360151s
[Probing] deterministic_time: 0.00091646 (limit: 1) wall_time: 4.524 (3915/3915)
[Probing] implications and bool_or (work_done=143400).
[DetectDuplicateConstraints] #duplicates=0 #without_enforcements=0 time=0.0184425s
[DetectDominatedLinearConstraints] #relevant_constraints=0 #work_done=0 #num_inclusions=0 #num_redundant=0 time=0.000433391s
[DetectOverlappingColumns] #processed_columns=0 #work_done=0 #nz_reduction=0 time=0.00433106s
[ProcessSetPPC] #relevant_constraints=0 #num_inclusions=0 work=0 time=0.00336084s
[Probing] deterministic_time: 0.00091646 (limit: 1) wall_time: 4.58512 (3915/3915)
[Probing] implications and bool_or (work_done=143400).
[DetectDuplicateConstraints] #duplicates=0 #without_enforcements=0 time=0.0189635s
[DetectDominatedLinearConstraints] #relevant_constraints=0 #work_done=0 #num_inclusions=0 #num_redundant=0 time=0.000542943s
[DetectOverlappingColumns] #processed_columns=0 #work_done=0 #nz_reduction=0 time=0.00452677s
[ProcessSetPPC] #relevant_constraints=0 #num_inclusions=0 work=0 time=0.00280588s

Presolve summary:
  - 0 affine relations were detected.
  - rule 'TODO dual: add implied bound' was applied 782550 times.
  - rule 'TODO dual: only one blocking enforced constraint?' was applied 782550 times.
  - rule 'TODO dual: only one unspecified blocking constraint?' was applied 1050966 times.
  - rule 'cumulative: divide demands and capacity by gcd' was applied 1 time.
  - rule 'cumulative: remove never conflicting intervals.' was applied 1 time.
  - rule 'deductions: 12435 stored' was applied 1 time.
  - rule 'duplicate: merged rhs of linear constraint' was applied 3999 times.
  - rule 'duplicate: removed constraint' was applied 3999 times.
  - rule 'linear: fixed or dup variables' was applied 1476 times.
  - rule 'linear: simplified rhs' was applied 7998 times.
  - rule 'linear: variable substitution 0' was applied 2 times.
  - rule 'presolve: 59123 unused variables removed.' was applied 1 time.
  - rule 'presolve: iteration' was applied 3 times.

Presolved optimization model '':
#Variables: 62305 (#bools:1564 in objective)
  - 1564 Booleans in [0,1]
  - 4658 in [1,200]
  - 9 in [466,1569]
  - 9 in [469,1569]
  - 48 in [472,1569]
  - 9 in [479,1569]
  - 24 in [485,1569]
  - 18 in [486,1569]
  - 18 in [487,1569]
  - 9 in [492,1569]
  - 18 in [493,1569]
  - 18 in [498,1569]
  - 18 in [500,1569]
  - 27 in [501,1569]
  - 36 in [506,1569]
  - 54 in [508,1569]
  - 99 in [512,1569]
  - 27 in [514,1569]
  - 117 in [521,1569]
  - 81 in [522,1569]
  - 468 in [526,1569]
  - 360 in [528,1569]
  - 180 in [532,1569]
  - 234 in [533,1569]
  - 234 in [535,1569]
  - 225 in [536,1569]
  - 243 in [539,1569]
  - 261 in [540,1569]
  - 261 in [541,1569]
  - 270 in [542,1569]
  - 234 in [543,1569]
  - 315 in [546,1569]
  - 611 in [548,1569]
  - 279 in [549,1569]
  - 180 in [550,1569]
  - 450 in [553,1569]
  - 315 in [554,1569]
  - 243 in [555,1569]
  - 340 in [556,1569]
  - 324 in [557,1569]
  - 252 in [560,1569]
  - 403 in [561,1569]
  - 602 in [562,1569]
  - 464 in [563,1569]
  - 189 in [564,1569]
  - 207 in [567,1569]
  - 288 in [568,1569]
  - 189 in [569,1569]
  - 270 in [570,1569]
  - 216 in [571,1569]
  - 189 in [574,1569]
  - 423 in [575,1569]
  - 198 in [576,1569]
  - 306 in [577,1569]
  - 1044 in [578,1569]
  - 340 in [581,1569]
  - 287 in [582,1569]
  - 366 in [583,1569]
  - 465 in [584,1569]
  - 476 in [585,1569]
  - 151 in [588,1569]
  - 323 in [589,1569]
  - 349 in [590,1569]
  - 134 in [591,1569]
  - 555 in [592,1569]
  - 255 in [595,1569]
  - 251 in [596,1569]
  - 529 in [597,1569]
  - 279 in [599,1569]
  - 60 in [602,1569]
  - 78 in [603,1569]
  - 106 in [604,1569]
  - 244 in [611,1569]
  - 38875 in [618,1569]
  - 54 in [646,1569]
#kCumulative: 2 (#intervals: 47189, #optional: 47189, #variable_sizes: 4658)
#kInterval: 61479 (#enforced: 61479)
#kLinear1: 351 (#enforced: 351)
#kLinear2: 3648 (#enforced: 3648)
#kLinear3: 4658 (#enforced: 4658)

Preloading model.
#Bound  17.35s best:-inf  next:[-0,1564]  initial_domain
#Model  17.50s var:62305/62305 constraints:70138/70138 compo:49134,1,1,1,1,1,1,1,1,1,...

Starting Search at 17.50s with 16 workers.
11 full subsolvers: [default_lp, fixed, no_lp, max_lp, core, reduced_costs, pseudo_costs, quick_restart, quick_restart_no_lp, lb_tree_search, probing]
Interleaved subsolvers: [feasibility_pump, rnd_var_lns_default, rnd_cst_lns_default, graph_var_lns_default, graph_cst_lns_default, scheduling_random_intervals_lns_default, scheduling_random_precedences_lns_default, scheduling_time_window_lns_default, rins_lns_default, rens_lns_default]
#1     629.16s best:-0    next:[1,1564]   no_lp [hint] fixed_bools:0/87793
#Model 767.28s var:62304/62305 constraints:70138/70138 compo:49134,1,1,1,1,1,1,1,1,1,...
#2     894.17s best:197   next:[198,1564] rnd_var_lns_default(d=0.50 s=53 t=0.10 p=0.00)
#3     924.92s best:1564  next:[]         core fixed_bools:0/57011
#Done  924.97s core

Sub-solver search statistics:
  'max_lp':
     LP statistics:
       final dimension: 2169 rows, 49138 columns, 9736 entries with magnitude in [9.251878e-02, 1.000000e+00]
       total number of simplex iterations: 2513
       num solves:
         - #OPTIMAL: 19976
         - #DUAL_FEASIBLE: 1
       managed constraints: 16787
       merged constraints: 1
       total cuts added: 3 (out of 152 calls)
         - 'CG': 1
         - 'MIR_1': 2

  'reduced_costs':
     LP statistics:
       final dimension: 2390 rows, 49138 columns, 10397 entries with magnitude in [9.290368e-02, 1.000000e+00]
       total number of simplex iterations: 2476
       num solves:
         - #OPTIMAL: 5716
         - #DUAL_FEASIBLE: 165
       managed constraints: 16787
       merged constraints: 1
       total cuts added: 3 (out of 152 calls)
         - 'CG': 1
         - 'MIR_1': 2

  'pseudo_costs':
     LP statistics:
       final dimension: 2164 rows, 49138 columns, 9701 entries with magnitude in [9.290368e-02, 1.000000e+00]
       total number of simplex iterations: 2702
       num solves:
         - #OPTIMAL: 20958
         - #DUAL_FEASIBLE: 166
       managed constraints: 16787
       merged constraints: 1
       total cuts added: 3 (out of 152 calls)
         - 'CG': 1
         - 'MIR_1': 2

  'lb_tree_search':
     LP statistics:
       final dimension: 2392 rows, 49138 columns, 10403 entries with magnitude in [9.290368e-02, 1.000000e+00]
       total number of simplex iterations: 2476
       num solves:
         - #OPTIMAL: 5610
         - #DUAL_FEASIBLE: 165
       managed constraints: 16787
       merged constraints: 1
       total cuts added: 3 (out of 152 calls)
         - 'CG': 1
         - 'MIR_1': 2


Solutions found per subsolver:
  'core': 1
  'no_lp': 1
  'rnd_var_lns_default': 1

Objective bounds found per subsolver:
  'initial_domain': 1

Improving variable bounds shared per subsolver:
  'default_lp': 12429

CpSolverResponse summary:
status: OPTIMAL
objective: 1564
best_bound: 1564
booleans: 87793
conflicts: 0
branches: 137261
propagations: 14542
integer_propagations: 249119
restarts: 4703
lp_iterations: 0
walltime: 930.126
usertime: 930.126
deterministic_time: 2.40163
gap_integral: 16.7785

## Second objective:
XXXXX  Status is Optimal or FEASIBLE
XXXXX  Status is Optimal or FEASIBLE for presolve, hinting can be used
XXXXX  Objective value is: 1564.0
XXXXX  Minimizing objective delayed_projects_count
XXXXX  Solving the CP model.

Starting CP-SAT solver v9.4.1874
Parameters: max_time_in_seconds: 1800 log_search_progress: true
Setting number of workers to 16

Initial optimization model '':
#Variables: 121430 (#ints:1 in objective)
  - 3128 Booleans in [0,1]
  - 56821 in [0,4]
  - 2 in [0,1565]
  - 4658 in [1,200]
  - 9 in [466,1569]
  - 9 in [469,1569]
  - 48 in [472,1569]
  - 9 in [479,1569]
  - 24 in [485,1569]
  - 18 in [486,1569]
  - 18 in [487,1569]
  - 9 in [492,1569]
  - 18 in [493,1569]
  - 18 in [498,1569]
  - 18 in [500,1569]
  - 27 in [501,1569]
  - 36 in [506,1569]
  - 54 in [508,1569]
  - 99 in [512,1569]
  - 27 in [514,1569]
  - 117 in [521,1569]
  - 81 in [522,1569]
  - 468 in [526,1569]
  - 360 in [528,1569]
  - 180 in [532,1569]
  - 234 in [533,1569]
  - 234 in [535,1569]
  - 225 in [536,1569]
  - 243 in [539,1569]
  - 261 in [540,1569]
  - 261 in [541,1569]
  - 270 in [542,1569]
  - 234 in [543,1569]
  - 315 in [546,1569]
  - 611 in [548,1569]
  - 279 in [549,1569]
  - 180 in [550,1569]
  - 450 in [553,1569]
  - 315 in [554,1569]
  - 243 in [555,1569]
  - 340 in [556,1569]
  - 324 in [557,1569]
  - 252 in [560,1569]
  - 403 in [561,1569]
  - 602 in [562,1569]
  - 464 in [563,1569]
  - 189 in [564,1569]
  - 207 in [567,1569]
  - 288 in [568,1569]
  - 189 in [569,1569]
  - 270 in [570,1569]
  - 216 in [571,1569]
  - 189 in [574,1569]
  - 423 in [575,1569]
  - 198 in [576,1569]
  - 306 in [577,1569]
  - 1044 in [578,1569]
  - 340 in [581,1569]
  - 287 in [582,1569]
  - 366 in [583,1569]
  - 465 in [584,1569]
  - 476 in [585,1569]
  - 151 in [588,1569]
  - 323 in [589,1569]
  - 349 in [590,1569]
  - 134 in [591,1569]
  - 555 in [592,1569]
  - 255 in [595,1569]
  - 251 in [596,1569]
  - 529 in [597,1569]
  - 279 in [599,1569]
  - 60 in [602,1569]
  - 78 in [603,1569]
  - 106 in [604,1569]
  - 244 in [611,1569]
  - 38875 in [618,1569]
  - 54 in [646,1569]
  - 738 constants in {487,490,491,504,512,513,514, ... 594,595,596,597,598,599,600,601,602,603,604,611}
#kCumulative: 2 (#intervals: 47197, #optional: 47197, #variable_sizes: 4658)
#kInterval: 61479 (#enforced: 61479)
#kLinear1: 2
#kLinear2: 7998 (#enforced: 7998)
#kLinear3: 4658 (#enforced: 4658)
#kLinearN: 2 (#terms: 3130)

Starting presolve at 0.11s
[ExtractEncodingFromLinear] #potential_supersets=0 #potential_subsets=0 #at_most_one_encodings=0 #exactly_one_encodings=0 #unique_terms=0 #multiple_terms=0 #literals=0 time=0.000548245s
[Probing] deterministic_time: 0.00072956 (limit: 1) wall_time: 4.38407 (2266/2266)
[Probing] implications and bool_or (work_done=151398).
[DetectDuplicateConstraints] #duplicates=3999 #without_enforcements=0 time=0.0263522s
[DetectDominatedLinearConstraints] #relevant_constraints=1 #work_done=0 #num_inclusions=0 #num_redundant=0 time=0.0004414s
[DetectOverlappingColumns] #processed_columns=0 #work_done=0 #nz_reduction=0 time=0.00439495s
[ProcessSetPPC] #relevant_constraints=1 #num_inclusions=0 work=0 time=0.00508411s
[Probing] deterministic_time: 0.00083836 (limit: 1) wall_time: 5.30044 (2351/2351)
[Probing] implications and bool_or (work_done=143400).
[DetectDuplicateConstraints] #duplicates=0 #without_enforcements=0 time=0.0198214s
[DetectDominatedLinearConstraints] #relevant_constraints=1 #work_done=0 #num_inclusions=0 #num_redundant=0 time=0.000451912s
[DetectOverlappingColumns] #processed_columns=0 #work_done=0 #nz_reduction=0 time=0.00469707s
[ProcessSetPPC] #relevant_constraints=1 #num_inclusions=0 work=0 time=0.00299252s
[Probing] deterministic_time: 0.00083836 (limit: 1) wall_time: 4.54921 (2351/2351)
[Probing] implications and bool_or (work_done=143400).
[DetectDuplicateConstraints] #duplicates=0 #without_enforcements=0 time=0.0291891s
[DetectDominatedLinearConstraints] #relevant_constraints=1 #work_done=0 #num_inclusions=0 #num_redundant=0 time=0.00082207s
[DetectOverlappingColumns] #processed_columns=0 #work_done=0 #nz_reduction=0 time=0.00524844s
[ProcessSetPPC] #relevant_constraints=1 #num_inclusions=0 work=0 time=0.0029347s

Presolve summary:
  - 0 affine relations were detected.
  - rule 'TODO dual: add implied bound' was applied 782550 times.
  - rule 'TODO dual: only one blocking enforced constraint?' was applied 782550 times.
  - rule 'TODO dual: only one unspecified blocking constraint?' was applied 1022814 times.
  - rule 'cumulative: divide demands and capacity by gcd' was applied 1 time.
  - rule 'cumulative: remove never conflicting intervals.' was applied 1 time.
  - rule 'deductions: 12435 stored' was applied 1 time.
  - rule 'dual: fix variable' was applied 1564 times.
  - rule 'duplicate: merged rhs of linear constraint' was applied 3999 times.
  - rule 'duplicate: removed constraint' was applied 3999 times.
  - rule 'linear1: without enforcement' was applied 1 time.
  - rule 'linear: always true' was applied 1 time.
  - rule 'linear: fixed or dup variables' was applied 1476 times.
  - rule 'linear: reduced variable domains' was applied 2 times.
  - rule 'linear: simplified rhs' was applied 7999 times.
  - rule 'linear: singleton column' was applied 1 time.
  - rule 'linear: variable substitution 0' was applied 1 time.
  - rule 'presolve: 59123 unused variables removed.' was applied 1 time.
  - rule 'presolve: iteration' was applied 3 times.

Presolved optimization model '':
#Variables: 62305 ( in objective)
  - 1564 Booleans in [0,1]
  - 4658 in [1,200]
  - 9 in [466,1569]
  - 9 in [469,1569]
  - 48 in [472,1569]
  - 9 in [479,1569]
  - 24 in [485,1569]
  - 18 in [486,1569]
  - 18 in [487,1569]
  - 9 in [492,1569]
  - 18 in [493,1569]
  - 18 in [498,1569]
  - 18 in [500,1569]
  - 27 in [501,1569]
  - 36 in [506,1569]
  - 54 in [508,1569]
  - 99 in [512,1569]
  - 27 in [514,1569]
  - 117 in [521,1569]
  - 81 in [522,1569]
  - 468 in [526,1569]
  - 360 in [528,1569]
  - 180 in [532,1569]
  - 234 in [533,1569]
  - 234 in [535,1569]
  - 225 in [536,1569]
  - 243 in [539,1569]
  - 261 in [540,1569]
  - 261 in [541,1569]
  - 270 in [542,1569]
  - 234 in [543,1569]
  - 315 in [546,1569]
  - 611 in [548,1569]
  - 279 in [549,1569]
  - 180 in [550,1569]
  - 450 in [553,1569]
  - 315 in [554,1569]
  - 243 in [555,1569]
  - 340 in [556,1569]
  - 324 in [557,1569]
  - 252 in [560,1569]
  - 403 in [561,1569]
  - 602 in [562,1569]
  - 464 in [563,1569]
  - 189 in [564,1569]
  - 207 in [567,1569]
  - 288 in [568,1569]
  - 189 in [569,1569]
  - 270 in [570,1569]
  - 216 in [571,1569]
  - 189 in [574,1569]
  - 423 in [575,1569]
  - 198 in [576,1569]
  - 306 in [577,1569]
  - 1044 in [578,1569]
  - 340 in [581,1569]
  - 287 in [582,1569]
  - 366 in [583,1569]
  - 465 in [584,1569]
  - 476 in [585,1569]
  - 151 in [588,1569]
  - 323 in [589,1569]
  - 349 in [590,1569]
  - 134 in [591,1569]
  - 555 in [592,1569]
  - 255 in [595,1569]
  - 251 in [596,1569]
  - 529 in [597,1569]
  - 279 in [599,1569]
  - 60 in [602,1569]
  - 78 in [603,1569]
  - 106 in [604,1569]
  - 244 in [611,1569]
  - 38875 in [618,1569]
  - 54 in [646,1569]
#kCumulative: 2 (#intervals: 47189, #optional: 47189, #variable_sizes: 4658)
#kInterval: 61479 (#enforced: 61479)
#kLinear1: 351 (#enforced: 351)
#kLinear2: 3648 (#enforced: 3648)
#kLinear3: 4658 (#enforced: 4658)
#kLinearN: 1 (#terms: 1564)

Preloading model.
#Bound  18.08s best:inf   next:[0,0]      initial_domain
#Model  18.23s var:62305/62305 constraints:70139/70139 compo:49134,1,1,1,1,1,1,1,1,1,...

Starting Search at 18.23s with 16 workers.
10 full subsolvers: [default_lp, fixed, no_lp, max_lp, reduced_costs, pseudo_costs, quick_restart, quick_restart_no_lp, lb_tree_search, probing]
Interleaved subsolvers: [feasibility_pump, rnd_var_lns_default, rnd_cst_lns_default, graph_var_lns_default, graph_cst_lns_default, scheduling_random_intervals_lns_default, scheduling_random_precedences_lns_default, scheduling_time_window_lns_default, rins_lns_default, rens_lns_default]

Laurent Perron

unread,
Sep 13, 2023, 2:46:52 PM9/13/23
to or-tools...@googlegroups.com
does the process stop ? It does not seem too big.

Laurent Perron | Operations Research | lpe...@google.com | (33) 1 42 68 53 00


Frederic Didier

unread,
Sep 13, 2023, 2:56:24 PM9/13/23
to or-tools...@googlegroups.com
A cumulative with 57k intervals can be big as I am not sure we properly disable potentially quadratic algorithms that might explain the apparent stop.
Can you send us the model so we can investigate?
thanks.

Dan G

unread,
Sep 14, 2023, 3:58:34 AM9/14/23
to or-tools-discuss
Hello Frédéric,

I think I can share with you the model. What is the best way to compress the model and to anonymize it (removing the names of the variables)?

I was also thinking it might be a modelling issue. I am new to CP. I am wondering if there is maybe a better may to use the CP-SAT solver to model our RCPSP.

Thanks in advance.

Best Regards,
Dan

Laurent Perron

unread,
Sep 14, 2023, 4:02:21 AM9/14/23
to or-tools...@googlegroups.com
Have you looked at examples/python/rcpsp_sat.py ?

To export the model:

model.ExportToFile('rcpsp.pb.txt')

edit the rcpsp.pb.txt file and delete all lines with a name: tag
compress and send it to us.

Thanks

Laurent Perron | Operations Research | lpe...@google.com | (33) 1 42 68 53 00


Dan G

unread,
Sep 18, 2023, 3:37:09 AM9/18/23
to or-tools-discuss
Hello,

Thank you Laurent for your testing. It appears that the model is exceeding the 64GB of memory. Is there a way to reduce its memory consumption?

Thanks in advance.

Best Regards,
Dan GUGENHEIM

Laurent Perron

unread,
Sep 18, 2023, 4:37:54 AM9/18/23
to or-tools...@googlegroups.com
decompose the model in smaller ones, use less workers

Laurent Perron | Operations Research | lpe...@google.com | (33) 1 42 68 53 00


Dan G

unread,
Sep 19, 2023, 9:59:20 AM9/19/23
to or-tools-discuss
Hello,

I decreased the number of workers to 8 and it went okay. I will look into decomposition techniques later.

Thanks again.

Best Regards,
Dan
Reply all
Reply to author
Forward
0 new messages