174 lines
5.9 KiB
Plaintext
174 lines
5.9 KiB
Plaintext
{
|
|
"cells": [
|
|
{
|
|
"cell_type": "markdown",
|
|
"id": "google",
|
|
"metadata": {},
|
|
"source": [
|
|
"##### Copyright 2022 Google LLC."
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"id": "apache",
|
|
"metadata": {},
|
|
"source": [
|
|
"Licensed under the Apache License, Version 2.0 (the \"License\");\n",
|
|
"you may not use this file except in compliance with the License.\n",
|
|
"You may obtain a copy of the License at\n",
|
|
"\n",
|
|
" http://www.apache.org/licenses/LICENSE-2.0\n",
|
|
"\n",
|
|
"Unless required by applicable law or agreed to in writing, software\n",
|
|
"distributed under the License is distributed on an \"AS IS\" BASIS,\n",
|
|
"WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n",
|
|
"See the License for the specific language governing permissions and\n",
|
|
"limitations under the License.\n"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"id": "basename",
|
|
"metadata": {},
|
|
"source": [
|
|
"# overlapping_intervals_sample_sat"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"id": "link",
|
|
"metadata": {},
|
|
"source": [
|
|
"<table align=\"left\">\n",
|
|
"<td>\n",
|
|
"<a href=\"https://colab.research.google.com/github/google/or-tools/blob/master/examples/notebook/sat/overlapping_intervals_sample_sat.ipynb\"><img src=\"https://raw.githubusercontent.com/google/or-tools/master/tools/colab_32px.png\"/>Run in Google Colab</a>\n",
|
|
"</td>\n",
|
|
"<td>\n",
|
|
"<a href=\"https://github.com/google/or-tools/blob/master/ortools/sat/samples/overlapping_intervals_sample_sat.py\"><img src=\"https://raw.githubusercontent.com/google/or-tools/master/tools/github_32px.png\"/>View source on GitHub</a>\n",
|
|
"</td>\n",
|
|
"</table>"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"id": "doc",
|
|
"metadata": {},
|
|
"source": [
|
|
"First, you must install [ortools](https://pypi.org/project/ortools/) package in this colab."
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": null,
|
|
"id": "install",
|
|
"metadata": {},
|
|
"outputs": [],
|
|
"source": [
|
|
"!pip install ortools"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"id": "description",
|
|
"metadata": {},
|
|
"source": [
|
|
"Code sample to demonstrates how to detect if two intervals overlap.\n"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": null,
|
|
"id": "code",
|
|
"metadata": {},
|
|
"outputs": [],
|
|
"source": [
|
|
"from ortools.sat.python import cp_model\n",
|
|
"\n",
|
|
"\n",
|
|
"class VarArraySolutionPrinter(cp_model.CpSolverSolutionCallback):\n",
|
|
" \"\"\"Print intermediate solutions.\"\"\"\n",
|
|
"\n",
|
|
" def __init__(self, variables):\n",
|
|
" cp_model.CpSolverSolutionCallback.__init__(self)\n",
|
|
" self.__variables = variables\n",
|
|
" self.__solution_count = 0\n",
|
|
"\n",
|
|
" def on_solution_callback(self):\n",
|
|
" self.__solution_count += 1\n",
|
|
" for v in self.__variables:\n",
|
|
" print('%s=%i' % (v, self.Value(v)), end=' ')\n",
|
|
" print()\n",
|
|
"\n",
|
|
" def solution_count(self):\n",
|
|
" return self.__solution_count\n",
|
|
"\n",
|
|
"\n",
|
|
"def OverlappingIntervals():\n",
|
|
" \"\"\"Create the overlapping Boolean variables and enumerate all states.\"\"\"\n",
|
|
" model = cp_model.CpModel()\n",
|
|
"\n",
|
|
" horizon = 7\n",
|
|
"\n",
|
|
" # First interval.\n",
|
|
" start_var_a = model.NewIntVar(0, horizon, 'start_a')\n",
|
|
" duration_a = 3\n",
|
|
" end_var_a = model.NewIntVar(0, horizon, 'end_a')\n",
|
|
" unused_interval_var_a = model.NewIntervalVar(start_var_a, duration_a,\n",
|
|
" end_var_a, 'interval_a')\n",
|
|
"\n",
|
|
" # Second interval.\n",
|
|
" start_var_b = model.NewIntVar(0, horizon, 'start_b')\n",
|
|
" duration_b = 2\n",
|
|
" end_var_b = model.NewIntVar(0, horizon, 'end_b')\n",
|
|
" unused_interval_var_b = model.NewIntervalVar(start_var_b, duration_b,\n",
|
|
" end_var_b, 'interval_b')\n",
|
|
"\n",
|
|
" # a_after_b Boolean variable.\n",
|
|
" a_after_b = model.NewBoolVar('a_after_b')\n",
|
|
" model.Add(start_var_a >= end_var_b).OnlyEnforceIf(a_after_b)\n",
|
|
" model.Add(start_var_a < end_var_b).OnlyEnforceIf(a_after_b.Not())\n",
|
|
"\n",
|
|
" # b_after_a Boolean variable.\n",
|
|
" b_after_a = model.NewBoolVar('b_after_a')\n",
|
|
" model.Add(start_var_b >= end_var_a).OnlyEnforceIf(b_after_a)\n",
|
|
" model.Add(start_var_b < end_var_a).OnlyEnforceIf(b_after_a.Not())\n",
|
|
"\n",
|
|
" # Result Boolean variable.\n",
|
|
" a_overlaps_b = model.NewBoolVar('a_overlaps_b')\n",
|
|
"\n",
|
|
" # Option a: using only clauses\n",
|
|
" model.AddBoolOr(a_after_b, b_after_a, a_overlaps_b)\n",
|
|
" model.AddImplication(a_after_b, a_overlaps_b.Not())\n",
|
|
" model.AddImplication(b_after_a, a_overlaps_b.Not())\n",
|
|
"\n",
|
|
" # Option b: using an exactly one constraint.\n",
|
|
" # model.AddExactlyOne(a_after_b, b_after_a, a_overlaps_b)\n",
|
|
"\n",
|
|
" # Search for start values in increasing order for the two intervals.\n",
|
|
" model.AddDecisionStrategy([start_var_a, start_var_b], cp_model.CHOOSE_FIRST,\n",
|
|
" cp_model.SELECT_MIN_VALUE)\n",
|
|
"\n",
|
|
" # Create a solver and solve with a fixed search.\n",
|
|
" solver = cp_model.CpSolver()\n",
|
|
"\n",
|
|
" # Force the solver to follow the decision strategy exactly.\n",
|
|
" solver.parameters.search_branching = cp_model.FIXED_SEARCH\n",
|
|
" # Enumerate all solutions.\n",
|
|
" solver.parameters.enumerate_all_solutions = True\n",
|
|
"\n",
|
|
" # Search and print out all solutions.\n",
|
|
" solution_printer = VarArraySolutionPrinter(\n",
|
|
" [start_var_a, start_var_b, a_overlaps_b])\n",
|
|
" solver.Solve(model, solution_printer)\n",
|
|
"\n",
|
|
"\n",
|
|
"OverlappingIntervals()\n",
|
|
"\n"
|
|
]
|
|
}
|
|
],
|
|
"metadata": {},
|
|
"nbformat": 4,
|
|
"nbformat_minor": 5
|
|
}
|