IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v24y2022i3p1650-1663.html
   My bibliography  Save this article

Effective Online Order Acceptance Policies for Omnichannel Fulfillment

Author

Listed:
  • Su Jia

    (Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

  • Jeremy Karp

    (Marketplace Optimization, Lyft Inc, San Francisco, California)

  • R. Ravi

    (Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

  • Sridhar Tayur

    (Tepper School of Business, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213)

Abstract

Problem definition: Omnichannel retailing has led to the use of traditional stores as fulfillment centers for online orders. Omnichannel fulfillment problems have two components: (1) accepting a certain number of online orders prior to seeing store demands and (2) satisfying (or filling) some of these accepted online demands as efficiently as possible with any leftover inventory after store demands have been met. Hence, there is a fundamental trade-off between store cancellations of accepted online orders and potentially increased profits because of more acceptances of online orders. We study this joint problem of online order acceptance and fulfillment (including cancellations) to minimize total costs, including shipping charges and cancellation penalties in single-period and limited multiperiod settings. Academic/practical relevance: Despite the growing importance of omnichannel fulfillment via online orders, our work provides the first study incorporating cancellation penalties along with fulfillment costs. Methodology: We build a two-stage stochastic model. In the first stage, the retailer sets a policy specifying which online orders it will accept. The second stage represents the process of fulfilling online orders after the uncertain quantities of in-store purchases are revealed. We analyze threshold policies that accept online orders as long as the inventories are above a global threshold, a local threshold per region, or a hybrid. Results: For a single period, total costs are unimodal as a function of the global threshold and unimodal as a function of a single local threshold holding all other local thresholds at constant values, motivating a gradient search algorithm. Reformulating as an appropriate linear program with network flow structure, we estimate the derivative (using infinitesimal perturbation analysis) of the total cost as a function of the thresholds. We validate the performance of the threshold policies empirically using data from a high-end North American retailer. Our two-location experiments demonstrate that local thresholds perform better than global thresholds in a wide variety of settings. Conversely, in a narrow region with negatively correlated online demand between locations and very low shipping costs, global threshold outperforms local thresholds. A hybrid policy only marginally improves on the better of the two. In multiple periods, we study one- and two-location models and provide insights into effective solution methods for the general case. Managerial implications: Our methods provide effective algorithms to manage fulfillment costs for online orders, demonstrating a significant reduction over policies that treat each location separately and reflecting the significant advantage of incorporating shipping in computing thresholds. Numerical studies provide insights as to why local thresholds perform well in a wide variety of situations.

Suggested Citation

  • Su Jia & Jeremy Karp & R. Ravi & Sridhar Tayur, 2022. "Effective Online Order Acceptance Policies for Omnichannel Fulfillment," Manufacturing & Service Operations Management, INFORMS, vol. 24(3), pages 1650-1663, May.
  • Handle: RePEc:inm:ormsom:v:24:y:2022:i:3:p:1650-1663
    DOI: 10.1287/msom.2021.1024
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2021.1024
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2021.1024?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormsom:v:24:y:2022:i:3:p:1650-1663. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.