Abstract
A new heuristic algorithm based on simple blocks is proposed in this paper to pack to solve three-dimensional packing problems(3DPP), and a self-adaptive genetic algorithm is used to optimize the packing sequence and direction of the constraint sequence in order to find an approximate optimal solution of the problem. In the heuristic algorithm, the simple block selected each time must not only to be packed into the current residual space, but also to be the most appropriate one, the packing sequence is a permutation of the types of boxes. An experimental study over the LN computational example shows that the algorithm is an effective method to solve the packing problems.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
