Files
ortools-clone/ortools/sat/samples/assignment_teams_sat.py

114 lines
3.2 KiB
Python
Raw Permalink Normal View History

2021-11-03 13:00:40 +01:00
#!/usr/bin/env python3
2025-01-10 11:35:44 +01:00
# Copyright 2010-2025 Google LLC
2021-11-03 13:00:40 +01:00
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# 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.
2022-06-22 17:51:14 +02:00
2021-11-03 13:00:40 +01:00
# [START program]
2023-11-16 19:46:56 +01:00
"""Solves a simple assignment problem."""
2021-11-03 13:00:40 +01:00
# [START import]
from ortools.sat.python import cp_model
2025-06-02 14:25:50 +02:00
2021-11-03 13:00:40 +01:00
# [END import]
2023-11-22 17:33:01 +01:00
def main() -> None:
2021-11-03 13:00:40 +01:00
# Data
# [START data]
costs = [
[90, 76, 75, 70],
[35, 85, 55, 65],
[125, 95, 90, 105],
[45, 110, 95, 115],
[60, 105, 80, 75],
[45, 65, 110, 95],
]
num_workers = len(costs)
num_tasks = len(costs[0])
team1 = [0, 2, 4]
team2 = [1, 3, 5]
# Maximum total of tasks for any team
team_max = 2
# [END data]
# Model
# [START model]
model = cp_model.CpModel()
# [END model]
# Variables
# [START variables]
x = {}
for worker in range(num_workers):
for task in range(num_tasks):
2023-11-16 19:46:56 +01:00
x[worker, task] = model.new_bool_var(f"x[{worker},{task}]")
2021-11-03 13:00:40 +01:00
# [END variables]
# Constraints
# [START constraints]
# Each worker is assigned to at most one task.
for worker in range(num_workers):
2023-11-16 19:46:56 +01:00
model.add_at_most_one(x[worker, task] for task in range(num_tasks))
2021-11-03 13:00:40 +01:00
# Each task is assigned to exactly one worker.
for task in range(num_tasks):
2023-11-16 19:46:56 +01:00
model.add_exactly_one(x[worker, task] for worker in range(num_workers))
2021-11-03 13:00:40 +01:00
# Each team takes at most two tasks.
team1_tasks = []
for worker in team1:
for task in range(num_tasks):
team1_tasks.append(x[worker, task])
2023-11-16 19:46:56 +01:00
model.add(sum(team1_tasks) <= team_max)
2021-11-03 13:00:40 +01:00
team2_tasks = []
for worker in team2:
for task in range(num_tasks):
team2_tasks.append(x[worker, task])
2023-11-16 19:46:56 +01:00
model.add(sum(team2_tasks) <= team_max)
2021-11-03 13:00:40 +01:00
# [END constraints]
# Objective
# [START objective]
objective_terms = []
for worker in range(num_workers):
for task in range(num_tasks):
objective_terms.append(costs[worker][task] * x[worker, task])
2023-11-16 19:46:56 +01:00
model.minimize(sum(objective_terms))
2021-11-03 13:00:40 +01:00
# [END objective]
# Solve
# [START solve]
solver = cp_model.CpSolver()
2023-11-16 19:46:56 +01:00
status = solver.solve(model)
2021-11-03 13:00:40 +01:00
# [END solve]
# Print solution.
# [START print_solution]
if status == cp_model.OPTIMAL or status == cp_model.FEASIBLE:
2023-11-16 19:46:56 +01:00
print(f"Total cost = {solver.objective_value}\n")
2021-11-03 13:00:40 +01:00
for worker in range(num_workers):
for task in range(num_tasks):
2023-11-16 19:46:56 +01:00
if solver.boolean_value(x[worker, task]):
print(
f"Worker {worker} assigned to task {task}."
+ f" Cost = {costs[worker][task]}"
)
2021-11-03 13:00:40 +01:00
else:
print("No solution found.")
2021-11-03 13:00:40 +01:00
# [END print_solution]
if __name__ == "__main__":
2021-11-03 13:00:40 +01:00
main()
# [END program]