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

use black on examples/python

Browse Source
This commit is contained in:
Laurent Perron
2023-07-01 06:06:53 +02:00
parent d65333dab0
commit 84ec414e61
41 changed files with 18801 additions and 4140 deletions
Download Patch File Download Diff File Expand all files Collapse all files

71
examples/python/assignment_with_constraints_sat.py
View File

@@ -11,6 +11,7 @@
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
"""Solve an assignment problem with combination constraints on workers."""
from typing import Sequence
@@ -21,19 +22,27 @@ from ortools.sat.python import cp_model
def solve_assignment():
"""Solve the assignment problem."""
# Data.
cost = [[90, 76, 75, 70, 50, 74], [35, 85, 55, 65, 48, 101],
[125, 95, 90, 105, 59, 120], [45, 110, 95, 115, 104, 83],
[60, 105, 80, 75, 59, 62], [45, 65, 110, 95, 47, 31],
[38, 51, 107, 41, 69, 99], [47, 85, 57, 71, 92, 77],
[39, 63, 97, 49, 118, 56], [47, 101, 71, 60, 88, 109],
[17, 39, 103, 64, 61, 92], [101, 45, 83, 59, 92, 27]]
cost = [
[90, 76, 75, 70, 50, 74],
[35, 85, 55, 65, 48, 101],
[125, 95, 90, 105, 59, 120],
[45, 110, 95, 115, 104, 83],
[60, 105, 80, 75, 59, 62],
[45, 65, 110, 95, 47, 31],
[38, 51, 107, 41, 69, 99],
[47, 85, 57, 71, 92, 77],
[39, 63, 97, 49, 118, 56],
[47, 101, 71, 60, 88, 109],
[17, 39, 103, 64, 61, 92],
[101, 45, 83, 59, 92, 27],
]
group1 = [
[0, 0, 1, 1], # Workers 2, 3
[0, 1, 0, 1], # Workers 1, 3
[0, 1, 1, 0], # Workers 1, 2
[1, 1, 0, 0], # Workers 0, 1
[1, 0, 1, 0]
[1, 0, 1, 0],
] # Workers 0, 2
group2 = [
@@ -41,7 +50,7 @@ def solve_assignment():
[0, 1, 0, 1], # Workers 5, 7
[0, 1, 1, 0], # Workers 5, 6
[1, 1, 0, 0], # Workers 4, 5
[1, 0, 0, 1]
[1, 0, 0, 1],
] # Workers 4, 7
group3 = [
@@ -49,7 +58,7 @@ def solve_assignment():
[0, 1, 0, 1], # Workers 9, 11
[0, 1, 1, 0], # Workers 9, 10
[1, 0, 1, 0], # Workers 8, 10
[1, 0, 0, 1]
[1, 0, 0, 1],
] # Workers 8, 11
sizes = [10, 7, 3, 12, 15, 4, 11, 5]
@@ -63,10 +72,10 @@ def solve_assignment():
model = cp_model.CpModel()
# Variables
selected = [[model.NewBoolVar('x[%i,%i]' % (i, j))
for j in all_tasks]
for i in all_workers]
works = [model.NewBoolVar('works[%i]' % i) for i in all_workers]
selected = [
[model.NewBoolVar("x[%i,%i]" % (i, j)) for j in all_tasks] for i in all_workers
]
works = [model.NewBoolVar("works[%i]" % i) for i in all_workers]
# Constraints
@@ -80,49 +89,45 @@ def solve_assignment():
# Total task size for each worker is at most total_size_max
for i in all_workers:
model.Add(
sum(sizes[j] * selected[i][j] for j in all_tasks) <= total_size_max)
model.Add(sum(sizes[j] * selected[i][j] for j in all_tasks) <= total_size_max)
# Group constraints.
model.AddAllowedAssignments([works[0], works[1], works[2], works[3]],
group1)
model.AddAllowedAssignments([works[4], works[5], works[6], works[7]],
group2)
model.AddAllowedAssignments([works[8], works[9], works[10], works[11]],
group3)
model.AddAllowedAssignments([works[0], works[1], works[2], works[3]], group1)
model.AddAllowedAssignments([works[4], works[5], works[6], works[7]], group2)
model.AddAllowedAssignments([works[8], works[9], works[10], works[11]], group3)
# Objective
model.Minimize(
sum(selected[i][j] * cost[i][j]
for j in all_tasks
for i in all_workers))
sum(selected[i][j] * cost[i][j] for j in all_tasks for i in all_workers)
)
# Solve and output solution.
solver = cp_model.CpSolver()
status = solver.Solve(model)
if status == cp_model.OPTIMAL:
print('Total cost = %i' % solver.ObjectiveValue())
print("Total cost = %i" % solver.ObjectiveValue())
print()
for i in all_workers:
for j in all_tasks:
if solver.BooleanValue(selected[i][j]):
print('Worker ', i, ' assigned to task ', j, ' Cost = ',
cost[i][j])
print(
"Worker ", i, " assigned to task ", j, " Cost = ", cost[i][j]
)
print()
print('Statistics')
print(' - conflicts : %i' % solver.NumConflicts())
print(' - branches : %i' % solver.NumBranches())
print(' - wall time : %f s' % solver.WallTime())
print("Statistics")
print(" - conflicts : %i" % solver.NumConflicts())
print(" - branches : %i" % solver.NumBranches())
print(" - wall time : %f s" % solver.WallTime())
def main(argv: Sequence[str]) -> None:
if len(argv) > 1:
raise app.UsageError('Too many command-line arguments.')
raise app.UsageError("Too many command-line arguments.")
solve_assignment()
if __name__ == '__main__':
if __name__ == "__main__":
app.run(main)