-
Notifications
You must be signed in to change notification settings - Fork 11
/
DESCRIPTION
36 lines (36 loc) · 1.56 KB
/
DESCRIPTION
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
Package: gbp
Type: Package
Title: A Bin Packing Problem Solver
Version: 0.1.0.4
Author: Guang Yang
Maintainer: Guang Yang <[email protected]>
Description: Basic infrastructure and several algorithms for 1d-4d bin packing
problem. This package provides a set of c-level classes and solvers for
1d-4d bin packing problem, and an r-level solver for 4d bin packing problem,
which is a wrapper over the c-level 4d bin packing problem solver.
The 4d bin packing problem solver aims to solve bin packing problem, a.k.a
container loading problem, with an additional constraint on weight.
Given a set of rectangular-shaped items, and a set of rectangular-shaped bins
with weight limit, the solver looks for an orthogonal packing solution
such that minimizes the number of bins and maximize volume utilization.
Each rectangular-shaped item i = 1, .. , n is characterized by length l_i,
depth d_i, height h_i, and weight w_i, and each rectangular-shaped bin
j = 1, .. , m is specified similarly by length l_j, depth d_j, height h_j,
and weight limit w_j.
The item can be rotated into any orthogonal direction, and no further
restrictions implied.
License: MIT + file LICENSE
Depends: R (>= 3.0.0),
magrittr, data.table
Imports: methods,
Rcpp (>= 0.12.7)
Suggests: testthat,
knitr, rmarkdown, rgl
LinkingTo: Rcpp, RcppArmadillo (>= 0.7.400.2.0)
SystemRequirements: C++11, GNU make
LazyData: TRUE
Encoding: UTF-8
RoxygenNote: 5.0.1
VignetteBuilder: knitr
URL: https://github.com/gyang274/gbp
BugReports: https://github.com/gyang274/gbp/issues