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

نویسندگان

  • Hans Corsten
  • Michael Hopf
  • Benedikt Kasper
  • Clemens Thielen
چکیده

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-level assortment optimization are widely used in practice and lead to competitive advantages. When selecting regionalized assortments, a trade-off between expensive, customized assortments in every store and inexpensive, identical assortments in all stores that neglect demand variation is preferable. We formulate a stylized model for the regionalized assortment planning problem (APP) with capacity constraints and given demand. In our approach, a common assortment that is supplemented by regionalized products is selected. While products in the common assortment are offered in all stores, products in the local assortments are customized and vary from store to store. Concerning the computational complexity, we show that the APP is strongly NPhard. The core of this hardness result lies in the selection of the common assortment. We formulate the APP as an integer program and provide algorithms and methods for obtaining approximate solutions and solving large-scale instances. Lastly, we perform computational experiments to analyze the benefits of regionalized assortment planning depending on the variation in customer demands between stores. Michael Hopf, Clemens Thielen University of Kaiserslautern, Department of Mathematics Paul-Ehrlich-Str. 14, D-67663 Kaiserslautern, Germany, e-mail: {hopf,thielen}@ mathematik.uni-kl.de Hans Corsten, Benedikt Kasper University of Kaiserslautern, Department of Business Studies and Economics Gottlieb-Daimler-Str. 42, D-67663 Kaiserslautern, Germany, e-mail: {benedikt.kasper, corsten}@wiwi.uni-kl.de

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

ثبت نام

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

منابع مشابه

Assortment and Pricing with Demand Learning

Retailers, from fashion stores to grocery stores, have to decide what range of products to offer (assortment planning) and what prices to charge (price optimization). New business trends, such as mass customization and shorter product life cycles, make predicting demand more difficult, which in turn complicates assortment planning and price optimization. We propose and study a stochastic dynami...

متن کامل

Assortment Planning for Multiple Quality Levels Using Locational Choice

Assortment planning is the process in which a retailer selects a product line to offer to customers and is a key determinant of a retailer’s profit. We consider the assortment planning problem using a locational choice model for customer product selection and allow for both horizontal and vertical product differentiation. When the distribution of customer preference is unimodal, the optimal sol...

متن کامل

Category Management and Coordination in Retail Assortment Planning in the Presence of Basket Shopping Consumers

T paper studies the assortment planning problem with multiple merchandise categories and basket shopping consumers (i.e., consumers who desire to purchase from multiple categories). We present a duopoly model in which retailers choose prices and variety level in each category and consumers make their store choice between retail stores and a no-purchase alternative based on their utilities from ...

متن کامل

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...

متن کامل

Meta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain

In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016