Think out of the package: Recommending package types for e-commerce shipments

• URL: http://arxiv.org/abs/2006.03239v1
• Date: Fri, 5 Jun 2020 05:27:51 GMT
• Title: Think out of the package: Recommending package types for e-commerce shipments
• Authors: Karthik S. Gurumoorthy, Subhajit Sanyal and Vineet Chaoji
• Abstract summary: Multiple product attributes determine the package type used by e-commerce companies to ship products. Sub-optimal package types lead to damaged shipments, incurring huge damage related costs. We propose a multi-stage approach that trades-off between shipment and damage costs for each product.
• Score: 2.741530713365541
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multiple product attributes like dimensions, weight, fragility, liquid content etc. determine the package type used by e-commerce companies to ship products. Sub-optimal package types lead to damaged shipments, incurring huge damage related costs and adversely impacting the company's reputation for safe delivery. Items can be shipped in more protective packages to reduce damage costs, however this increases the shipment costs due to expensive packaging and higher transportation costs. In this work, we propose a multi-stage approach that trades-off between shipment and damage costs for each product, and accurately assigns the optimal package type using a scalable, computationally efficient linear time algorithm. A simple binary search algorithm is presented to find the hyper-parameter that balances between the shipment and damage costs. Our approach when applied to choosing package type for Amazon shipments, leads to significant cost savings of tens of millions of dollars in emerging marketplaces, by decreasing both the overall shipment cost and the number of in-transit damages. Our algorithm is live and deployed in the production system where, package types for more than 130,000 products have been modified based on the model's recommendation, realizing a reduction in damage rate of 24%.

Related papers

• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Deep Reinforcement Learning for Traveling Purchaser Problems [63.37136587778153]
  The traveling purchaser problem (TPP) is an important optimization problem with broad applications. We propose a novel approach based on deep reinforcement learning (DRL), which addresses route construction and purchase planning separately. By introducing a meta-learning strategy, the policy network can be trained stably on large-sized TPP instances.
  arXiv  Detail & Related papers  (2024-04-03T05:32:10Z)
• Unveiling the Power of Self-Attention for Shipping Cost Prediction: The Rate Card Transformer [2.5398014196797614]
  Current solutions for estimating shipping costs on day 0 rely on tree-based models that require extensive manual engineering efforts. In this study, we propose a novel architecture called the Rate Card Transformer (RCT) that uses self-attention to encode all package shipping information. Our results demonstrate that cost predictions made by the RCT have 28.82% less error compared to tree-based GBDT model.
  arXiv  Detail & Related papers  (2023-11-20T11:48:50Z)
• Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits [81.60136088841948]
  We propose an algorithm that minimizes the regret over the horizon of time $T$. The proposed algorithm is applicable to domains such as recommendation systems and transportation.
  arXiv  Detail & Related papers  (2023-01-31T03:49:00Z)
• ItemSage: Learning Product Embeddings for Shopping Recommendations at Pinterest [60.841761065439414]
  At Pinterest, we build a single set of product embeddings called ItemSage to provide relevant recommendations in all shopping use cases. This approach has led to significant improvements in engagement and conversion metrics, while reducing both infrastructure and maintenance cost.
  arXiv  Detail & Related papers  (2022-05-24T02:28:58Z)
• A decision-tree framework to select optimal box-sizes for product shipments [0.700545830845487]
  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. 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
  arXiv  Detail & Related papers  (2022-02-09T04:46:55Z)
• Delivery Issues Identification from Customer Feedback Data [0.0]
  This paper shows how to find these issues using customer feedback from the text comments and uploaded images. We used transfer learning for both Text and Image models to minimize the demand for thousands of labeled examples.
  arXiv  Detail & Related papers  (2021-12-26T12:41:10Z)
• Comparing Heuristics, Constraint Optimization, and Reinforcement Learning for an Industrial 2D Packing Problem [58.720142291102135]
  Cutting and Packing problems are occurring in different industries with a direct impact on the revenue of businesses. Machine learning is increasingly used for solving such problems.
  arXiv  Detail & Related papers  (2021-10-27T15:47:47Z)
• A Deep Reinforcement Learning Approach for Constrained Online Logistics Route Assignment [4.367543599338385]
  It is crucial for the logistics industry on how to assign a candidate logistics route for each shipping parcel properly. This online route-assignment problem can be viewed as a constrained online decision-making problem. We develop a model-free DRL approach named PPO-RA, in which Proximal Policy Optimization (PPO) is improved with dedicated techniques to address the challenges for route assignment (RA)
  arXiv  Detail & Related papers  (2021-09-08T07:27:39Z)
• Simulation-based Algorithm for Determining Best Package Delivery Alternatives under Three Criteria: Time, Cost and Sustainability [6.85316573653194]
  This paper develops a simulation algorithm that assists same-day package delivery companies to serve customers instantly. The proposed recommender system provides the best solution with respect to three criteria: cost, time, and sustainability. This paper also considers the best delivery alternative during the presence of a pandemic, such as COVID-19.
  arXiv  Detail & Related papers  (2021-06-05T18:17:09Z)
• Equitable and Optimal Transport with Multiple Agents [48.17429789586127]
  We introduce an extension of the Optimal Transport problem when multiple costs are involved. We aim to share equally between agents the work of transporting one distribution to another. Another point of view is when the goal is to partition equitably goods between agents according to their heterogeneous preferences.
  arXiv  Detail & Related papers  (2020-06-12T15:15:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.