PackingSolver

https://fontanf.github.io/packingsolver/
Admin
PackingSolver is a software package dedicated to the practical resolution of cutting and packing...
Tokens:15,173
Snippets:177
Trust Score:9.7
Update:3 months ago
Show doc for...
Tokens:
Raw
### Box Solver Basic Example

Source: https://fontanf.github.io/packingsolver/box.html

This is a basic example demonstrating the usage of the box solver with items, bins, and parameters files. It shows how to specify the output certificate file.

```bash
packingsolver_box \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution.csv
```

--------------------------------

### Open-Dimension Example (Minimize Width)

Source: https://fontanf.github.io/packingsolver/objectives.html

This example shows how to set up PackingSolver for an open-dimension problem, specifically to minimize the width used. It configures the solver with item and bin data, setting the objective to 'open-dimension-x'.

```csv
WIDTH,HEIGHT,COPIES
250,150,10
200,100,12
175,75,12

```

```csv
WIDTH,HEIGHT,COPIES
2000,500,1

```

```csv
NAME,VALUE
objective,open-dimension-x

```

```bash
packingsolver_rectangle \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution_rectangle.csv

```

```bash
python3 scripts/visualize_rectangle.py solution_rectangle.csv

```

--------------------------------

### Variable-Sized Bin Packing Example

Source: https://fontanf.github.io/packingsolver/objectives.html

This example demonstrates how to configure PackingSolver for variable-sized bin packing. It uses CSV files for items, bins, and parameters, specifying the 'variable-sized-bin-packing' objective.

```csv
WIDTH,HEIGHT,COPIES
250,150,10
200,100,12
175,75,12

```

```csv
WIDTH,HEIGHT,COPIES
1000,500,10
700,400,10

```

```csv
NAME,VALUE
objective,variable-sized-bin-packing

```

```bash
packingsolver_rectangle \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution_rectangle.csv

```

```bash
python3 scripts/visualize_rectangle.py solution_rectangle.csv

```

--------------------------------

### Packing Solver Output Summary

Source: https://fontanf.github.io/packingsolver/rectangleguillotine.html

Example output from the PackingSolver, detailing problem instance characteristics, statistics, and solution summary.

```text
=================================
          PackingSolver          
=================================

Problem type
------------
RectangleGuillotine

Instance
--------
Objective:                             BinPackingWithLeftovers
Number of item types:                  3
Number of items:                       7
Number of bin types:                   1
Number of bins:                        5
Number of stacks:                      3
Number of defects:                     0
Number of stages:                      3
Cut type:                              NonExact
First stage orientation:               Vertical
Minimum distance between 1-cuts:       0
Maximum distance between 1-cuts:       -1
Minimum distance between 2-cuts:       0
Minimum waste length:                  0
Maximum number of consecutive 2-cuts:  -1
Cut through defects:                   0
Cut thickness:                         0
Total item area:                       280000
Total item profit:                     280000
Largest item profit:                   50000
Largest item copies:                   3
Total bin area:                        3500000
Largest bin cost:                      700000

        Time      # bins       Waste   Waste (%)
        ----      ------       -----   ---------
       0.000           1      385000       57.89
       0.001           1      280000       50.00
       0.001           1      210000       42.86
       0.001           1      175000       38.46
       0.001           1       70000       20.00
       0.002           1       35000       11.11
       0.012           1       35000       11.11

Final statistics
----------------
Time (s):  5.00012

Solution
--------
Number of items:           7 / 7 (100%)
Item area:                 280000 / 280000 (100%)
Item profit:               280000 / 280000 (100%)
Number of bins:            1 / 5 (20%)
Number of different bins:  1
Bin area:                  700000 / 3500000 (20%)
Bin cost:                  700000
Waste:                     35000 (11.1111%)
Full waste:                420000 (60%)
Width:                     450
Height:                    700
Second leftover value:     15000

```

--------------------------------

### Solver Output Summary

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Example output from the solver, showing problem details, performance statistics, and solution summary.

```text
=================================
          PackingSolver          
=================================

Problem type
------------
OneDimensional

Instance
--------
Objective:             BinPacking
Number of item types:  52
Number of items:       52
Number of bin types:   1
Number of bins:        100
Total item length:     17898
Total item profit:     17898
Largest item profit:   499
Largest bin cost:      1000

        Time    Bins  Full waste (%)                         Comment
        ----    ----  --------------                         -------
       0.001      20           10.51                      TS g 0 q 1
       0.001      19            5.80                        SVC it 0
       0.071      18            0.57                         CG n 18

Final statistics
----------------
Time (s):  0.0719357

Solution
--------
Number of items:  52 / 52 (100%)
Item length:      17898 / 17898 (100%)
Item profit:      17898 / 17898 (100%)
Number of bins:   18 / 100 (18%)
Bin length:       18000 / 100000 (18%)
Bin cost:         18000
Waste:            65
Waste (%):        0.361855
Full waste:       102
Full waste (%):   0.566667


```

