说明：  最简单的一维装箱问题又称为装箱问题（1- BP），其主要 思想是用给定的集装箱装载货物，使集装箱的使用量最小。假 设m 是装运货物的数量；n 是可用箱子数量（或最优解数量的 最大值）；pi(i=1,…,m)是货物i 的重量；qj(j=1,…,n)是集装箱j 的 容量；Q 为集装箱平均容量。二元变量xij(i=1,…,m,j=1,…,n)，当 货物i 装于集装箱j 时，xij=1；反之xij=0。二元变量yj(j=1,…,n)，
(The most simple one-dimensional packing problem, also known as the packing problem (1- BP), the main idea is to use the given container load cargo container to use the least amount of. Assuming that m is the quantity of shipment n is available box number (or the maximum number of the optimal solution) pi (i = 1, ..., m) is the weight of the goods i QJ (j = 1, ..., n) j the capacity of the container Q is the average capacity of the container. Binary variable xij of (i = 1, ..., m, j = 1, ..., n), when the cargo shipped in a container j i when xij of = 1 Conversely xij of = 0. Binary variable YJ (j = 1, ..., n),)