Search Results for "packing"

CrystalCMP is a code for comparing crystal structures. It is using two basic approaches for this purpose - the fingerprint and the RMSD approach. Result of the comparison is a similarity matrix and dendrogram. Read more here: J. Appl. Cryst. (2016). 49, 2172-2183 (https://doi.org/10.1107/S1600576716016058) and also here: J. Appl. Cryst. (2020). 53, 841-847 https://doi.org/10.1107/S1600576720003787

Program was created for optimized packing of two dimensional rectangular elements at orthogonal table with main purpose of printing cutting sheets that can be used for cutting material at production in wood and panel furniture manufacturing. It is developed upon authors several years of experience at woodworking, and actual carpenters needs when such software is in question.

This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007.

...It provides optimized emulation for newer SSE instructions. It also provides a rich set of high performance routines for common operations such as arithmetic, bitwise logic, and data packing and unpacking.

This project is a highly flexible implementation of the well known bin packing algortihms: next fit, first fit, best fit, worst fit. The elements and bins may have any number of dimensions.

This project aims at providing a set of tools for solving the class of monodimensional packing problems (such as cutting stock, bin packing and knapsack problem) mainly using genetic algoritms.