--------------------------------

### Spacing Constraints Example

Source: https://fontanf.github.io/packingsolver/irregular.html

Illustrates setting both global item-item spacing and per-bin item-bin spacing.

```json
{
  "objective": "knapsack",
  "parameters": {
    "item_item_minimum_spacing": 2.0
  },
  "bin_types": [
    {
      "type": "rectangle",
      "width": 1000,
      "height": 700,
      "item_bin_minimum_spacing": 5.0
    }
  ],
  "item_types": [...] 
}


```

--------------------------------

### Parameters CSV for Box Solver

Source: https://fontanf.github.io/packingsolver/box.html

Specifies solver parameters. This example sets the objective to 'bin-packing'.

```csv
NAME,VALUE
objective,bin-packing
```

--------------------------------

### PackingSolver Output Statistics

Source: https://fontanf.github.io/packingsolver/optimization_modes.html

Example output from PackingSolver after running in anytime mode, showing problem details, time-based statistics, and final solution metrics.

```text
=================================
          PackingSolver
=================================

Problem type
------------
Rectangle

Instance
--------
Objective:             BinPackingWithLeftovers
Number of item types:  40
Number of items:       40
Number of bin types:   1
Number of bins:        20
Number of groups:      1
Number of defects:     0
Unloading constraint:  None
Total item area:       735860
Total item width:      6340
Total item height:     4340
Smallest item width:   50
Smallest item height:  50
Total item weight:     0
Maximum item copies:   1
Total bin area:        10000000
Total bin weight:      0
Maximum bin cost:      500000

        Time      # bins    Leftover                         Comment
        ----      ------    --------                         -------
       0.005           2      166300                  TS g 1 d X q 1
       0.005           2      189800                  TS g 1 d X q 1
       0.018           2      212864                         SSK q 1
       0.070           2      216608                  TS g 0 d X q 6
       0.229           2      218000                 TS g 0 d X q 19
       0.229           2      221384                 TS g 0 d X q 19
       0.232           2      223988                 TS g 0 d X q 19
       0.808           2      224000                 TS g 0 d X q 63
       0.808           2      225000                 TS g 0 d X q 63
       0.815           2      226500                 TS g 0 d X q 63
       1.666           2      230500                        SSK q 64
      12.251           2      241518                       SSK q 512
      14.221           2      243015               TS g 1 d X q 1066

Final statistics
----------------
Time (s):  15.0054

Solution
--------
Number of items:  40 / 40 (100%)
Item area:        735860 / 735860 (100%)
Item weight:      0 / 0 (-nan%)
Item profit:      735860 / 735860 (100%)
Number of bins:   2 / 20 (10%)
Bin area:         1000000 / 10000000 (10%)
Bin weight:       0 / 0 (-nan%)
Bin cost:         1e+06
Waste:            21125
Waste (%):        2.79068
Full waste:       264140
Full waste (%):   26.414
Area load:        0.073586
Weight load:      -nan
X max:            515
Y max:            499
Leftover value:   243015

```

--------------------------------

### Basic OneDimensional Packing Setup

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Sets up a basic one-dimensional bin packing problem using CSV files for items, bins, and parameters. This configuration does not include maximum weight constraints.

```bash
packingsolver_onedimensional \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution.csv
```

--------------------------------

### Item CSV for Maximum Weight Example

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Defines item types with their copies and weights for a one-dimensional packing problem. This example is used to demonstrate the effect of maximum weight constraints.

```csv
X,COPIES,WEIGHT
200,4,100
```

--------------------------------

### Set Optimization Parameters

Source: https://fontanf.github.io/packingsolver/index.html

Define optimization parameters using a CSV file. This example sets the objective to 'bin-packing', aiming to use the minimum number of bins.

```csv
NAME,VALUE
objective,bin-packing

```

--------------------------------

### Bins CSV for Box Solver (No Max Weight)

Source: https://fontanf.github.io/packingsolver/box.html

Defines bin properties including dimensions (X, Y, Z) and number of copies. This example specifies bins of size 20x20x10.

```csv
X,Y,Z,COPIES
20,20,10,10
```

--------------------------------

### Irregular Solver Input JSON Example

Source: https://fontanf.github.io/packingsolver/irregular.html

Defines the problem instance for the Irregular solver, including objective, bin types, and item types with their properties and constraints.

