The Assortment Packing Problem: Multiperiod Assortment Planning for Short-Lived Products

نویسندگان

  • Felipe Caro
  • Víctor Martínez-de-Albéniz
  • Paat Rusmevichientong
چکیده

Motivated by retailers’ frequent introduction of new items to refresh product lines and maintain their market shares, we present the assortment packing problem in which a firm must decide, in advance, the release date of each product in a given collection over a selling season. Our formulation models the trade-offs among profit margins, preference weights, and limited life cycles. A key aspect of the problem is that each product is short-lived in the sense that, once introduced, its attractiveness lasts only a few periods and vanishes over time. The objective is to determine when to introduce each product to maximize the total profit over the selling season. Even for two periods, the corresponding optimization problem is shown to be NP-complete. As a result, we study a continuous relaxation of the problem that approximates the problem well, when the number of products is large. When margins are identical and product preferences decay exponentially, its solution can be characterized: it is optimal to introduce products with slower decays earlier. The structural properties of the relaxation also help us to develop several heuristics, for which we establish performance guarantees. We test our heuristics with data on sales and release dates of woman handbags from an accessories retailer. The numerical experiments show that the heuristics perform very well and can yield significant improvements in profitability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application

Assortment planning at a retailer entails both selecting the set of products to be carried and setting inventory levels for each product. We study an assortment planning model in which consumers might accept substitutes when their favorite product is unavailable. We develop an algorithmic process to help retailers compute the best assortment for each store. First, we present a procedure for est...

متن کامل

Regionalized Assortment Planning for Multiple Chain Stores: Complexity, Approximability, and Solution Methods

In retail, assortment planning refers to selecting a subset of products to offer that maximizes profit. Assortments can be planned for a single store or a retailer with multiple chain stores where demand varies between stores. In this paper, we assume that a retailer with a multitude of stores wants to specify her offered assortment. To suit all local preferences, regionalization and store-leve...

متن کامل

Heuristics for the Assortment Planning Problem under Ranking-based Consumer Choice Models

We model a retailer’s assortment planning problem under a ranking-based choice model of consumer preferences. Under this consumer choice model each customer belongs to a type, where a type is a ranking of the potential products by the order of preference, and the customer purchases his highest ranked product (if any) offered in the assortment. In our model we consider products with different pr...

متن کامل

Optimal Dynamic Assortment Planning

We study a family of stylized assortment planning problems, where arriving customers make purchase decisions among offered products based on maximizing their utility. Given limited display capacity and no a priori information on consumers’ utility, the retailer must select which subset of products to offer. By offering different assortments and observing the resulting purchase behavior, the ret...

متن کامل

Retail Assortment Planning in the Presence of Consumer Search

Consumers often know what kind of product they wish to purchase, but do not know which speci...c variant best ...ts their needs, so consumers shop around. As a result, a consumer may ...nd an acceptable product in one store but nevertheless purchase nothing, opting to continue searching for an even better product. We study three versions of the retail assortment problem: a traditional, no-searc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Management Science

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2014