Abstract
This paper studies container loading optimization problem. This problem is a subset of rectangular boxes loaded into a rectangular container with fixed dimensions such that maximize container's utilization ratio. A mathemati- cal model is given. Some principles which include space division, space merger, residual subspace omitted and loading rule are presented. A hybrid algorithm which integrate ant colony optimization algorithm with above principles is used to solve the container loading problem. The simulation results show that the model and the algorithm are effective.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
