gbp2d: gbp2d

In gbp: A Bin Packing Problem Solver

Description

generalized bin packing problem in 2 dimension, a.k.a rectangle fill.

Usage

gbp2d

Format

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

Details

gbp2d init a profit vector p, a length vector l, a depth vector d, a length constraint ml, and a depth constraint md on l x d rectangle with geometry intepretation.

gbp2d solver would solve

maximize sum_j=1^n p_j k_j

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

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

a gbp2d class instance has 6 fields:

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

created via cluster max(l, d) and min(l, d) via gbp2d_solver_dpp_prep_create_p()

- it: it position and scale <matrix>

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

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

- bn: bn scale <vector>

- l, d bn scale along x and y <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 rectangle fit difficulty, often a function w.r.t max(l, d) and l x d

See Also

Other gbp2d: gbp2d_checkr, gbp2d_solver_dpp

gbp documentation built on May 2, 2019, 6:04 a.m.