go-pack-bins · Packing Demo

Mode

Dimensions

Algorithm

Advanced tuning

Trade time for quality. Blank uses the default; values are clamped to safe ranges.

Bin capacity

Bin cost (GBPP)

Items with a profit scalar are optional; rejected if profit can't cover a bin.

Strip packing: the width (and depth, in 3-D) is fixed; the height is minimised and shown in the results. The height input is ignored.

Knapsack: packs the most valuable subset into a single container; the rest are rejected. Give items a value scalar (e.g. value=100); defaults to maximising packed volume.

Container catalog Enable

Packs into each container type and keeps the best one. The bin capacity above is ignored.

Max

Cost

Nested containers Enable

Inner bin (carton)

Carton cost (GBPP)

Inner algorithm

Advanced tuning

Trade time for quality. Blank uses the default; values are clamped to safe ranges.

Carton catalog Enable

Max

Cost

Inner lexicographic objectives

Add objective

Add item

Scalars (name=value, comma-separated)

Rotate (default)

Items 0

Constraints

Scalar

Value

Cat B

Support / anti-slosh

Min face contact % — bottom is a hard support gate; sides drive contact placement + lateral compaction.

Bottom %

Side X %

Side Y %

No floating items (must rest on floor/box) Tighten voids (post-pass: pull items down into gaps)

Lexicographic objectives

Compared in priority order (first listed wins ties downward).

Add objective

Balance objectives

Layered on the chosen ⚖ algorithm. Constraints still apply.

Scalar

Mode

Weight

Inner balance objectives

Layered on the inner ⚖ algorithm. Constraints still apply.

Scalar

Mode

Weight

Bins: —

Placed: —

Unplaced: —

Best: —

Status: —

📦

Add items and click Pack to visualise

Distribution

Pack to see per-container metric stats.