Abstract
This article is about seeking a good feasible solution in a reasonable amount of computation time to the three-dimensional Multiple Bin Size Bin Packing Problem (MBSBPP). The MBSBPP studied considers additional constraints encountered in real world air transportation situations, such as cargo stability and the particular shape of containers. This MBSBPP has already been formulated as a Mixed Integer linear Programming problem, but as yet only poor results have been achieved for even fairly small problem sizes. The goal of the work this paper describes is to develop heuristics that are able to quickly provide good initial feasible solutions for the MBSBPP. Three methodologies are considered, which are based on the decomposition of the original problem into easier subproblems: the matheuristics Relax-and-Fix, Insert-and-Fix and Fractional Relax-and-Fix. They have been parametrised on real data sets and then compared to each other. In particular, two of these techniques show promising results in reasonable computational times.
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.
