Date of Award
Spring 2024
Project Type
Thesis
Program or Major
Information Technology
Degree Name
Master of Science
First Advisor
Michael Jonas
Second Advisor
Ken Gitlitz
Third Advisor
Timothy Finan
Abstract
Bin packing problem literally refers to bin packing: optimize fitting of a number of smaller containers into bins of equal volume, in order to occupy the smallest number of bins. It has various real-world applications, from stock cutting, container shipping to 3D transistor microprocessor design and computer files packing. Finding an optimal solution can easily become a very challenging task as the number of elements increases.Single algorithm application can be very effective in certain cases, but usually multiple algorithms are used in conjunction could be more effective for increased efficiency and for what is considered a highly optimized result. Developing a high-quality algorithm combination can be a challenging task. Companies keep their successful solutions protected as proprietary information, but there are open-source algorithms that can be used. This thesis presents a comparison and analysis between available commercial and open-source algorithms.
Recommended Citation
Mihu, Gabriel, "BIN PACKING PROBLEM - AN EFFICIENCY ANALYSIS BETWEEN COMMERCIAL CONTAINER LOADING AND OPEN-SOURCE OPTIMIZATION ALGORITHMS" (2024). Master's Theses and Capstones. 1834.
https://scholars.unh.edu/thesis/1834