Shuttle car loading system

A system is described for loading newly mined material such as coal, into a shuttle car, at a location near the mine face where there is only a limited height available for a loading system. The system includes a storage bin having several telescoping bin sections and a shuttle car having a bottom wall that can move under the bin. With the bin in an extended position and filled with coal the bin sections can be telescoped to allow the coal to drop out of the bin sections and into the shuttle car, to quickly load the car. The bin sections can then be extended, so they can be slowly filled with more while waiting another shuttle car

Online Bin Stretching with Three Bins

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of $11/8 = 1.375$ for three bins. Additionally, we present a lower bound of $45/33 = 1.\overline{36}$ for Online Bin Stretching on three bins and a lower bound of $19/14$ for four and five bins that were discovered using a computer search.Comment: Preprint of a journal version. See version 2 for the conference paper. Conference paper split into two journal submissions; see arXiv:1601.0811

Vector Bin Packing with Multiple-Choice

We consider a variant of bin packing called multiple-choice vector bin packing. In this problem we are given a set of items, where each item can be selected in one of several $D$-dimensional incarnations. We are also given $T$ bin types, each with its own cost and $D$-dimensional size. Our goal is to pack the items in a set of bins of minimum overall cost. The problem is motivated by scheduling in networks with guaranteed quality of service (QoS), but due to its general formulation it has many other applications as well. We present an approximation algorithm that is guaranteed to produce a solution whose cost is about $\ln D$ times the optimum. For the running time to be polynomial we require $D=O(1)$ and $T=O(\log n)$. This extends previous results for vector bin packing, in which each item has a single incarnation and there is only one bin type. To obtain our result we also present a PTAS for the multiple-choice version of multidimensional knapsack, where we are given only one bin and the goal is to pack a maximum weight set of (incarnations of) items in that bin

MsatAllele_1.0: An R package to visualize the binning of microsatellite Alleles

MsatAllele is a computer package built on R to visualize and bin the raw microsatellite allele size distributions. The method is based on the creation of an R database with exported files from the open-source electropherogram peak-reading program STRAND. Contrary to other binning programs, in this program, the bin limits are not fixed and are automatically defined by the data stored in the database. Data manipulation and graphical functions allow to 1) visualize raw allele size variation, allowing the detection of potential scoring errors, strange bin distributions, and unexpected spacing between the bins; 2) bin raw fragment sizes and write bin summary statistics for each locus; and 3) export genotype files with the resulting binned data.Fundacao para a Ciencia e Tecnologia [SFRH/BPD/14945/2004]; MEGIKELP [PTDC/MAR/65461/2006]info:eu-repo/semantics/publishedVersio