Abstract
The actual NP-completed orthogonal bin packing problem is considered in the article. In practice a solution of a large number of different practical problems, including problems in logistics and scheduling comes down to the bin packing problem. A decision of an any packing problem is represented as a placement string which contains a sequence of objects selected to pack. The article proposes a new multilevel linked data structure that improves the effectiveness of decoding of the placement string and as a consequence, increases the speed of packing generation. The new data structure is applicable for all multidimensional orthogonal bin packing problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.