b027e57e95
- Currently not implemented... Add abseil patch - Add patches/absl-config.cmake Makefile: Add abseil-cpp on unix - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake Makefile: Add abseil-cpp on windows - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake CMake: Add abseil-cpp - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake port to absl: C++ Part - Fix warning with the use of ABSL_MUST_USE_RESULT > The macro must appear as the very first part of a function declaration or definition: ... Note: past advice was to place the macro after the argument list. src: dependencies/sources/abseil-cpp-master/absl/base/attributes.h:418 - Rename enum after windows clash - Remove non compact table constraints - Change index type from int64 to int in routing library - Fix file_nonport compilation on windows - Fix another naming conflict with windows (NO_ERROR is a macro) - Cleanup hash containers; work on sat internals - Add optional_boolean sub-proto Sync cpp examples with internal code - reenable issue173 after reducing number of loops port to absl: Python Part - Add back cp_model.INT32_MIN|MAX for examples Update Python examples - Add random_tsp.py - Run words_square example - Run magic_square in python tests port to absl: Java Part - Fix compilation of the new routing parameters in java - Protect some code from SWIG parsing Update Java Examples port to absl: .Net Part Update .Net examples work on sat internals; Add C++ CP-SAT CpModelBuilder API; update sample code and recipes to use the new API; sync with internal code Remove VS 2015 in Appveyor-CI - abseil-cpp does not support VS 2015... improve tables upgrade C++ sat examples to use the new API; work on sat internals update license dates rewrite jobshop_ft06_distance.py to use the CP-SAT solver rename last example revert last commit more work on SAT internals fix
73 lines
2.5 KiB
C++
73 lines
2.5 KiB
C++
#include "ortools/sat/cp_model.h"
|
|
#include "ortools/sat/sat_parameters.pb.h"
|
|
#include "ortools/util/time_limit.h"
|
|
|
|
namespace operations_research {
|
|
namespace sat {
|
|
|
|
void Solve() {
|
|
CpModelBuilder cp_model;
|
|
|
|
const IntVar start_ins = cp_model.NewIntVar(Domain(660, 755));
|
|
const IntVar duration_ins = cp_model.NewConstant(25);
|
|
const IntVar end_ins = cp_model.NewIntVar(Domain(685, 780));
|
|
const IntervalVar ins =
|
|
cp_model.NewIntervalVar(start_ins, duration_ins, end_ins);
|
|
|
|
const IntVar start_p1 = cp_model.NewIntVar(Domain(500, 800));
|
|
const IntVar duration_p1 = cp_model.NewIntVar(Domain(1, 360));
|
|
const IntVar end_p1 = cp_model.NewIntVar(Domain(500, 1000));
|
|
const IntervalVar p1 =
|
|
cp_model.NewIntervalVar(start_p1, duration_p1, end_p1);
|
|
|
|
const IntVar start_p2 = cp_model.NewIntVar(Domain(500, 800));
|
|
const IntVar duration_p2 = cp_model.NewIntVar(Domain(1, 360));
|
|
const IntVar end_p2 = cp_model.NewIntVar(Domain(500, 1000));
|
|
const IntervalVar p2 =
|
|
cp_model.NewIntervalVar(start_p2, duration_p2, end_p2);
|
|
|
|
cp_model.AddEquality(LinearExpr::Sum({duration_p1, duration_p2}), 360);
|
|
cp_model.AddLessOrEqual(end_p1, start_p2);
|
|
|
|
cp_model.AddNoOverlap({ins, p1, p2});
|
|
|
|
Model model;
|
|
|
|
// Tell the solver to enumerate all solutions.
|
|
SatParameters parameters;
|
|
parameters.set_enumerate_all_solutions(true);
|
|
model.Add(NewSatParameters(parameters));
|
|
|
|
// Create an atomic Boolean that will be periodically checked by the limit.
|
|
std::atomic<bool> stopped(false);
|
|
model.GetOrCreate<TimeLimit>()->RegisterExternalBooleanAsLimit(&stopped);
|
|
|
|
const int kSolutionLimit = 100;
|
|
int num_solutions = 0;
|
|
model.Add(NewFeasibleSolutionObserver([&](const CpSolverResponse& r) {
|
|
LOG(INFO) << "Solution " << num_solutions;
|
|
LOG(INFO) << " start_p1 = " << SolutionIntegerValue(r, start_p1);
|
|
LOG(INFO) << " duration_p1 = " << SolutionIntegerValue(r, duration_p1);
|
|
LOG(INFO) << " start_p2 = " << SolutionIntegerValue(r, start_p2);
|
|
LOG(INFO) << " duration_p2 = " << SolutionIntegerValue(r, duration_p2);
|
|
LOG(INFO) << " start_ins = " << SolutionIntegerValue(r, start_ins);
|
|
num_solutions++;
|
|
if (num_solutions >= kSolutionLimit) {
|
|
stopped = true;
|
|
LOG(INFO) << "Stop search after " << kSolutionLimit << " solutions.";
|
|
}
|
|
}));
|
|
|
|
SolveWithModel(cp_model, &model);
|
|
LOG(INFO) << "Number of solutions found: " << num_solutions;
|
|
}
|
|
|
|
} // namespace sat
|
|
} // namespace operations_research
|
|
|
|
int main() {
|
|
operations_research::sat::Solve();
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|