Search Results for "bin packing problem java"

Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others....

Graphical representation for the 3D BIN PACKING problem using the algorithm (http://www.diku.dk/~pisinger/codes.html). Optimizes the volume of rectangular cubes inside a rectangular containers Displays the result in 3d graphics. Can be used on this website: http://www.3dbinbox.com

popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known...

https://github.com/mhisoft/rdpro

...Forgot to mention, this software uses Java so you must have installed at least Java runtime 7. The printing option prints to the default printer. Also, to start using the program extract archive, select bin folder and run Main.exe. This is prepared startup executable. Tested with Google Chrome. Updates: Added options menu where it is possible change sender and its address.

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.

A framework to enable local authorities to promote and publicise the geographical and political structures of their area and to enable the move to a Self Service approach to providing public services.

Algorithm for 3d bin packing problem

Project developed for the "Ottimizzazione Combinatoria" course of the 2009/10 accademic year. The program provides some heuristics for solve an instance of the "Variable Sized Bin Packing" problem.

A simple desktop utility for putting the most amount of files onto a given set of CD/DVDs. Typically known as the Bin Packing or Knapsack problem.

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 is an attempt to solve 3D Bin Packing Problem. That is basically is packing a set number of boxes to ONE bin. User interface runs on OpenGL using 'Quantum energy' engine which is developed as part of this project.

French : Projet JAVA, dans le cadre d'un travail de Recherche Opérationelle. Bin-Packing,de fichiers MP3 sur des CDs, avec gestion des conflits

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.