or-tools 0.2.0 → 0.3.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 4377b9acdd93be666c700e05fb56cf01e59f088cf149f345ab888ef018c82d04
-  data.tar.gz: f32d95eb857cf479db372f4c0c27b18590bb9137aa72a9b6e478789830b7ea68
+  metadata.gz: dba74899e2a57b086643657e5093f12e67fd4fcdda7e22c2b533911f9991e43a
+  data.tar.gz: 963c0b75f55b4b772ead3a8402ec8bb4b90570c23de1c7dc3a437758e8949af2
 SHA512:
-  metadata.gz: ab952c566d3f84c57cce0b843c27ad6e3fa9c06f4e85b273af2c82564403cd6bb88e8f8ae1d39c21f5732e4d3415729b8d4bd87418a34f0d02c588d816ab9d49
-  data.tar.gz: 95a03e432680341c029e21ae2148385c1628a7df127ea8707991a47d087f37cd5ebb4288518f16b1cfd7c84c03a254c0cf8c26c5c8d574b949c3ed3901ca9cfe
+  metadata.gz: a5dc8662ec580c97a905817867346615e2fbb187d5b75d6b2b839a86e7385a20b2ed4f9f4c13ed536079c6141cdd0bf95bfad7ea6408d4eb81d8f0ed09e32a68
+  data.tar.gz: 195967d1e662ba05751ff31fbec3c96ebac519cd58a343ca551f9ba6c12304542b7f4127a37f88e99cda6b214d42089df7ed9b5a3134c0ec1eb978ea72a95be4

data/CHANGELOG.md

@@ -1,3 +1,29 @@
+## 0.3.4 (2021-01-14)
+
+- Added support for time limit for `CpSolver`
+- Added `add_dimension_with_vehicle_transits` and `status` methods to `RoutingModel`
+
+## 0.3.3 (2020-10-12)
+
+- Added support for start and end points for routing
+
+## 0.3.2 (2020-08-04)
+
+- Updated OR-Tools to 7.8
+- Added binary installation for Ubuntu 20.04
+
+## 0.3.1 (2020-07-21)
+
+- Reduced gem size
+
+## 0.3.0 (2020-07-21)
+
+- Updated OR-Tools to 7.7
+- Added `BasicScheduler` class
+- Added `Seating` class
+- Added `TSP` class
+- Added `Sudoku` class
+
 ## 0.2.0 (2020-05-22)
 
 - No longer need to download the OR-Tools C++ library separately on Mac, Ubuntu 18.04, Ubuntu 16.04, Debian 10, and CentOS 8

data/NOTICE.txt

@@ -1,4 +1,5 @@
-Copyright 2020 Andrew Kane
+Copyright 2010-2018 Google LLC
+Copyright 2020-2021 Andrew Kane
 
 Licensed under the Apache License, Version 2.0 (the "License");
 you may not use this file except in compliance with the License.

data/README.md