```json
{
  "objective": "bin-packing-with-leftovers",
  "bin_types": [
    {
      "type": "rectangle",
      "width": 500,
      "height": 250
    }
  ],
  "item_types": [
    {
      "copies": 2,
      "type": "polygon",
      "vertices": [
        {"x": 0,   "y": 0},
        {"x": 200, "y": 0},
        {"x": 200, "y": 100},
        {"x": 100, "y": 100},
        {"x": 100, "y": 200},
        {"x": 0,   "y": 200}
      ],
      "holes": [
        {
          "type": "polygon",
          "vertices": [
            {"x": 20, "y": 110},
            {"x": 80, "y": 110},
            {"x": 80, "y": 170},
            {"x": 20, "y": 170}
          ]
        }
      ],
      "allowed_rotations": [
        {"start": 0, "end": 0}
      ]
    },
    {
      "copies": 2,
      "type": "polygon",
      "vertices": [
        {"x": 0,  "y": 0},
        {"x": 60, "y": 0},
        {"x": 60, "y": 60},
        {"x": 0,  "y": 60}
      ]
    }
  ]
}
```

--------------------------------

### Define Bins for Packing

Source: https://fontanf.github.io/packingsolver/index.html

Specify the width, height, and number of copies of available bins using a CSV file. This example defines a single bin type.

```csv
WIDTH,HEIGHT,COPIES
1000,500,10

```

--------------------------------

### Bins CSV for Box Solver (With Max Weight)

Source: https://fontanf.github.io/packingsolver/box.html

Defines bin properties including dimensions (X, Y, Z), number of copies, and maximum weight. This example specifies bins of size 20x20x10 with a maximum weight of 200.

```csv
X,Y,Z,COPIES,MAXIMUM_WEIGHT
20,20,10,10,200
```

--------------------------------

### Bin CSV for Maximum Weight Example

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Specifies bin types with their copies and maximum weight capacity. This CSV is used in conjunction with item data to enforce bin weight limits.

```csv
X,COPIES,MAXIMUM_WEIGHT
800,10,200
```

--------------------------------

### Define Items for Packing

Source: https://fontanf.github.io/packingsolver/index.html

Specify the width, height, and number of copies for items to be packed using a CSV file. This example defines two types of items.

```csv
WIDTH,HEIGHT,COPIES
300,200,10
250,150,10

```

--------------------------------

### Item CSV for Maximum Weight After Example

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Defines item types with their weights and maximum weight allowed after them in a bin. This constraint affects the stacking order of items within a bin.

```csv
X,WEIGHT,MAXIMUM_WEIGHT_AFTER
200,400,10000
100,200,100
```

--------------------------------

### Polygon Item with Hole Example

Source: https://fontanf.github.io/packingsolver/irregular.html

Demonstrates defining a polygon item type that includes a polygonal hole within its shape.

```json
{
  "objective": "open-dimension-x",
  "bin_types": [
    {"type": "rectangle", "width": 500, "height": 300}
  ],
  "item_types": [
    {
      "type": "polygon",
      "vertices": [
        {"x": 0,   "y": 0},
        {"x": 400, "y": 0},
        {"x": 400, "y": 300},
        {"x": 0,   "y": 300}
      ],
      "holes": [
        {
          "type": "polygon",
          "vertices": [
            {"x": 100, "y": 100},
            {"x": 300, "y": 100},
            {"x": 300, "y": 200},
            {"x": 100, "y": 200}
          ]
        }
      ]
    }
  ]
}


```

--------------------------------

### Items CSV for Box Solver

Source: https://fontanf.github.io/packingsolver/box.html

Defines item properties including dimensions (X, Y, Z), number of copies, and weight. This example specifies 4 items of size 10x10x10, each weighing 100.

```csv
X,Y,Z,COPIES,WEIGHT
10,10,10,4,100
```

--------------------------------

### Running the Box Stacking Solver

Source: https://fontanf.github.io/packingsolver/boxstacks.html

Executes the packingsolver_boxstacks command with specified item, bin, and parameter files. The solution is saved to a certificate file.

```bash
packingsolver_boxstacks \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution.csv

```

--------------------------------

### Solver Output Summary

Source: https://fontanf.github.io/packingsolver/boxstacks.html

Provides a summary of the packing problem instance, including dimensions, volumes, and time taken. It also details the final packing statistics.

