gbp3d {gbp}

gbp3d

Description

generalized bin packing problem in 3 dimension, a.k.a bin packing problem.

Usage

gbp3d

Format

An object of class C++Class of length 1.

Details

gbp3d init a profit vector p, a length vector l, a depth vector d, a height vector h, and also a length constraint ml, a depth constraint md, and a height constraint mh on l x d x h cuboid with geometry intepretation.

gbp3d solver would solve

maximize sum_j=1^n p_j k_j

subject to fit (l_j, d_j, h_j) at coordinate (x_j, y_j, z_j) such that no overlap in ml x md x mh cuboid, j = 1, ......, n

and instantiate a gbp3d object with a x-axis coordinate vector x, a y-axis coordinate vector y, a z-axis coordinate vector z, a selection vector k, and an objective o.

a gbp3d class instance has 6 fields:

- p: profit of it fit into bn <vector>

created via cluster max(l, d, h) and area via gbp3d_solver_dpp_main_create_p()

- it: it position and scale <matrix>

- x, y, z it position in the bin <numeric>

- l, d, h it scale along x, y, z <numeric>

- bn: bn scale <vector>

- l, d, h bn scale along x, y, z <numeric>

- k: selection indicator 0, 1 <vector>

- o: objective achivement volumn fit in over volumn overall <numeric>

- ok: a quick indicator of all it fit into bn? <bool>

Note

p is a proxy of ranking on cuboid fit difficulty, often a func of max(l, d, h), surface, volume and solver would often maximize sum_j=1^n v_j k_j instead of sum_j=1^n p_j k_j

See Also

Other gbp3d: gbp3d_checkr, gbp3d_solver_dpp