gbp (version 0.1.0.4)

bpp_solver: bpp_solver

Description

bpp single or multiple order packing solver

Usage

bpp_solver(it, bn)

Arguments

it

it item

- oid: order id

- sku: stock keeping unit as it id

- l: it length which scale will be placed along x-coordinate

- d: it depth which scale will be placed along y-coordinate

- h: it height which scale will be placed along z-coordinate

- w: it weight optional which scale will be used restriction

bn

bn bins

- id: bn id

- l: bn length limit along x-coordinate

- d: bn depth limit along y-coordinate

- h: bn height limit along z-coordinate

- w: bn weight limit along w - a separate single dimension

- l, d, h will be sorted to have l >= d >= h within solver

Value

snsn bpp_solution - it item - oid: order id - sku: stock keeping unit as it id - tid: ticket id - an unique id within oid - otid: order id x ticket id - an unique indentifier indicate it with same tid can be packed into one bin - bid: bn id - x, y, z it position in bid bin - l, d, h it scale along x, y, z - w it weight - bn bins - id bn id - l bn length limit along x-coordinate - d bn depth limit along y-coordinate - h bn height limit along z-coordinate - w bn weight limit along w - a separate single dimension

Details

bpp solver is designed to solve packing in warehouse

bpp solver digest input it as a list of order (oid) and each row contain one sku (sku) in an order with length (l), depth (d), height (h) and weight (w) and aims to pack it list into one or more bin from a given list of bin that bin length (l), depth (d), height (h), and a single weight limit (wlmt).

bn list must be sorted by volume so that the smaller the eariler and preferred, and each bn must be sorted so that l >= d >= h

bpp solver would call bpp_solver_dpp_wrapper and aims to find a packing schema such that: use as small number of bin as possible, and use small bin whenever possible, w.r.t the 3d none overlap constraint and weight limit constraint.