```text
=================================
          PackingSolver          
=================================

Problem type
------------
BoxStacks

Instance
--------
Objective:             BinPackingWithLeftovers
Number of item types:  1
Number of items:       8
Number of bin types:   1
Number of bins:        1
Number of groups:      1
Number of defects:     0
Unloading constraint:  None
Total item volume:     72000000
Total item profit:     7.2e+07
Total item weight:     0
Total bin volume:      144000000
Total bin weight:      inf

        Time       Waste   Waste (%)
        ----       -----   ---------
       0.001    72000000       50.00

Final statistics
----------------
Time (s):  0.000868594

Solution
--------
Number of items:   8 / 8 (100%)
Item volume:       7.2e+07 / 7.2e+07 (100%)
Item weight:       0 / 0 (-nan%)
Item profit:       7.2e+07 / 7.2e+07 (100%)
Number of stacks:  2
Stack area:        120000
Number of bins:    1 / 1 (100%)
Bin volume:        144000000 / 144000000 (100%)
Bin area:          240000 / 240000 (100%)
Bin weight:        inf / inf (-nan%)
Bin cost:          240000
Waste:             72000000
Waste (%):         50
Full waste:        72000000
Full waste (%):    50
Volume load:       0.5
Area load:         0.5
Weight load:       0
X max:             600
Y max:             200

```

--------------------------------

### Visualize Packing Solution

Source: https://fontanf.github.io/packingsolver/index.html

Use a Python script to visualize the packing solution generated by the PackingSolver. This script opens a browser page displaying the loading plans.

```bash
python3 scripts/visualize_rectangle.py solution_rectangle.csv

```

--------------------------------

### Run PackingSolver in Anytime Mode

Source: https://fontanf.github.io/packingsolver/optimization_modes.html

Command-line execution of PackingSolver using the anytime optimization mode with a specified time limit. Ensure all input CSV files are correctly referenced.

```bash
packingsolver_rectangle \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution_rectangle.csv \
        --optimization-mode anytime \
        --time-limit 15
```

--------------------------------

### Visualize One-Dimensional Solution

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Command to visualize the packing solution using a Python script. Requires the solution CSV file as input.

```bash
python3 scripts/visualize_onedimensional.py solution.csv

```

--------------------------------

### Launch Rectangle Packing Solver

Source: https://fontanf.github.io/packingsolver/index.html

Execute the PackingSolver for a rectangle packing problem using specified item, bin, and parameter CSV files. The output certificate is saved to a CSV file.

```bash
packingsolver_rectangle \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution_rectangle.csv

```

--------------------------------

### Packing Solver with Rotation

Source: https://fontanf.github.io/packingsolver/rectangle.html

Command to run the packing solver, demonstrating the effect of item rotation.

```bash
packingsolver_rectangle \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution.csv
```

--------------------------------

### Basic Item and Bin Configuration

Source: https://fontanf.github.io/packingsolver/rectangle.html

Defines items with group IDs and bin specifications for packing. Used to demonstrate the effect of unloading constraints.

```csv
WIDTH,HEIGHT,GROUP_ID
200,200,0
400,400,1
150,150,2
```

```csv
WIDTH,HEIGHT,COPIES
800,400,1
```

```csv
NAME,VALUE
objective,bin-packing-with-leftovers
```

--------------------------------

### Irregular Solver Solution Output Summary

Source: https://fontanf.github.io/packingsolver/irregular.html

Provides a summary of the packing problem solution, including statistics on item placement, bin usage, and overall efficiency.

```text
=================================
          PackingSolver          
=================================

Problem type
------------
Irregular

Instance
--------
Objective:                    BinPackingWithLeftovers
Number of item types:         2
Number of items:              4
Number of fixed items:        0
Number of bin types:          1
Number of bins:               1
Number of defects:            0
Number of rectangular items:  2
Number of circular items:     0
Item-item minimum spacing:    0
Leftover corner:              BottomLeft
Open dim. XY aspect ratio:    -1
Total item area:              60000
Smallest item area:           3600
Largest item area:            26400
Total item profit:            60000
Largest item profit:          26400
Largest item copies:          2
Total bin area:               125000
Largest bin cost:             125000

        Time      # bins    Leftover                         Comment
        ----      ------    --------                         -------
       0.001           1       25000                  TS g 0 d 1 q 1
       0.001           1       45000                  TS g 0 d 0 q 1

Final statistics
----------------
Time (s):  0.00538591

Solution
--------
Number of items:  4 / 4 (100%)
Item area:        60000 / 60000 (100%)
Item profit:      60000 / 60000 (100%)
Number of bins:   1 / 1 (100%)
Bin area:         125000 / 125000 (100%)
Bin cost:         125000
Full waste:       65000
Full waste (%):   52
X min:            0
Y min:            0
X max:            400
Y max:            200
Density X:        0.6
Density Y:        0.6
ODXY area:        80000
Leftover value:   45000


```

--------------------------------

### Packing Solver with Defects

Source: https://fontanf.github.io/packingsolver/rectangle.html

Command to run the packing solver, including a defects CSV file to account for unusable regions in bins.

