gbp4d_it_create_ktlist: gbp4d_it_create_ktlist

In gbp: A Bin Packing Problem Solver

Description

create ktlist from itlist

Usage

gbp4d_it_create_ktlist(bn, it, xp, ktinit, nlmt)

Arguments

bn	bn scale <vector> - l, d, h, w bn scale along x, y, z and w <numeric>
it	it position and scale <matrix> - x, y, z, w it position and w in the bin <numeric> - l, d, h, w it scale along x, y, z and w <numeric>
xp	xp extreme point position and residual space scale <matrix> - x, y, z, w xp position and w in the bin <numeric> - l, d, h, w xp residual space scale along x, y, z and w <numeric>
ktinit	kt candidate scale without position <matrix> - l, d, h, w kt scale along x, y, z, w which open to orientation <numeric>
nlmt	nlmt: limit on ktlist n max-value

Details

core function in gbp4d_solver_dpp select highest profitable it not yet fit into bn and return all possbile fit w.r.t xp and orientation

Value

Ktlist4d

Note

should make sure it kt can be fit in bin outside

internal function use in gbp4d_solver_dpp() for creating Ktlist4d object for fit.

See Also

Other gbp4d_it: Ktlist4d

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