A decision-tree framework to select optimal box-sizes for product shipments
Auteurs : Karthik S. Gurumoorthy, Abhiraj Hinge
Résumé scientifique
In package-handling facilities, boxes of varying sizes are used to ship products. Improperly sized boxes with box dimensions much larger than the product dimensions create wastage and unduly increase the shipping costs. Since it is infeasible to make unique, tailor-made boxes for each of the $N$ products, the fundamental question that confronts e-commerce companies is: How many $K << N$ cuboidal boxes need to manufactured and what should be their dimensions? In this paper, we propose a solution for the single-count shipment containing one product per box in two steps: (i) reduce it to a clustering problem in the $3$ dimensional space of length, width and height where each cluster corresponds to the group of products that will be shipped in a particular size variant, and (ii) present an efficient forward-backward decision tree based clustering method with low computational complexity on $N$ and $K$ to obtain these $K$ clusters and corresponding box dimensions. Our algorithm has multiple constituent parts, each specifically designed to achieve a high-quality clustering solution. As our method generates clusters in an incremental fashion without discarding the present solution, adding or deleting a size variant is as simple as stopping the backward pass early or executing it for one more iteration. We tested the efficacy of our approach by simulating actual single-count shipments that were transported during a month by Amazon using the proposed box dimensions. Even by just modifying the existing box dimensions and not adding a new size variant, we achieved a reduction of $4.4\%$ in the shipment volume, contributing to the decrease in non-utilized, air volume space by $2.2\%$. The reduction in shipment volume and air volume improved significantly to $10.3\%$ and $6.1\%$ when we introduced $4$ additional boxes.
Les articles autour de lui, par date et par proximité
Plus haut, c’est plus proche de cet article ; à gauche, c’est plus ancien. Les traits relient les articles proches entre eux : les groupes de traits sont des sous-thèmes. Sélectionnez un point pour voir pourquoi il est là. Retour au résumé de cet article
Les articles autour de celui-ci
Classés selon la proximité de leur titre et de leur résumé avec ceux de cet article. Sélectionnez-en pour les lire ensemble.
Les articles les plus proches
-
A Machine Learning Approach to Solve the E-commerce Box-Sizing ProblemS. Kandula, Debjit Roy, K. Akartunalı · 2024 · Production and operations management · cité 4 fois · Pas encore résumé
Résumé scientifique
E-commerce packages are notorious for their inefficient usage of space. More than one-quarter volume of a typical e-commerce package comprises air and filler material. The inefficient usage of space significantly reduces the transportation and distribution capacity increasing the operational costs. Therefore, designing an optimal set of packaging box sizes is crucial for improving efficiency. We present the first learning-based framework to determine the optimal packaging box sizes. In particular, we propose a three-stage optimization framework that combines unsupervised learning, reinforcement learning, and tree search to design box sizes. The package optimization problem is formulated into…
-
A Machine Learning Approach to Shipping Box DesignGuang Yang, Cun Mu · 2018 · Intelligent Systems with Applications · cité 4 fois · Pas encore résumé
Résumé scientifique
Having the right assortment of shipping boxes in the fulfillment warehouse to pack and ship customer's online orders is an indispensable and integral part of nowadays eCommerce business, as it will not only help maintain a profitable business but also create great experiences for customers. However, it is an extremely challenging operations task to strategically select the best combination of tens of box sizes from thousands of feasible ones to be responsible for hundreds of thousands of orders daily placed on millions of inventory products. In this paper, we present a machine learning approach to tackle the task by formulating the box design problem prescriptively as a generalized version o…
-
A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-CommerceP. Fontaine, S. Minner · 2022 · Operational Research · cité 25 fois · Pas encore résumé
Résumé scientifique
Selecting a Parcel Type Portfolio to Reduce Unused Space in Transportation Wrongly sized parcels lead to unused space and inefficient transportation. With continuously increasing e-commerce and last-mile delivery volumes, available parcel types at a warehouse can significantly impact unused space that is transported. In “A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce,” Fontaine and Minner solve the trade-off between cost of unused space and cost of parcel variety through optimizing the portfolio of available parcel types. To solve large instances with millions of binary decision variables, the authors develop an exact decomposition method that allows…
-
Carton Set Optimization in E‐commerce Warehouses: A Case StudyManjeet Singh, Ehsan Ardjmand · 2020 · Journal of Business Logistics · cité 14 fois · Pas encore résumé
-
Optimizing Clustering Techniques for Retail Industry: One-Dimensional Time Warping Method for Demand UncertaintyMochamad Nizar Palefi Ma'ady, P. Meilanitasari, Nisa Isrofi et al. · 2023 · International Conference on Sustainable Information Engineering and Technology · cité 1 fois · Pas encore résumé
Résumé scientifique
Product availability is a crucial factor in maintaining customer satisfaction and securing revenue streams for retailers and suppliers. By clustering products based on demand patterns and inventory turnover, retailers can enhance efficiency and improve customer satisfaction. This study proposes optimizing product clustering by comparing dynamic time warping and k-means methods to find the best clustering solution. The results show that dynamic time warping outperforms the k-means algorithm, with a higher Silhouette score of 0.8406 compared to 0.7578. This indicates that our proposed method is more efficient in optimizing product clustering. Furthermore, the time complexity is faster compared…
-
Predicting Packaging Sizes Using Machine LearningMichael Heininger, R. Ortner · 2022 · Operations Research Forum · cité 5 fois · Pas encore résumé
Résumé scientifique
The increasing rate of e-commerce orders necessitates a faster packaging process, challenging warehouse employees to correctly choose the size of the package needed to pack each order. To speed up the packing process in the Austrian e-commerce company niceshops GmbH, we propose a machine learning approach that uses historical data from past deliveries to predict suitable package sizes for new orders. Although for most products no information regarding the volume is available, using an approximate volume computed from the chosen packages of previous orders can be shown to significantly increase the performance of a random forest algorithm. The respective learned model has been implemented int…
-
Automated Clustering and Vehicle Dispatching Service for Bulky Product DeliveryR. R. Asri, Aria Bisma Wahyutama, Mintae Hwang et al. · 2026 · 2026 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT) · Pas encore résumé
Résumé scientifique
This study proposes a web-based decision-support system for automated clustering and dispatching in bulky product delivery planning. In practice, delivery preparation processes, including order grouping, demand aggregation, vehicle dispatch planning, and driver coordination, are still performed manually, which creates operational inefficiencies and limits scalability as order volumes continue to grow. The proposed system integrates geocoding-based distance clustering using the Haversine formula with rule-based vehicle dispatching approach to generate feasible delivery plans under operational constraints. The system is implemented using Python and PostgreSQL with a web-based interface for dat…
-
Implementasi Algoritma K-Means Clustering untuk Pengelompokan Produk E-Commerce Berdasarkan Harga, Diskon, dan Total RevenueR. Pasaribu, Saidi Ramadan Siregar · 2026 · TIN: Terapan Informatika Nusantara · Pas encore résumé
Résumé scientifique
The rapid growth of e-commerce has generated a large volume of transactional data; however, this data has not been fully utilized to support strategic decision-making, particularly in product segmentation. The main problem addressed in this study is the absence of a systematic product grouping approach based on key attributes such as price, discount, and revenue, which leads to less effective pricing and promotional strategies. Therefore, this study aims to analyze product sales patterns and cluster e-commerce products based on the characteristics of price, discount_percent, and total_revenue. The dataset used is an Amazon-style e-commerce dataset consisting of 50,000 transaction records and…
Les travaux antérieurs sur lesquels il s’appuie
-
Carton Box Optimization Problem of VMI-based Apparel Supply ChainW. Wong, S. Y. Leung · 2006 · 2006 IEEE International Conference on Management of Innovation and Technology · cité 3 fois · Pas encore résumé
-
Optimal Size Selection in Standardization: A Case StudyC. Bongers · 1982 · Journal of the Operational Research Society · cité 15 fois · Pas encore résumé
-
An Integer Programming Approach to the Apparel Sizing ProblemPeter Tryfos · 1986 · Journal of the Operational Research Society · cité 53 fois · Pas encore résumé
-
On the Optimal Sizing ProblemR. V. V. Vidal · 1994 · Journal of the Operational Research Society · cité 3 fois · Pas encore résumé
-
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment ProblemI. Méndez-Díaz, J. Miranda-Bront, Gustavo J. Vulcano et al. · 2010 · Electron. Notes Discret. Math. · cité 95 fois · Pas encore résumé
Résumé scientifique
Abstract We study the product assortment problem of a retail operation that faces a stream of customers heterogeneous with respect to preferences. Upon arrival, each customer checks the offer set displayed by the firm, and either chooses one of those products according to a multinomial-logit (MNL) criterion or quits without purchasing. The firm's goal is to maximize the expected revenue extracted from each customer. The general version of the logit assortment problem is known to be NP-Hard. In this paper, we analyze uncapacitated and capacitated (i.e., with a limited number of products to display) versions of it, and propose a branch-and-cut algorithm that is computationally feasible and lea…
Aller plus loin
Comment ces articles sont-ils trouvés ?
Nous comparons le titre et le résumé de cet article avec ceux de tous les articles résumés sur ce site, et avec les articles que Semantic Scholar recommande, ceux qu’il cite et ceux qui le citent (pour un article très cité, ses citations les plus récentes et, depuis OpenAlex, les plus citées). Parmi les travaux antérieurs et les suites, les articles qui s’utilisent en profondeur, une méthode qu’il utilise et les suites très citées remontent un peu. Les niveaux (très proche, proche, apparenté) viennent de la similarité des textes, pas d’un jugement de qualité ; * signale un article sans résumé, comparé par son titre. La phrase sous un article est écrite par une IA à partir des deux résumés : vérifiez-la dans les articles. Un article jugé hors sujet par trois lecteurs quitte la liste.
Mis à jour le 4 novembre 2026.