@@ -2,7 +2,7 @@
 
 [OR-Tools](https://github.com/google/or-tools) - operations research tools - for Ruby
 
-[![Build Status](https://travis-ci.org/ankane/or-tools.svg?branch=master)](https://travis-ci.org/ankane/or-tools)
+[![Build Status](https://github.com/ankane/or-tools/workflows/build/badge.svg?branch=master)](https://github.com/ankane/or-tools/actions)
 
 ## Installation
 
@@ -14,26 +14,269 @@ gem 'or-tools'
 
 Installation can take a few minutes as OR-Tools downloads and builds.
 
-## Getting Started
+## Higher Level Interfaces
+
+- [Scheduling](#scheduling)
+- [Seating](#seating)
+- [Traveling Salesperson Problem (TSP)](#traveling-salesperson-problem-tsp)
+- [Sudoku](#sudoku)
+
+### Scheduling
+
+Specify people and their availabililty
+
+```ruby
+people = [
+  {
+    availability: [
+      {starts_at: Time.parse("2020-01-01 08:00:00"), ends_at: Time.parse("2020-01-01 16:00:00")},
+      {starts_at: Time.parse("2020-01-02 08:00:00"), ends_at: Time.parse("2020-01-02 16:00:00")}
+    ],
+    max_hours: 40 # optional, applies to entire scheduling period
+  },
+  {
+    availability: [
+      {starts_at: Time.parse("2020-01-01 08:00:00"), ends_at: Time.parse("2020-01-01 16:00:00")},
+      {starts_at: Time.parse("2020-01-03 08:00:00"), ends_at: Time.parse("2020-01-03 16:00:00")}
+    ],
+    max_hours: 20
+  }
+]
+```
+
+Specify shifts
+
+```ruby
+shifts = [
+  {starts_at: Time.parse("2020-01-01 08:00:00"), ends_at: Time.parse("2020-01-01 16:00:00")},
+  {starts_at: Time.parse("2020-01-02 08:00:00"), ends_at: Time.parse("2020-01-02 16:00:00")},
+  {starts_at: Time.parse("2020-01-03 08:00:00"), ends_at: Time.parse("2020-01-03 16:00:00")}
+]
+```
+
+Run the scheduler
+
+```ruby
+scheduler = ORTools::BasicScheduler.new(people: people, shifts: shifts)
+```
+
+The scheduler maximizes the number of assigned hours. A person must be available for the entire shift to be considered for it.
+
+Get assignments (returns indexes of people and shifts)
+
+```ruby
+scheduler.assignments
+# [
+#   {person: 2, shift: 0},
+#   {person: 0, shift: 1},
+#   {person: 1, shift: 2}
+# ]
+```
+
+Get assigned hours and total hours
+
+```ruby
+scheduler.assigned_hours
+scheduler.total_hours
+```
+
+Feel free to create an issue if you have a scheduling use case that’s not covered.
+
+### Seating
+
+Create a seating chart based on personal connections. Uses [this approach](https://www.improbable.com/news/2012/Optimal-seating-chart.pdf).
+
+Specify connections
+
+```ruby
+connections = [
+  {people: ["A", "B", "C"], weight: 2},
+  {people: ["C", "D", "E", "F"], weight: 1}
+]
+```
+
+Use different weights to prioritize seating. For a wedding, it may look like:
+
+```ruby
+connections = [
+  {people: knows_partner1, weight: 1},
+  {people: knows_partner2, weight: 1},
+  {people: relationship1, weight: 100},
+  {people: relationship2, weight: 100},
+  {people: relationship3, weight: 100},
+  {people: friend_group1, weight: 10},
+  {people: friend_group2, weight: 10},
+  # ...
+]
+```
+
+If two people have multiple connections, weights are added.
+
+Specify tables and their capacity
+
+```ruby
+tables = [3, 3]
+```
+
+Assign seats
+
+```ruby
+seating = ORTools::Seating.new(connections: connections, tables: tables)
+```
+
+Each person will have a connection with at least one other person at their table.
+
+Get tables
+
+```ruby
+seating.assigned_tables
+```
+
+Get assignments by person
+
+```ruby
+seating.assignments
+```
+
+Get all connections for a person
+
+```ruby
+seating.connections_for(person)
+```
+
+Get connections for a person at their table
+
+```ruby
+seating.connections_for(person, same_table: true)
+```
+
+### Traveling Salesperson Problem (TSP)
+
+Create locations - the first location will be the starting and ending point
+
+```ruby
+locations = [
+  {name: "Tokyo", latitude: 35.6762, longitude: 139.6503},
+  {name: "Delhi", latitude: 28.7041, longitude: 77.1025},
+  {name: "Shanghai", latitude: 31.2304, longitude: 121.4737},
+  {name: "São Paulo", latitude: -23.5505, longitude: -46.6333},
+  {name: "Mexico City", latitude: 19.4326, longitude: -99.1332},
+  {name: "Cairo", latitude: 30.0444, longitude: 31.2357},
+  {name: "Mumbai", latitude: 19.0760, longitude: 72.8777},
+  {name: "Beijing", latitude: 39.9042, longitude: 116.4074},
+  {name: "Dhaka", latitude: 23.8103, longitude: 90.4125},
+  {name: "Osaka", latitude: 34.6937, longitude: 135.5023},
+  {name: "New York City", latitude: 40.7128, longitude: -74.0060},
+  {name: "Karachi", latitude: 24.8607, longitude: 67.0011},
+  {name: "Buenos Aires", latitude: -34.6037, longitude: -58.3816}
+]
+```
+
+Locations can have any fields - only `latitude` and `longitude` are required
+
+Get route
+
+```ruby
+tsp = ORTools::TSP.new(locations)
+tsp.route # [{name: "Tokyo", ...}, {name: "Osaka", ...}, ...]
+```
+
+Get distances between locations on route
+
+```ruby
+tsp.distances # [392.441, 1362.926, 1067.31, ...]
+```
+
+Distances are in kilometers - multiply by `0.6214` for miles
+
+Get total distance
+
+```ruby
+tsp.total_distance
+```
+
+### Sudoku
+
+Create a puzzle with zeros in empty cells
+
+```ruby
+grid = [
+  [0, 6, 0, 0, 5, 0, 0, 2, 0],
+  [0, 0, 0, 3, 0, 0, 0, 9, 0],
+  [7, 0, 0, 6, 0, 0, 0, 1, 0],
+  [0, 0, 6, 0, 3, 0, 4, 0, 0],
+  [0, 0, 4, 0, 7, 0, 1, 0, 0],
+  [0, 0, 5, 0, 9, 0, 8, 0, 0],
+  [0, 4, 0, 0, 0, 1, 0, 0, 6],
+  [0, 3, 0, 0, 0, 8, 0, 0, 0],
+  [0, 2, 0, 0, 4, 0, 0, 5, 0]
+]
+sudoku = ORTools::Sudoku.new(grid)
+sudoku.solution
+```
+
+It can also solve more advanced puzzles like [The Miracle](https://www.youtube.com/watch?v=yKf9aUIxdb4)
+
+```ruby
+grid = [
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 1, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 2, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0]
+]
+sudoku = ORTools::Sudoku.new(grid, anti_knight: true, anti_king: true, non_consecutive: true)
+sudoku.solution
+```
+
+And [this 4-digit puzzle](https://www.youtube.com/watch?v=hAyZ9K2EBF0)
+
+```ruby
+grid = [
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [3, 8, 4, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 0],
+  [0, 0, 0, 0, 0, 0, 0, 0, 2]
+]
+sudoku = ORTools::Sudoku.new(grid, x: true, anti_knight: true, magic_square: true)
+sudoku.solution
+```
+
+## Guides
 
 Linear Optimization
 
 - [The Glop Linear Solver](#the-glop-linear-solver)
 
+Integer Optimization
+
+- [Mixed-Integer Programming](#mixed-integer-programming)
+
 Constraint Optimization
 
 - [CP-SAT Solver](#cp-sat-solver)
 - [Solving an Optimization Problem](#solving-an-optimization-problem)
 - [Cryptarithmetic](#cryptarithmetic)
 - [The N-queens Problem](#the-n-queens-problem)
+- [Setting Solver Limits](#setting-solver-limits) [master]
 
-Integer Optimization
+Assignment
 
-- [Mixed-Integer Programming](#mixed-integer-programming)
+- [Assignment](#assignment)
+- [Assignment with Teams](#assignment-with-teams)
 
 Routing
 
-- [Traveling Salesperson Problem (TSP)](#traveling-salesperson-problem-tsp)
+- [Traveling Salesperson Problem (TSP)](#traveling-salesperson-problem-tsp-1)
 - [Vehicle Routing Problem (VRP)](#vehicle-routing-problem-vrp)
 - [Capacity Constraints](#capacity-constraints)
 - [Pickups and Deliveries](#pickups-and-deliveries)
@@ -52,12 +295,7 @@ Network Flows
 
 - [Maximum Flows](#maximum-flows)
 - [Minimum Cost Flows](#minimum-cost-flows)
-
-Assignment
-
-- [Assignment](#assignment)
-- [Assignment as a Min Cost Problem](#assignment-as-a-min-cost-problem)
-- [Assignment as a MIP Problem](#assignment-as-a-mip-problem)
+- [Assignment as a Min Cost Flow Problem](#assignment-as-a-min-cost-flow-problem)
 
 Scheduling
 
@@ -66,7 +304,7 @@ Scheduling
 
 Other Examples
 
-- [Sudoku](#sudoku)
+- [Sudoku](#sudoku-1)
 - [Wedding Seating Chart](#wedding-seating-chart)
 - [Set Partitioning](#set-partitioning)
 
@@ -114,6 +352,52 @@ puts "y = #{y.solution_value}"
 puts "Optimal objective value = #{opt_solution}"
 ```
 
+### Mixed-Integer Programming
+
+[Guide](https://developers.google.com/optimization/mip/integer_opt)
+
+```ruby
+# declare the MIP solver
+solver = ORTools::Solver.new("simple_mip_program", :cbc)
+
+# define the variables
+infinity = solver.infinity
+x = solver.int_var(0.0, infinity, "x")
+y = solver.int_var(0.0, infinity, "y")
+
+puts "Number of variables = #{solver.num_variables}"
+
+# define the constraints
+c0 = solver.constraint(-infinity, 17.5)
+c0.set_coefficient(x, 1)
+c0.set_coefficient(y, 7)
+
+c1 = solver.constraint(-infinity, 3.5)
+c1.set_coefficient(x, 1);
+c1.set_coefficient(y, 0);
+
+puts "Number of constraints = #{solver.num_constraints}"
+
+# define the objective
+objective = solver.objective
+objective.set_coefficient(x, 1)
+objective.set_coefficient(y, 10)
+objective.set_maximization
+
+# call the solver
+status = solver.solve
+
+# display the solution
+if status == :optimal
+  puts "Solution:"
+  puts "Objective value = #{solver.objective.value}"
+  puts "x = #{x.solution_value}"
+  puts "y = #{y.solution_value}"
+else
+  puts "The problem does not have an optimal solution."
+end
+```
+
 ### CP-SAT Solver
 
 [Guide](https://developers.google.com/optimization/cp/cp_solver)
@@ -136,7 +420,7 @@ solver = ORTools::CpSolver.new
 status = solver.solve(model)
 
 # display the first solution
-if status == :feasible
+if status == :optimal
   puts "x = #{solver.value(x)}"
   puts "y = #{solver.value(y)}"
   puts "z = #{solver.value(z)}"
@@ -295,50 +579,152 @@ puts
 puts "Solutions found : %i" % solution_printer.solution_count
 ```
 
-### Mixed-Integer Programming
+### Setting Solver Limits
 
-[Guide](https://developers.google.com/optimization/mip/integer_opt)
+[Guide](https://developers.google.com/optimization/cp/cp_tasks)
 
 ```ruby
-# declare the MIP solver
-solver = ORTools::Solver.new("simple_mip_program", :cbc)
+# create the model
+model = ORTools::CpModel.new
 
-# define the variables
-infinity = solver.infinity
-x = solver.int_var(0.0, infinity, "x")
-y = solver.int_var(0.0, infinity, "y")
+# create the variables
+num_vals = 3
+x = model.new_int_var(0, num_vals - 1, "x")
+y = model.new_int_var(0, num_vals - 1, "y")
+z = model.new_int_var(0, num_vals - 1, "z")
 
-puts "Number of variables = #{solver.num_variables}"
+# add an all-different constraint
+model.add(x != y)
 
-# define the constraints
-c0 = solver.constraint(-infinity, 17.5)
-c0.set_coefficient(x, 1)
-c0.set_coefficient(y, 7)
+# create the solver
+solver = ORTools::CpSolver.new
 
-c1 = solver.constraint(-infinity, 3.5)
-c1.set_coefficient(x, 1);
-c1.set_coefficient(y, 0);
+# set a time limit of 10 seconds.
+solver.parameters.max_time_in_seconds = 10
 
-puts "Number of constraints = #{solver.num_constraints}"
+# solve the model
+status = solver.solve(model)
 
-# define the objective
-objective = solver.objective
-objective.set_coefficient(x, 1)
-objective.set_coefficient(y, 10)
-objective.set_maximization
+# display the first solution
+if status == :optimal
+  puts "x = #{solver.value(x)}"
+  puts "y = #{solver.value(y)}"
+  puts "z = #{solver.value(z)}"
+end
+```
 
-# call the solver
-status = solver.solve
+### Assignment
 
-# display the solution
-if status == :optimal
-  puts "Solution:"
-  puts "Objective value = #{solver.objective.value}"
-  puts "x = #{x.solution_value}"
-  puts "y = #{y.solution_value}"
-else
-  puts "The problem does not have an optimal solution."
+[Guide](https://developers.google.com/optimization/assignment/assignment_example)
+
+```ruby
+# create the data
+cost = [[ 90,  76, 75,  70],
+        [ 35,  85, 55,  65],
+        [125,  95, 90, 105],
+        [ 45, 110, 95, 115]]
+
+rows = cost.length
+cols = cost[0].length
+
+# create the solver
+assignment = ORTools::LinearSumAssignment.new
+
+# add the costs to the solver
+rows.times do |worker|
+  cols.times do |task|
+    if cost[worker][task]
+      assignment.add_arc_with_cost(worker, task, cost[worker][task])
+    end
+  end
+end
+
+# invoke the solver
+solve_status = assignment.solve
+if solve_status == :optimal
+  puts "Total cost = #{assignment.optimal_cost}"
+  puts
+  assignment.num_nodes.times do |i|
+    puts "Worker %d assigned to task %d.  Cost = %d" % [
+      i,
+      assignment.right_mate(i),
+      assignment.assignment_cost(i)
+    ]
+  end
+elsif solve_status == :infeasible
+  puts "No assignment is possible."
+elsif solve_status == :possible_overflow
+  puts "Some input costs are too large and may cause an integer overflow."
+end
+```
+
+### Assignment with Teams
+
+[Guide](https://developers.google.com/optimization/assignment/assignment_teams)
+
+```ruby
+# create the solver
+solver = ORTools::Solver.new("SolveAssignmentProblemMIP", :cbc)
+
+# create the data
+cost = [[90, 76, 75, 70],
+        [35, 85, 55, 65],
+        [125, 95, 90, 105],
+        [45, 110, 95, 115],
+        [60, 105, 80, 75],
+        [45, 65, 110, 95]]
+
+team1 = [0, 2, 4]
+team2 = [1, 3, 5]
+team_max = 2
+
+# create the variables
+num_workers = cost.length
+num_tasks = cost[1].length
+x = {}
+
+num_workers.times do |i|
+  num_tasks.times do |j|
+    x[[i, j]] = solver.bool_var("x[#{i},#{j}]")
+  end
 end
+
+# create the objective function
+solver.minimize(solver.sum(
+  num_workers.times.flat_map { |i| num_tasks.times.map { |j| x[[i, j]] * cost[i][j] } }
+))
+
+# create the constraints
+num_workers.times do |i|
+  solver.add(solver.sum(num_tasks.times.map { |j| x[[i, j]] }) <= 1)
+end
+
+num_tasks.times do |j|
+  solver.add(solver.sum(num_workers.times.map { |i| x[[i, j]] }) == 1)
+end
+
+solver.add(solver.sum(team1.flat_map { |i| num_tasks.times.map { |j| x[[i, j]] } }) <= team_max)
+solver.add(solver.sum(team2.flat_map { |i| num_tasks.times.map { |j| x[[i, j]] } }) <= team_max)
+
+# invoke the solver
+sol = solver.solve
+
+puts "Total cost = #{solver.objective.value}"
+puts
+num_workers.times do |i|
+  num_tasks.times do |j|
+    if x[[i, j]].solution_value > 0
+      puts "Worker %d assigned to task %d.  Cost = %d" % [
+        i,
+        j,
+        cost[i][j]
+      ]
+    end
+  end
+end
+
+puts
+puts "Time = #{solver.wall_time} milliseconds"
 ```
 
 ### Traveling Salesperson Problem (TSP)
@@ -380,7 +766,7 @@ transit_callback_index = routing.register_transit_callback(distance_callback)
 routing.set_arc_cost_evaluator_of_all_vehicles(transit_callback_index)
 
 # run the solver
-assignment = routing.solve(first_solution_strategy: :path_cheaper_arc)
+assignment = routing.solve(first_solution_strategy: :path_cheapest_arc)
 
 # print the solution
 puts "Objective: #{assignment.objective_value} miles"
@@ -1276,52 +1662,7 @@ else
 end
 ```
 
-### Assignment
-
-[Guide](https://developers.google.com/optimization/assignment/simple_assignment)
-
-```ruby
-# create the data
-cost = [[ 90,  76, 75,  70],
-        [ 35,  85, 55,  65],
-        [125,  95, 90, 105],
-        [ 45, 110, 95, 115]]
-
-rows = cost.length
-cols = cost[0].length
-
-# create the solver
-assignment = ORTools::LinearSumAssignment.new
-
-# add the costs to the solver
-rows.times do |worker|
-  cols.times do |task|
-    if cost[worker][task]
-      assignment.add_arc_with_cost(worker, task, cost[worker][task])
-    end
-  end
-end
-
-# invoke the solver
-solve_status = assignment.solve
-if solve_status == :optimal
-  puts "Total cost = #{assignment.optimal_cost}"
-  puts
-  assignment.num_nodes.times do |i|
-    puts "Worker %d assigned to task %d.  Cost = %d" % [
-      i,
-      assignment.right_mate(i),
-      assignment.assignment_cost(i)
-    ]
-  end
-elsif solve_status == :infeasible
-  puts "No assignment is possible."
-elsif solve_status == :possible_overflow
-  puts "Some input costs are too large and may cause an integer overflow."
-end
-```
-
-### Assignment as a Min Cost Problem
+### Assignment as a Min Cost Flow Problem
 
 [Guide](https://developers.google.com/optimization/assignment/assignment_min_cost_flow)
 
@@ -1370,75 +1711,6 @@ else
 end
 ```
 
-### Assignment as a MIP Problem
-
-[Guide](https://developers.google.com/optimization/assignment/assignment_mip)
-
-```ruby
-# create the solver
-solver = ORTools::Solver.new("SolveAssignmentProblemMIP", :cbc)
-
-# create the data
-cost = [[90, 76, 75, 70],
-        [35, 85, 55, 65],
-        [125, 95, 90, 105],
-        [45, 110, 95, 115],
-        [60, 105, 80, 75],
-        [45, 65, 110, 95]]
-
-team1 = [0, 2, 4]
-team2 = [1, 3, 5]
-team_max = 2
-
-# create the variables
-num_workers = cost.length
-num_tasks = cost[1].length
-x = {}
-
-num_workers.times do |i|
-  num_tasks.times do |j|
-    x[[i, j]] = solver.bool_var("x[#{i},#{j}]")
-  end
-end
-
-# create the objective function
-solver.minimize(solver.sum(
-  num_workers.times.flat_map { |i| num_tasks.times.map { |j| x[[i, j]] * cost[i][j] } }
-))
-
-# create the constraints
-num_workers.times do |i|
-  solver.add(solver.sum(num_tasks.times.map { |j| x[[i, j]] }) <= 1)
-end
-
-num_tasks.times do |j|
-  solver.add(solver.sum(num_workers.times.map { |i| x[[i, j]] }) == 1)
-end
-
-solver.add(solver.sum(team1.flat_map { |i| num_tasks.times.map { |j| x[[i, j]] } }) <= team_max)
-solver.add(solver.sum(team2.flat_map { |i| num_tasks.times.map { |j| x[[i, j]] } }) <= team_max)
-
-# invoke the solver
-sol = solver.solve
-
-puts "Total cost = #{solver.objective.value}"
-puts
-num_workers.times do |i|
-  num_tasks.times do |j|
-    if x[[i, j]].solution_value > 0
-      puts "Worker %d assigned to task %d.  Cost = %d" % [
-        i,
-        j,
-        cost[i][j]
-      ]
-    end
-  end
-end
-
-puts
-puts "Time = #{solver.wall_time} milliseconds"
-```
-
 ### Employee Scheduling
 
 [Guide](https://developers.google.com/optimization/scheduling/employee_scheduling)
@@ -1710,7 +1982,7 @@ end
 # solve and print solution
 solver = ORTools::CpSolver.new
 status = solver.solve(model)
-if status == :feasible
+if status == :optimal
   line.each do |i|
     p line.map { |j| solver.value(grid[[i, j]]) }
   end
@@ -1725,8 +1997,8 @@ end
 # From
 # Meghan L. Bellows and J. D. Luc Peterson
 # "Finding an optimal seating chart for a wedding"
-# http://www.improbable.com/news/2012/Optimal-seating-chart.pdf
-# http://www.improbable.com/2012/02/12/finding-an-optimal-seating-chart-for-a-wedding
+# https://www.improbable.com/news/2012/Optimal-seating-chart.pdf
+# https://www.improbable.com/2012/02/12/finding-an-optimal-seating-chart-for-a-wedding
 #
 # Every year, millions of brides (not to mention their mothers, future
 # mothers-in-law, and occasionally grooms) struggle with one of the
@@ -1799,19 +2071,17 @@ all_tables.each do |t|
   end
 end
 
+pairs = all_guests.combination(2)
+
 colocated = {}
-(num_guests - 1).times do |g1|
-  (g1 + 1).upto(num_guests - 1) do |g2|
-    colocated[[g1, g2]] = model.new_bool_var("guest %i seats with guest %i" % [g1, g2])
-  end
+pairs.each do |g1, g2|
+  colocated[[g1, g2]] = model.new_bool_var("guest %i seats with guest %i" % [g1, g2])
 end
 
 same_table = {}
-(num_guests - 1).times do |g1|
-  (g1 + 1).upto(num_guests - 1) do |g2|
-    all_tables.each do |t|
-      same_table[[g1, g2, t]] = model.new_bool_var("guest %i seats with guest %i on table %i" % [g1, g2, t])
-    end
+pairs.each do |g1, g2|
+  all_tables.each do |t|
+    same_table[[g1, g2, t]] = model.new_bool_var("guest %i seats with guest %i on table %i" % [g1, g2, t])
   end
 end
 
@@ -1833,29 +2103,32 @@ all_tables.each do |t|
 end
 
 # Link colocated with seats
-(num_guests - 1).times do |g1|
-  (g1 + 1).upto(num_guests - 1) do |g2|
-    all_tables.each do |t|
-      # Link same_table and seats.
-      model.add_bool_or([seats[[t, g1]].not, seats[[t, g2]].not, same_table[[g1, g2, t]]])
-      model.add_implication(same_table[[g1, g2, t]], seats[[t, g1]])
-      model.add_implication(same_table[[g1, g2, t]], seats[[t, g2]])
-    end
-
-    # Link colocated and same_table.
-    model.add(model.sum(all_tables.map { |t| same_table[[g1, g2, t]] }) == colocated[[g1, g2]])
+pairs.each do |g1, g2|
+  all_tables.each do |t|
+    # Link same_table and seats.
+    model.add_bool_or([seats[[t, g1]].not, seats[[t, g2]].not, same_table[[g1, g2, t]]])
+    model.add_implication(same_table[[g1, g2, t]], seats[[t, g1]])
+    model.add_implication(same_table[[g1, g2, t]], seats[[t, g2]])
   end
+
+  # Link colocated and same_table.
+  model.add(model.sum(all_tables.map { |t| same_table[[g1, g2, t]] }) == colocated[[g1, g2]])
 end
 
 # Min known neighbors rule.
-all_tables.each do |t|
+all_guests.each do |g|
   model.add(
     model.sum(
-      (num_guests - 1).times.flat_map { |g1|
-        (g1 + 1).upto(num_guests - 1).select { |g2| c[g1][g2] > 0 }.flat_map { |g2|
-          all_tables.map { |t2| same_table[[g1, g2, t2]] }
-        }
-      }
+      (g + 1).upto(num_guests - 1).
+      select { |g2| c[g][g2] > 0 }.
+      product(all_tables).
+      map { |g2, t| same_table[[g, g2, t]] }
+    ) +
+    model.sum(
+      g.times.
+      select { |g1| c[g1][g] > 0 }.
+      product(all_tables).
+      map { |g1, t| same_table[[g1, g, t]] }
     ) >= min_known_neighbors
   )
 end