or-tools 0.17.1 → 0.18.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 7d08782975a4c387d502318dbd8c9335166a42ab76807b13ba78c7b249d6c879
-  data.tar.gz: 1653c6a0bfac136e9bdbe22d6bc10bc24d699926d79963cb41777f9e90eb880f
+  metadata.gz: b4b9e112aef49d6377cfb072df599cc64adb317169212e9811ba601946cda981
+  data.tar.gz: 437a96678ed5b1d0b83ae2a8535a9d7b2165ebb28f1b8bf3bac62e3495e65ec4
 SHA512:
-  metadata.gz: 582adf83f9dfcdfe426364a22efc2bdd8733b5582a4aa3bb0b720910bd4a5d75a8466937b6b8bfed892c655017d246da3953081d56533a15aac8ae10b1ec96c5
-  data.tar.gz: e97b40eefc43fd253d2da0ad17f02a923649502d294904d49d4a431d1adc44c23222c8a59d61e36142400478bb6e128c90d00bee8419f0294c47f29aba4c4a93
+  metadata.gz: 6cd5ae717f0d0a9f01b3d44e52d311b0b93c82369c48a9dee7b71ca83dbbd094f48b29033d02ec319f4e69233a4366b9b6bd1025670a08b58514d1d068a0b261
+  data.tar.gz: 4806b7bff7d478eda84bb8b5169f683e7df7c08dc0d146d5b0a7bddf52a1c8dd164f4ee0338a5e01841b7057303c20ecb82cb8d4c01e309ea7ebc3478ef305c5

data/CHANGELOG.md

@@ -1,3 +1,20 @@
+## 0.18.1 (2026-10-02)
+
+- Added support for breaks for routing
+- Added support for more constraints for routing
+- Added more methods to `ConstraintSolverParameters`
+- Added more methods to `RoutingModelParameters`
+- Added more methods to `RoutingSearchParameters`
+- Added more methods to `SatParameters`
+
+## 0.18.0 (2026-07-06)
+
+- Added support for releasing GVL
+- Added `stop_search` method to `CpSolverSolutionCallback`
+- Fixed error with `apply_locks` and `set_allowed_vehicles_for_index` methods
+- Removed `solve_with_solution_callback` and `search_for_all_solutions` methods
+- Dropped support for Ruby < 3.3
+
 ## 0.17.1 (2026-02-19)
 
 - Fixed error with Rice 4.11

data/README.md

