always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix code

Browse Source
This commit is contained in:
Laurent Perron
2018-09-09 15:28:43 +02:00
parent 28c2d91345
commit cb7ae1359a
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
examples/python/task_allocation_sat.py
View File

@@ -108,9 +108,9 @@ def main():
for i in I:
model.Add(sum(x[(i, t)] for t in T if available[i][t] == 1) == 1)
for t in T:
model.Add(sum(x[(i, t)] for i in I if available[i][t] == 1) <= N)
model.AddBoolOr([x[(i, t)] for i in I if available[i][t] == 1]).OnlyEnforceIf(used[t])
for t in T:
model.Add(sum(x[(i, t)] for i in I if available[i][t] == 1) <= N)
model.AddBoolOr([x[(i, t)] for i in I if available[i][t] == 1]).OnlyEnforceIf(used[t])
for i in I:
if available[i][t] == 1:
model.AddImplication(used[t].Not(), x[(i, t)].Not())
@@ -119,14 +119,14 @@ def main():
model.Add(count == sum(used))
# Redundant constraint. This instance is trivial if we add this constraint.
# model.Add(count >= (nslots + N - 1) // N)]
# model.Add(count >= (nslots + N - 1) // N)
model.Minimize(count)
# Create a solver and solve the problem.
solver = cp_model.CpSolver()
# Dual approach.
solver.parameters.optimize_with_core = True
# Uses the portfolion of heuristics.
solver.parameters.num_search_workers = 6
# Log search.
solution_printer = ObjectiveSolutionPrinter()
status = solver.SolveWithSolutionCallback(model, solution_printer)