IDEAS home Printed from https://ideas.repec.org/a/aza/ama000/y2021v6i4p377-386.html
   My bibliography  Save this article

Designing efficient assortments: A branch-and-bound method to optimise volume and satisfaction

Author

Listed:
  • Alves, Alessandro Martins

    (Director, Ipsos, UK)

  • Vriens, Marco

    (Chief Executive Officer, Kwantum, USA)

  • Ramos, Thiago Graça

    (Project Manager, Ipsos, Brazil)

Abstract

Category assortments are a key driver of retailer success. When a customer’s preferred product is unavailable, retailers must provide viable alternatives or risk losing the customer. This paper presents an analytical method that uses a survey-based approach where consumers make hypothetical (albeit not conjoint) choices. The objective is to identify how delisting a stock-keeping unit (SKU) will affect overall sales; the extent to which customers will abandon the store; and overall satisfaction with the store. Such knowledge will help retailers make the best delisting decisions and help both retailer and brands with their category management negotiations. It can also identify possible gaps for the brand, such as which alternatives in the competition’s portfolio have low substitutability and hence should perhaps be added to the brand’s product portfolio. This approach also allows brands to test new concepts and evaluate how adding a new (concept) SKU will affect sales of other SKUs and overall sales and profitability. The data are then modelled using a branch-and-bound algorithm. This approach can easily be implemented at the store level and allows for the optimisation of multiple objectives.

Suggested Citation

  • Alves, Alessandro Martins & Vriens, Marco & Ramos, Thiago Graça, 2021. "Designing efficient assortments: A branch-and-bound method to optimise volume and satisfaction," Applied Marketing Analytics: The Peer-Reviewed Journal, Henry Stewart Publications, vol. 6(4), pages 377-386, March.
  • Handle: RePEc:aza:ama000:y:2021:v:6:i:4:p:377-386
    as

    Download full text from publisher

    File URL: https://hstalks.com/article/6179/download/
    Download Restriction: Requires a paid subscription for full access.

    File URL: https://hstalks.com/article/6179/
    Download Restriction: Requires a paid subscription for full access.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Keywords

    assortment planning and optimisation; retail satisfaction; branch-and-bound optimisation;
    All these keywords.

    JEL classification:

    • M3 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Marketing and Advertising

    Statistics

    Access and download statistics

    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:aza:ama000:y:2021:v:6:i:4:p:377-386. 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: Henry Stewart Talks (email available below). General contact details of provider: .

    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.