```bash
packingsolver_rectangle \
        --items items.csv \
        --bins bins.csv \
        --defects defects.csv \
        --parameters parameters.csv \
        --certificate solution.csv
```

--------------------------------

### Item and Bin Configuration for 'only-x-movements' and 'increasing-x' Constraints

Source: https://fontanf.github.io/packingsolver/rectangle.html

Defines items with group IDs and bin specifications for packing, specifically for demonstrating 'only-x-movements' and 'increasing-x' unloading constraints.

```csv
WIDTH,HEIGHT,GROUP_ID
500,200,0
200,200,1
150,150,1
```

```csv
WIDTH,HEIGHT,COPIES
800,400,1
```

```csv
NAME,VALUE
objective,open-dimension-x
unloading_constraint,only-x-movements
```

--------------------------------

### Solve One-Dimensional Packing Problem

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Command to execute the one-dimensional packing solver with specified input files and output certificate.

```bash
packingsolver_onedimensional \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution.csv

```

--------------------------------

### Irregular Solver Command Line Execution

Source: https://fontanf.github.io/packingsolver/irregular.html

Executes the Irregular solver using a specified input JSON file and directs the output to a solution JSON file.

```bash
packingsolver_irregular \
        --input instance.json \
        --certificate solution.json
```

--------------------------------

### Solve Rectangle Packing Problem

Source: https://fontanf.github.io/packingsolver/rectangle.html

Command to execute the rectangle packing solver with specified item, bin, and parameter files. The solution is saved to 'solution.csv'.

```bash
packingsolver_rectangle \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution.csv

```

--------------------------------

### Solution CSV Format

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Details the packing solution, assigning items to bins and specifying their positions.

```csv
TYPE,ID,COPIES,BIN,X,LX
BIN,0,1,0,0,1000
ITEM,50,1,0,0,491
ITEM,51,1,0,491,499
BIN,0,1,1,0,1000
ITEM,48,1,1,0,479
ITEM,49,1,1,479,487
BIN,0,1,2,0,1000
ITEM,8,1,2,0,239
ITEM,28,1,2,239,359
ITEM,35,1,2,598,401
BIN,0,1,3,0,1000
ITEM,5,1,3,0,227
ITEM,20,1,3,227,311
ITEM,45,1,3,538,461
BIN,0,1,4,0,1000
ITEM,11,1,4,0,257
ITEM,27,1,4,257,353
ITEM,33,1,4,610,389
BIN,0,1,5,0,1000
ITEM,12,1,5,0,263
ITEM,18,1,5,263,293
ITEM,42,1,5,556,443
BIN,0,1,6,0,1000
ITEM,15,1,6,0,277
ITEM,17,1,6,277,283
ITEM,41,1,6,560,439
BIN,0,1,7,0,1000
ITEM,3,1,7,0,211
ITEM,23,1,7,211,331
ITEM,44,1,7,542,457
BIN,0,1,8,0,1000
ITEM,4,1,8,0,223
ITEM,21,1,8,223,313
ITEM,46,1,8,536,463
BIN,0,1,9,0,1000
ITEM,2,1,9,0,199
ITEM,29,1,9,199,367
ITEM,40,1,9,566,433
BIN,0,1,10,0,1000
ITEM,6,1,10,0,229
ITEM,30,1,10,229,373
ITEM,34,1,10,602,397
BIN,0,1,11,0,1000
ITEM,0,1,11,0,193
ITEM,24,1,11,193,337
ITEM,47,1,11,530,467
BIN,0,1,12,0,1000
ITEM,10,1,12,0,251
ITEM,22,1,12,251,317
ITEM,39,1,12,568,431
BIN,0,1,13,0,1000
ITEM,13,1,13,0,269
ITEM,16,1,13,269,281
ITEM,43,1,13,550,449
BIN,0,1,14,0,1000
ITEM,9,1,14,0,241
ITEM,26,1,14,241,349
ITEM,36,1,14,590,409
BIN,0,1,15,0,1000
ITEM,14,1,15,0,271
ITEM,19,1,15,271,307
ITEM,38,1,15,578,421
BIN,0,1,16,0,1000
ITEM,7,1,16,0,233
ITEM,31,1,16,233,379
ITEM,32,1,16,612,383
BIN,0,1,17,0,1000
ITEM,1,1,17,0,197
ITEM,25,1,17,197,347
ITEM,37,1,17,544,419

```

--------------------------------

### Solve Box Packing Problem

Source: https://fontanf.github.io/packingsolver/box.html

Command to execute the packingsolver for a box packing problem using specified input files and outputting a solution certificate.

```bash
packingsolver_box \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution.csv

```

--------------------------------

### Parameters Data File

