binpack 0.1.0

solve binpacking problems using Linear Programming
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

# Many identical choices create a huge search space
bins:
  b1: 10
  b2: 10
  b3: 10
  b4: 10
  b5: 10
items:
  i1:
    quantity: 25
    groupSize: 5
    affinity:
      soft:
        - weight: 5
          bins: [b1]
        - weight: 4
          bins: [b2]
        - weight: 3
          bins: [b3]
        - weight: 2
          bins: [b4]
        - weight: 1
          bins: [b5]
  i2:
    quantity: 25
    groupSize: 5
    affinity:
      soft:
        - weight: 5
          bins: [b5]
        - weight: 4
          bins: [b4]
        - weight: 3
          bins: [b3]
        - weight: 2
          bins: [b2]
        - weight: 1
          bins: [b1]
solution:
  i1:
    b1: 10
    b2: 10
    b3: 5
  i2:
    b3: 5
    b4: 10
    b5: 10