Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences

58 Pages Posted: 5 Sep 2015 Last revised: 16 Dec 2017

See all articles by Ali Aouad

Ali Aouad

London Business School

Retsef Levi

MIT Sloan School of Management - Operations Research Center

Danny Segev

Tel Aviv University - School of Mathematical Sciences

Date Written: September 3, 2015

Abstract

We study the joint assortment planning and inventory management problem, where stock-out events elicit dynamic substitution effects, described by the Multinomial Logit (MNL) choice model. Special cases of this setting have extensively been studied in recent literature, notably the static assortment planning problem. Nevertheless, the general formulation is not known to admit efficient algorithms with analytical performance guarantees prior to this work, and most of its computational aspects are still wide open.

In this paper, we devise the first provably-good approximation algorithm for dynamic assortment planning under the MNL model, attaining a constant-factor guarantee for a broad class of demand distributions, that satisfy the increasing failure rate property. Our algorithm relies on a combination of greedy procedures, where stocking decisions are restricted to specific classes of products and the objective function takes modified forms. We demonstrate that our approach substantially outperforms state-of-the-art heuristic methods in terms of performance and speed, leading to an average revenue gain of 4% to 12% in computational experiments. In the course of establishing our main result, we develop new algorithmic ideas that may be of independent interest. These include weaker notions of submodularity and monotonicity, shown sufficient to obtain constant-factor worst-case guarantees, despite using noisy estimates of the objective function.

Keywords: assortment planning, dynamic substitution, approximation algorithms, submodularity.

Suggested Citation

Aouad, Ali and Levi, Retsef and Segev, Danny, Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences (September 3, 2015). Available at SSRN: https://ssrn.com/abstract=2655759 or http://dx.doi.org/10.2139/ssrn.2655759

Ali Aouad

London Business School ( email )

Sussex Place
Regent's Park
London, London NW1 4SA
United Kingdom

Retsef Levi

MIT Sloan School of Management - Operations Research Center ( email )

100 Main Street
E62-416
Cambridge, MA 02142
United States

Danny Segev (Contact Author)

Tel Aviv University - School of Mathematical Sciences ( email )

Tel Aviv 69978
Israel

Here is the Coronavirus
related research on SSRN

Paper statistics

Downloads
303
Abstract Views
1,226
rank
111,890
PlumX Metrics