bpp.py File Reference

use SCIP for solving the bin packing problem. More...

Go to the source code of this file.

Functions
def	FFD (s, B)
def	bpp (s, B)
def	solveBinPacking (s, B)
def	DiscreteUniform (n=10, LB=1, UB=99, B=100)

Variables
	s
	B
	ffd = FFD(s,B)
	bins = solveBinPacking(s,B)

Detailed Description

use SCIP for solving the bin packing problem.

Definition in file bpp.py.

Function Documentation

def bpp.bpp	(		s,
			B
	)

bpp: Martello and Toth's model to solve the bin packing problem.
Parameters:
    - s: list with item widths
    - B: bin capacity
Returns a model, ready to be solved.

Definition at line 37 of file bpp.py.

def bpp.DiscreteUniform	(		n = 10,
			LB = 1,
			UB = 99,
			B = 100
	)

DiscreteUniform: create random, uniform instance for the bin packing problem.

Definition at line 111 of file bpp.py.

def bpp.FFD	(		s,
			B
	)

First Fit Decreasing heuristics for the Bin Packing Problem.
Parameters:
    - s: list with item widths
    - B: bin capacity
Returns a list of lists with bin compositions.

Definition at line 16 of file bpp.py.

def bpp.solveBinPacking	(		s,
			B
	)

solveBinPacking: use an IP model to solve the in Packing Problem.

Parameters:
    - s: list with item widths
    - B: bin capacity

Returns a solution: list of lists, each of which with the items in a roll.

Definition at line 82 of file bpp.py.