@@ -93,15 +93,15 @@ Specify people and their availabililty
 people = [
   {
     availability: [
-      {starts_at: Time.parse("2025-01-01 08:00:00"), ends_at: Time.parse("2025-01-01 16:00:00")},
-      {starts_at: Time.parse("2025-01-02 08:00:00"), ends_at: Time.parse("2025-01-02 16:00:00")}
+      {starts_at: Time.parse("2026-01-01 08:00:00"), ends_at: Time.parse("2026-01-01 16:00:00")},
+      {starts_at: Time.parse("2026-01-02 08:00:00"), ends_at: Time.parse("2026-01-02 16:00:00")}
     ],
     max_hours: 40 # optional, applies to entire scheduling period
   },
   {
     availability: [
-      {starts_at: Time.parse("2025-01-01 08:00:00"), ends_at: Time.parse("2025-01-01 16:00:00")},
-      {starts_at: Time.parse("2025-01-03 08:00:00"), ends_at: Time.parse("2025-01-03 16:00:00")}
+      {starts_at: Time.parse("2026-01-01 08:00:00"), ends_at: Time.parse("2026-01-01 16:00:00")},
+      {starts_at: Time.parse("2026-01-03 08:00:00"), ends_at: Time.parse("2026-01-03 16:00:00")}
     ],
     max_hours: 20
   }
@@ -112,9 +112,9 @@ Specify shifts
 
 ```ruby
 shifts = [
-  {starts_at: Time.parse("2025-01-01 08:00:00"), ends_at: Time.parse("2025-01-01 16:00:00")},
-  {starts_at: Time.parse("2025-01-02 08:00:00"), ends_at: Time.parse("2025-01-02 16:00:00")},
-  {starts_at: Time.parse("2025-01-03 08:00:00"), ends_at: Time.parse("2025-01-03 16:00:00")}
+  {starts_at: Time.parse("2026-01-01 08:00:00"), ends_at: Time.parse("2026-01-01 16:00:00")},
+  {starts_at: Time.parse("2026-01-02 08:00:00"), ends_at: Time.parse("2026-01-02 16:00:00")},
+  {starts_at: Time.parse("2026-01-03 08:00:00"), ends_at: Time.parse("2026-01-03 16:00:00")}
 ]
 ```
 
@@ -537,7 +537,8 @@ end
 # invoke the solver
 solver = ORTools::CpSolver.new
 solution_printer = VarArraySolutionPrinter.new(letters)
-status = solver.search_for_all_solutions(model, solution_printer)
+solver.parameters.enumerate_all_solutions = true
+status = solver.solve(model, solution_printer)
 
 puts
 puts "Statistics"
@@ -598,7 +599,8 @@ end
 # call the solver and display the results
 solver = ORTools::CpSolver.new
 solution_printer = SolutionPrinter.new(queens)
-status = solver.search_for_all_solutions(model, solution_printer)
+solver.parameters.enumerate_all_solutions = true
+status = solver.solve(model, solution_printer)
 puts
 puts "Solutions found : %i" % solution_printer.solution_count
 ```
@@ -1887,11 +1889,13 @@ end
 
 # call the solver and display the results
 solver = ORTools::CpSolver.new
+solver.parameters.linearization_level = 0
+solver.parameters.enumerate_all_solutions = true
 a_few_solutions = 5.times.to_a
 solution_printer = NursesPartialSolutionPrinter.new(
   shifts, num_nurses, num_days, num_shifts, a_few_solutions
 )
-solver.search_for_all_solutions(model, solution_printer)
+solver.solve(model, solution_printer)
 
 puts
 puts "Statistics"

data/ext/or-tools/assignment.cpp

@@ -30,7 +30,7 @@ void init_assignment(Rice::Module& m) {
         } else if (status == SimpleLinearSumAssignment::Status::POSSIBLE_OVERFLOW) {
           return Symbol("possible_overflow");
         } else {
-          throw std::runtime_error("Unknown status");
+          throw std::runtime_error{"Unknown status"};
         }
       });
 }

data/ext/or-tools/bin_packing.cpp

@@ -27,11 +27,11 @@ namespace Rice::detail {
     double is_convertible(VALUE value) { return Convertible::Exact; }
 
     KnapsackSolver::SolverType convert(VALUE x) {
-      auto s = Symbol(x).str();
+      std::string s = Symbol(x).str();
       if (s == "branch_and_bound") {
         return KnapsackSolver::KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER;
       } else {
-        throw std::runtime_error("Unknown solver type: " + s);
+        throw std::runtime_error{"Unknown solver type: " + s};
       }
     }
 
@@ -47,7 +47,7 @@ void init_bin_packing(Rice::Module& m) {
     .define_method("best_solution_contains?", &KnapsackSolver::BestSolutionContains)
     .define_method(
       "init",
-       [](KnapsackSolver& self, std::vector<int64_t> values, std::vector<std::vector<int64_t>> weights, std::vector<int64_t> capacities) {
+       [](KnapsackSolver& self, const std::vector<int64_t>& values, const std::vector<std::vector<int64_t>>& weights, const std::vector<int64_t>& capacities) {
         self.Init(values, weights, capacities);
       });
 }

data/ext/or-tools/channel.hpp

@@ -0,0 +1,37 @@
+#pragma once
+
+#include <chrono>
+#include <condition_variable>
+#include <mutex>
+#include <optional>
+#include <queue>
+
+template<typename T>
+class Channel {
+  std::queue<T> queue;
+  std::mutex mutex;
+  std::condition_variable cv;
+
+public:
+  void send(T message) {
+    std::lock_guard<std::mutex> guard(mutex);
+    queue.push(std::move(message));
+    cv.notify_one();
+  }
+
+  template<typename U, typename V>
+  std::optional<T> recv_timeout(const std::chrono::duration<U, V>& duration) {
+    std::unique_lock<std::mutex> lock(mutex);
+    if (!cv.wait_for(lock, duration, [&] { return !queue.empty(); })) {
+      return std::nullopt;
+    }
+    T message = std::move(queue.front());
+    queue.pop();
+    return message;
+  }
+
+  bool empty() {
+    std::lock_guard<std::mutex> guard(mutex);
+    return queue.empty();
+  }
+};