Source: https://fontanf.github.io/packingsolver/optimization_modes.html

CSV file specifying optimization parameters, such as the objective function.

```csv
NAME,VALUE
objective,bin-packing-with-leftovers
```

--------------------------------

### Defect Configuration

Source: https://fontanf.github.io/packingsolver/rectangle.html

Specify defects in bins using a CSV file with BIN, X, Y, WIDTH, and HEIGHT columns.

```csv
BIN,X,Y,WIDTH,HEIGHT
0,450,150,50,200
```

--------------------------------

### Irregular Solver Solution Visualization Script

Source: https://fontanf.github.io/packingsolver/irregular.html

Invokes a Python script to visualize the packing solution generated by the Irregular solver.

```bash
python3 scripts/visualize_irregular.py solution.json
```

--------------------------------

### Run PackingSolver in not-anytime mode with full item set

Source: https://fontanf.github.io/packingsolver/optimization_modes.html

This command executes the PackingSolver in 'not-anytime' mode using a full set of items. The solver will terminate automatically after a certain time, providing a solution of a specific quality.

```bash
packingsolver_rectangle \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution_rectangle.csv \
        --optimization-mode not-anytime

```

--------------------------------

### Rotations with Mirroring

Source: https://fontanf.github.io/packingsolver/irregular.html

Enables both standard rotations and mirrored versions of items for greater packing flexibility.

```json
{
  "allowed_rotations": [
    {"start": 0,   "end": 0,   "mirror": false},
    {"start": 0,   "end": 0,   "mirror": true}
  ]

}
```

--------------------------------

### Solve Rectangle Guillotine Packing Problem

Source: https://fontanf.github.io/packingsolver/rectangleguillotine.html

Command-line invocation to solve a rectangle packing problem using the guillotine algorithm. Specify input CSV files and the output certificate file.

```bash
packingsolver_rectangleguillotine \
        --items items.csv \
        --bins bins.csv \
        --parameters parameters.csv \
        --certificate solution.csv

```

--------------------------------

### Maximum Weight Configuration

Source: https://fontanf.github.io/packingsolver/rectangle.html

Set maximum weight for bins using the 'MAXIMUM_WEIGHT' column in the bins CSV and 'WEIGHT' in the items CSV.

```csv
WIDTH,HEIGHT,COPIES,WEIGHT
300,200,4,100
```

```csv
WIDTH,HEIGHT,COPIES,MAXIMUM_WEIGHT
600,400,10,200
```

--------------------------------

### Parameters CSV Format

Source: https://fontanf.github.io/packingsolver/boxstacks.html

Specifies solver parameters. The 'objective' parameter is crucial for defining the packing goal.

```csv
NAME,VALUE
objective,bin-packing-with-leftovers

```

--------------------------------

### Items CSV Configuration

Source: https://fontanf.github.io/packingsolver/objectives.html

Defines the items to be packed, including their dimensions and quantities. Ensure the format matches WIDTH,HEIGHT,COPIES.

```csv
WIDTH,HEIGHT,COPIES
250,150,10
200,100,12
175,75,12

```

--------------------------------

### Items Data File

Source: https://fontanf.github.io/packingsolver/optimization_modes.html

CSV file defining the dimensions and quantities of items to be packed.

```csv
WIDTH,HEIGHT,COPIES
100,50,1
103,53,1
106,56,1
109,59,1
112,62,1
115,65,1
118,68,1
121,71,1
124,74,1
127,77,1
130,80,1
133,83,1
136,86,1
139,89,1
142,92,1
145,95,1
148,98,1
151,101,1
154,104,1
157,107,1
160,110,1
163,113,1
166,116,1
169,119,1
172,122,1
175,125,1
178,128,1
181,131,1
184,134,1
187,137,1
190,140,1
193,143,1
196,146,1
199,149,1
202,152,1
205,155,1
208,158,1
211,161,1
214,164,1
217,167,1
```

--------------------------------

### PackingSolver output for half the item set

Source: https://fontanf.github.io/packingsolver/optimization_modes.html

This is the output from PackingSolver when run with half the number of items in 'not-anytime' mode. It shows a reduced execution time and different solution statistics compared to the full item set.

