Abstract
Packing an order in the most appropriately sized boxes can improve customer experience, reduce costs, and alleviate stress for the operator that packs the items into the boxes. Products to determine optimal packaging typically consider permutations of packing options and select one that likely minimizes total costs while preventing the likelihood of product damage. However, such products use algorithms where the runtime increases exponentially with the addition of a box or an item in the input, thus making them impractical for orders that require multiple boxes and items. Moreover, such products typically do not take merchant and product variations and specialized needs into consideration. This disclosure describes an efficient general-purpose algorithm to generate packing recommendations. The algorithm produces near-optimal packing recommendations within a reasonable time.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Poon, Jonathan Yue Shun and Su, Guorui, "Efficient Algorithm for Generating Order Packing Recommendations", Technical Disclosure Commons, (July 22, 2020)
https://www.tdcommons.org/dpubs_series/3455