Abstract

AbstractA feasible solution for a container loading problem is the exact order, position and orientation in which the objects are loaded into the container. Several algorithms have been proposed to load objects with different shapes and taking into account a few constraints. The aim of this paper is to provide an approach to solve the problem of loading orthogonal and nonorthogonal boxes, considering them as polyhedral. In addition, our proposal deals with constraints on the dimensions of the container, whether every box can be rotated in any of the three dimensions, the maximum load bearing strength and also the minimum stability required.KeywordsParticle Swarm OptimizationLoad BearingStability ConstraintHexagonal PrismStandard Particle Swarm OptimizationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Full Text
Published version (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