```text
=================================
          PackingSolver
=================================

Problem type
------------
Rectangle

Instance
--------
Objective:             BinPackingWithLeftovers
Number of item types:  20
Number of items:       20
Number of bin types:   1
Number of bins:        20
Number of groups:      1
Number of defects:     0
Unloading constraint:  None
Total item area:       359920
Total item width:      3140
Total item height:     2140
Smallest item width:   50
Smallest item height:  50
Total item weight:     0
Maximum item copies:   1
Total bin area:        10000000
Total bin weight:      0
Maximum bin cost:      500000

        Time      # bins    Leftover                         Comment
        ----      ------    --------                         -------
       5.982           1      131000                      TS g 0 d X

Final statistics
----------------
Time (s):  22.0075

Solution
--------
Number of items:  20 / 20 (100%)
Item area:        359920 / 359920 (100%)
Item weight:      0 / 0 (-nan%)
Item profit:      359920 / 359920 (100%)
Number of bins:   1 / 20 (5%)
Bin area:         500000 / 10000000 (5%)
Bin weight:       0 / 0 (-nan%)
Bin cost:         500000
Waste:            9080
Waste (%):        2.4607
Full waste:       140080
Full waste (%):   28.016
Area load:        0.035992
Weight load:      -nan
X max:            738
Y max:            500
Leftover value:   131000


```

--------------------------------

### PackingSolver output for full item set

Source: https://fontanf.github.io/packingsolver/optimization_modes.html

This is the output from PackingSolver when run with a full set of items in 'not-anytime' mode. It includes instance details, time-based statistics, and final solution statistics.

```text
=================================
          PackingSolver
=================================

Problem type
------------
Rectangle

Instance
--------
Objective:             BinPackingWithLeftovers
Number of item types:  40
Number of items:       40
Number of bin types:   1
Number of bins:        20
Number of groups:      1
Number of defects:     0
Unloading constraint:  None
Total item area:       735860
Total item width:      6340
Total item height:     4340
Smallest item width:   50
Smallest item height:  50
Total item weight:     0
Maximum item copies:   1
Total bin area:        10000000
Total bin weight:      0
Maximum bin cost:      500000

        Time      # bins    Leftover                         Comment
        ----      ------    --------                         -------
      17.920           2      234000                      TS g 0 d X
      17.921           2      241518                      TS g 1 d X
      28.537           2      246020                      SSK q 2048

Final statistics
----------------
Time (s):  34.1616

Solution
--------
Number of items:  40 / 40 (100%)
Item area:        735860 / 735860 (100%)
Item weight:      0 / 0 (-nan%)
Item profit:      735860 / 735860 (100%)
Number of bins:   2 / 20 (10%)
Bin area:         1000000 / 10000000 (10%)
Bin weight:       0 / 0 (-nan%)
Bin cost:         1e+06
Waste:            18120
Waste (%):        2.40325
Full waste:       264140
Full waste (%):   26.414
Area load:        0.073586
Weight load:      -nan
X max:            510
Y max:            498
Leftover value:   246020


```

--------------------------------

### Bins CSV for Knapsack Problem

Source: https://fontanf.github.io/packingsolver/objectives.html

Defines the dimensions and available copies of bins. Each row represents a bin type.

```csv
WIDTH,HEIGHT,COPIES
700,400,2

```

--------------------------------

### Bins CSV Configuration

Source: https://fontanf.github.io/packingsolver/objectives.html

Specifies the available bin types, their dimensions, and available copies. Format: WIDTH,HEIGHT,COPIES.

```csv
WIDTH,HEIGHT,COPIES
1000,500,10
700,400,10

```

--------------------------------

### Bins Data File

Source: https://fontanf.github.io/packingsolver/optimization_modes.html

CSV file defining the dimensions and quantities of bins available for packing.

```csv
WIDTH,HEIGHT,COPIES
1000,500,20
```

--------------------------------

### Parameters CSV for Knapsack Objective

Source: https://fontanf.github.io/packingsolver/objectives.html

Sets the optimization objective to 'knapsack'. This file is used to configure the solver's goal.

```csv
NAME,VALUE
objective,knapsack

```

--------------------------------

### Item Rotation Configuration

Source: https://fontanf.github.io/packingsolver/rectangle.html

Configure item rotation by setting the 'ORIENTED' column in the items CSV. Value '1' allows rotation, '0' fixes orientation.

```csv
WIDTH,HEIGHT,COPIES,ORIENTED
400,200,3,1
```

```csv
WIDTH,HEIGHT,COPIES,ORIENTED
400,200,3,0
```

--------------------------------

### Items CSV Format

Source: https://fontanf.github.io/packingsolver/rectangleguillotine.html

Defines the properties of items to be packed. Includes width, height, orientation flag, and number of copies.

```csv
WIDTH,HEIGHT,ORIENTED,COPIES
250,200,0,2
150,300,0,2
200,150,0,3

```

--------------------------------

### Items CSV file definition

Source: https://fontanf.github.io/packingsolver/optimization_modes.html

Defines the items to be packed, including their width, height, and the number of copies available. This file is used as input for the PackingSolver.

