Description
Generate integer item sizes for unlimited caller-defined capacity/cost bin types, with first-fit reuse and the cheapest fitting type for each new bin; no minimum-total-cost claim.
An optimization instance defines choices, constraints, and an objective. A feasible witness demonstrates that its stated constraints can be met; it establishes optimality only when the tool actually computes and verifies an optimum.
Generate integer item sizes for unlimited caller-defined capacity/cost bin types, with first-fit reuse and the cheapest fitting type for each new bin; no minimum-total-cost claim.
When to use this tool
Use this generator to create reproducible variable size bin packing instance cases from the supplied model or bank. Inspect the returned evidence before using cases in a test or exercise.
How to use the tool and how it works
- Supply itemCount, minimumSize, maximumSize, binTypes in the field shapes below. Set seed when you need an explicit replay.
- Run the tool and correct any input error. For generated controls, distinguish a successful fixture containing an invalid case from failure to generate the fixture.
- Read sizes, binTypes, bins, totalCost. Use the conventions below and keep answer-bearing fields separate when presenting an exercise.
Draw integer item sizes, reuse the first existing bin with sufficient remaining capacity and otherwise open the cheapest caller-defined type that fits. Return each bin’s type, item indexes and load, with exact total cost.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| itemCount | Item Count | Required. Safe integer; minimum 1; maximum 128. |
| minimumSize | Minimum Size | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| maximumSize | Maximum Size | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| binTypes | Bin Types | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| binTypes[].capacity | Capacity | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| binTypes[].cost | Cost | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| seed | Optional numeric seed; takes precedence over context randomness. Without either, use the fixed tool.io default seed. | Optional. Safe integer. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| sizes | Sizes | Required. Array of Safe integer; minimum 1; maximum 9007199254740991.; minimum items 1; maximum items 128. |
| binTypes | Bin Types | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 16. |
| binTypes[].capacity | Capacity | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| binTypes[].cost | Cost | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| bins | Bins | Required. Array of Object; no unknown keys.; minimum items 1; maximum items 128. |
| bins[].type | Type | Required. Safe integer; minimum 0; maximum 15. |
| bins[].items | Items | Required. Array of Safe integer; minimum 0; maximum 127.; minimum items 1; maximum items 128. |
| bins[].load | Load | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| totalCost | Total Cost | Required. Safe integer; minimum 1; maximum 9007199254740991. |
| randomness | Replay metadata: source is seed or context; seed is the normalized 32-bit seed or null for a context source. | Required. Object; no unknown keys. |
| randomness.seed | Optional numeric replay seed; normalization and precedence are explained below. | Required. Safe integer. or Null. |
| randomness.source | Source | Required. Text; one of "context", "seed". |
An explicit safe-integer seed takes precedence over injected context randomness and is normalized to an unsigned 32-bit integer. With no seed and no context source, replay uses the fixed tool.io default seed. A context source must return finite values from zero inclusive to one exclusive; its advancing state must be retained separately. randomness records the source and normalized seed, or null for context. These generators are not cryptographic random sources.
{
"input": {
"itemCount": 5,
"minimumSize": 1,
"maximumSize": 5,
"binTypes": [
{
"capacity": 4,
"cost": 3
},
{
"capacity": 8,
"cost": 5
}
],
"seed": 42
},
"output": {
"sizes": [
4,
3,
5,
4,
1
],
"binTypes": [
{
"capacity": 4,
"cost": 3
},
{
"capacity": 8,
"cost": 5
}
],
"bins": [
{
"type": 0,
"items": [
0
],
"load": 4
},
{
"type": 0,
"items": [
1,
4
],
"load": 4
},
{
"type": 1,
"items": [
2
],
"load": 5
},
{
"type": 0,
"items": [
3
],
"load": 4
}
],
"totalCost": 14,
"randomness": {
"seed": 42,
"source": "seed"
}
}
}Limitations and assumptions
- Every possible item size must fit some supplied type. Types are available without a stock limit, ties follow input order, and this first-fit/cheapest-new-bin witness is not a minimum-cost packing solution.
- A replay requires the same complete input and implementation. Randomized construction does not guarantee uniform coverage of every feasible output; finite samples can repeat unless a distinct-selection rule is explicitly stated.
- The field tables state structural bounds; cross-field constraints and bounded search or output budgets also apply. Unknown keys are rejected where the object contract disallows them. Input errors are distinct from null fields and deliberate invalid controls in a successful output.
Alternative or Complementary methods
For a supplied example, inspect the returned construction or delegated check directly. To evaluate a consumer, also test cases chosen for its own boundaries; a generated finite corpus does not establish exhaustive coverage.
References
Similar or alternative tools
- Random Two-Dimensional Strip Packing Instance Generator
Generate nonrotated integer rectangles for a fixed-width, unbounded-height strip with a feasible next-fit shelf placement; no minimum-height claim.
- Random Interval Scheduling Challenge Generator
Generate synthetic positive-duration half-open jobs and solve the declared count or weight objective exactly with finish-time dynamic programming, retaining one optimum with exclusion on objective ties.