always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

format all C# files

Browse Source
This commit is contained in:
Mizux Seiha
2020-10-26 18:36:17 +01:00
parent 976ab9d82b
commit 335cf3df3d
197 changed files with 10040 additions and 12226 deletions
Download Patch File Download Diff File Expand all files Collapse all files

56
ortools/linear_solver/samples/BinPackingMip.cs
View File

@@ -18,19 +18,17 @@ using Google.OrTools.LinearSolver;
// [END import]
// [START program_part1]
public class BinPackingMip
{
public class BinPackingMip {
// [START data_model]
class DataModel
{
public static double[] Weights = {48, 30, 19, 36, 36, 27, 42, 42, 36, 24, 30};
class DataModel {
public static double[] Weights = {48, 30, 19, 36, 36, 27,
42, 42, 36, 24, 30};
public int NumItems = Weights.Length;
public int NumBins = Weights.Length;
public double BinCapacity = 100.0;
}
// [END data_model]
public static void Main()
{
public static void Main() {
// [START data]
DataModel data = new DataModel();
// [END data]
@@ -43,19 +41,16 @@ public class BinPackingMip
// [START program_part2]
// [START variables]
Variable[,] x = new Variable[data.NumItems, data.NumBins];
for (int i = 0; i < data.NumItems; i++)
{
for (int j = 0; j < data.NumBins; j++)
{
Variable[, ] x = new Variable[data.NumItems, data.NumBins];
for (int i = 0; i < data.NumItems; i++) {
for (int j = 0; j < data.NumBins; j++) {
x[i, j] = solver.MakeIntVar(0, 1, $"x_{i}_{j}");
}
}
Variable[] y = new Variable[data.NumBins];
for (int j = 0; j < data.NumBins; j++)
{
y[j] = solver.MakeIntVar(0, 1, $"y_{j}");
}
for (int j = 0; j < data.NumBins; j++) {
y[j] = solver.MakeIntVar(0, 1, $"y_{j}");
}
// [END variables]
// [START constraints]
@@ -66,12 +61,11 @@ public class BinPackingMip
}
}
for (int j = 0; j < data.NumBins; ++j)
{
Constraint constraint = solver.MakeConstraint(0, Double.PositiveInfinity, "");
for (int j = 0; j < data.NumBins; ++j) {
Constraint constraint =
solver.MakeConstraint(0, Double.PositiveInfinity, "");
constraint.SetCoefficient(y[j], data.BinCapacity);
for (int i = 0; i < data.NumItems; ++i)
{
for (int i = 0; i < data.NumItems; ++i) {
constraint.SetCoefficient(x[i, j], -DataModel.Weights[i]);
}
}
@@ -79,8 +73,7 @@ public class BinPackingMip
// [START objective]
Objective objective = solver.Objective();
for (int j = 0; j < data.NumBins; ++j)
{
for (int j = 0; j < data.NumBins; ++j) {
objective.SetCoefficient(y[j], 1);
}
objective.SetMinimization();
@@ -92,23 +85,20 @@ public class BinPackingMip
// [START print_solution]
// Check that the problem has an optimal solution.
if (resultStatus != Solver.ResultStatus.OPTIMAL)
{
if (resultStatus != Solver.ResultStatus.OPTIMAL) {
Console.WriteLine("The problem does not have an optimal solution!");
return;
}
Console.WriteLine($"Number of bins used: {solver.Objective().Value()}");
double TotalWeight = 0.0;
for (int j = 0; j < data.NumBins; ++j)
{
for (int j = 0; j < data.NumBins; ++j) {
double BinWeight = 0.0;
if (y[j].SolutionValue() == 1)
{
if (y [j]
.SolutionValue() == 1) {
Console.WriteLine($"Bin {j}");
for (int i = 0; i < data.NumItems; ++i)
{
if (x[i, j].SolutionValue() == 1)
{
for (int i = 0; i < data.NumItems; ++i) {
if (x [i, j]
.SolutionValue() == 1) {
Console.WriteLine($"Item {i} weight: {DataModel.Weights[i]}");
BinWeight += DataModel.Weights[i];
}