```csv
WIDTH,HEIGHT,COPIES
100,50,1
106,56,1
112,62,1
118,68,1
124,74,1
130,80,1
136,86,1
142,92,1
148,98,1
154,104,1
160,110,1
166,116,1
172,122,1
178,128,1
184,134,1
190,140,1
196,146,1
202,152,1
208,158,1
214,164,1

```

--------------------------------

### Bins CSV file definition

Source: https://fontanf.github.io/packingsolver/optimization_modes.html

Defines the available bins for packing, specifying their width, height, and the number of copies. This file is used as input for the PackingSolver.

```csv
WIDTH,HEIGHT,COPIES
1000,500,20

```

--------------------------------

### Items CSV Format

Source: https://fontanf.github.io/packingsolver/box.html

Defines the properties of items to be packed, including dimensions, allowed rotations, and quantity.

```csv
X,Y,Z,ROTATIONS,COPIES
20,15,10,1,15

```

--------------------------------

### Define Item Dimensions and Nesting Length

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Specifies the 'X' dimension and 'NESTING_LENGTH' for items. This allows the solver to account for reduced space when items are placed consecutively.

```csv
X,COPIES,NESTING_LENGTH
70,8,10
```

--------------------------------

### Bins CSV Format

Source: https://fontanf.github.io/packingsolver/box.html

Defines the dimensions of available bins for packing.

```csv
X,Y,Z
100,30,20

```

--------------------------------

### Items CSV Format

Source: https://fontanf.github.io/packingsolver/boxstacks.html

Defines the dimensions, quantity, and stackability of items to be packed. Each row represents an item type.

```csv
X,Y,Z,COPIES,STACKABILITY_ID
300,200,150,8,0

```

--------------------------------

### Items CSV Format

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Defines the items to be packed. Each row represents an item type with its length.

```csv
X
193
197
199
211
223
227
229
233
239
241
251
257
263
269
271
277
281
283
293
307
311
313
317
331
337
347
349
353
359
367
373
379
383
389
397
401
409
419
421
431
433
439
443
449
457
461
463
467
479
487
491
499

```

--------------------------------

### Bins CSV Format

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Defines the available bin types and their capacities. 'X' is the length and 'COPIES' is the number of bins of that type.

```csv
X,COPIES
1000,100

```

--------------------------------

### Bins CSV Format

Source: https://fontanf.github.io/packingsolver/rectangleguillotine.html

Specifies the dimensions and available copies of bins that items can be packed into.

```csv
WIDTH,HEIGHT,COPIES
1000,700,5

```

--------------------------------

### Bins CSV Format

Source: https://fontanf.github.io/packingsolver/boxstacks.html

Defines the dimensions of the bins available for packing. Each row represents a bin type.

```csv
X,Y,Z
600,400,600

```

--------------------------------

### Define Item Dimensions with Maximum Stackability

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Specifies the 'X' dimension, 'COPIES', and 'MAXIMUM_STACKABILITY' for items. This limits the number of items of a specific type that can be placed in a single bin.

```csv
X,COPIES,MAXIMUM_STACKABILITY
100,4,100
200,3,3
```

--------------------------------

### Define Bin Capacity

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Specifies the 'X' dimension for bins. This defines the maximum capacity of each bin.

```csv
X,COPIES
500,10
```

--------------------------------

### Fixed Orientation (No Rotation)

Source: https://fontanf.github.io/packingsolver/irregular.html

Restricts items to a single, fixed orientation, disallowing any rotation.

```json
{
  "allowed_rotations": [
    {"start": 0, "end": 0}
  ]

}
```

--------------------------------

### Full 360° Continuous Rotation

Source: https://fontanf.github.io/packingsolver/irregular.html

Allows items to be rotated freely at any angle within a full 360-degree range.

```json
{
  "allowed_rotations": [
    {"start": 0, "end": 360}
  ]

}
```

--------------------------------

### Define Item Dimensions Without Stackability Constraint

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Specifies the 'X' dimension and 'COPIES' for items. Used when there is no limit on how many of a specific item type can be in a bin.

```csv
X,COPIES
100,4
200,3
```

--------------------------------

### Discrete 90° Rotations

Source: https://fontanf.github.io/packingsolver/irregular.html

Specifies that items can only be rotated in discrete 90-degree increments.

```json
{
  "allowed_rotations": [
    {"start": 0,   "end": 0},
    {"start": 90,  "end": 90},
    {"start": 180, "end": 180},
    {"start": 270, "end": 270}
  ]

}
```

--------------------------------

### Define Item Dimensions for Nesting

Source: https://fontanf.github.io/packingsolver/onedimensional.html

Specifies the 'X' dimension for items. Used when nesting is not considered.

```csv
X,COPIES
70,8
```
Tokens:
Raw