Abstract
Not much work has been done on three-dimensional bin packing problem because of the larger number of complexities occurring as compared to packing problems in lower dimensions. Almost all solution procedures developed for bin packing are heuristic in nature. A heuristic algorithm has been presented here for packing a given set of regular sized boxes of different values into a given set of regular containers. The objective is to maximize the total value of the boxes packed into the given containers. The heuristic is based on an Integer Programming formulation that uses the fractional knapsack problem as a column generation subproblem.
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.
