3d bin-packing problem with non-optimal solution

I have transformed a problem from a different domain into a 3d bin-packing problem. The amount of free space is around 40%. What I need is that boxes are arranged in a kind of random fashion. I was wondering if any simple solver is available. The input is of the following format:

box_size: 100 100 100

item#: len_x : len_y : len_z : number of items
    1:    10      20      30   1
    2:     8      10      10   2
    3:     1       2       3   8