Search Results for "open bin"

Java Concurrency Tools for the JVM. This project aims to offer some concurrent data structures currently missing from the JDK. There’s more to come and contributions/suggestions are most welcome. JCTools has enjoyed support from the community and contributions in the form of issues/tests/documentation/code have helped it grow. JCTools offers excellent performance at a reasonable price (FREE! under the Apache 2.0 License). It’s stable and in use by such distinguished frameworks as Netty,...

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.

This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.

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.