
NSF Org: |
CMMI Division of Civil, Mechanical, and Manufacturing Innovation |
Recipient: |
|
Initial Amendment Date: | August 9, 2015 |
Latest Amendment Date: | August 9, 2015 |
Award Number: | 1537536 |
Award Instrument: | Standard Grant |
Program Manager: |
Georgia-Ann Klutke
CMMI Division of Civil, Mechanical, and Manufacturing Innovation ENG Directorate for Engineering |
Start Date: | September 1, 2015 |
End Date: | August 31, 2019 (Estimated) |
Total Intended Award Amount: | $300,000.00 |
Total Awarded Amount to Date: | $300,000.00 |
Funds Obligated to Date: |
|
History of Investigator: |
|
Recipient Sponsored Research Office: |
77 MASSACHUSETTS AVE CAMBRIDGE MA US 02139-4301 (617)253-1000 |
Sponsor Congressional District: |
|
Primary Place of Performance: |
77 MASSACHUSETTS AVE Cambridge MA US 02139-4301 |
Primary Place of
Performance Congressional District: |
|
Unique Entity Identifier (UEI): |
|
Parent UEI: |
|
NSF Program(s): | OE Operations Engineering |
Primary Program Source: |
|
Program Reference Code(s): |
|
Program Element Code(s): |
|
Award Agency Code: | 4900 |
Fund Agency Code: | 4900 |
Assistance Listing Number(s): | 47.041 |
ABSTRACT
The challenge of finding an assortment of selected alternatives (e.g., products or services) that maximize the total revenue, profit or welfare in the face of heterogeneous customer segments, who have different preferences across alternatives, has been recognized by an increasing number of industries to be a major strategic and operational driver of success. This generic class of problems captures fundamental planning challenges, such as: "What selection of products should an e-retailer display for each search query?", "How does a brick and mortar retailer determine the product assortment in each store?" and "What services should a central planner offer to maximize the social welfare of heterogeneous population?" In spite of increased awareness to the importance of assortment decisions, and an increasing number of available commercial software tools to support them, many if not most firms, still struggle to make effective and data-driven assortment decisions. A key challenge is how to accurately and effectively capture a customer choice model, namely the preferences of customers across alternatives. The increasing availability of `big' data allows us to build more granular models of how customers choose. Unfortunately, these same granular choice models give rise to assortment optimization models that are extremely challenging to solve. The goal of this project is to develop a unified approach to study the relationship between documented behavioral features regarding how customers make purchasing choices, and the computational tractability of the corresponding assortment optimization problems. The grant aims to significantly advance the theoretical understanding of the learning and computational limitations of various assortment models, and the development of effective computational schemes to solve practical assortment problems at large scale.
This project aims to develop an innovative optimization and computational dynamic-programming based framework to study and solve assortment optimization problems under consider-then-rank choice models, which have been studied extensively in marketing and psychology. Under consider-than-rank choice models, customers are assumed to make choices in two phases. First they apply various heuristics to establish a consideration set of products they are willing to consider, and then they rank within the consideration set. Given an assortment, customers are assumed to choose the most preferred product available from within their consideration set. If successful, the framework to be developed would allow the study of how different assumptions regarding the heuristics customers apply to form their respective consideration sets and rankings affect the computational tractability of the resulting assortment problems. This will be done via an innovative graphical description of the underlying dynamic program that gives rise to "minimal" enumeration of dynamic programming sub-problems. The theoretical analysis will focus on developing tight bounds on the number sub-problems. Moreover, the "minimal" enumeration techniques will be leveraged to develop efficient practical algorithms to solve large scale practical assortment problems. Collaboration with industry partners will be used to enhance the practical impact of this research project, and to enrich the classroom experience for students.
PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH
Note:
When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external
site maintained by the publisher. Some full text articles may not yet be available without a
charge during the embargo (administrative interval).
Some links on this page may take you to non-federal websites. Their policies may differ from
this site.
PROJECT OUTCOMES REPORT
Disclaimer
This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.
The challenge of finding an assortment of selected alternatives (e.g., products or services) that maximize the total revenue, profit or welfare in the face of heterogeneous customer segments, who have different preferences across alternatives, has been recognized to be a critical success driver both by an increasing number of industries, as well as in the context of the design of optimal policy-level interventions.
This generic class of problems captures fundamental planning challenges, such as: "What selection of products should an e-retailer display for each search query?", "How does a brick and mortar retailer determine the product assortment in each store?" and "What services should a central policy planner offer, or what interventions it should pursue to maximize the social welfare of heterogeneous population?". In spite of increased awareness to the importance of assortment decisions, and an increasing number of available commercial software tools to support them, many if not most firms and policy makers, still struggle to make effective and data-driven ‘assortment’ decisions. A key challenge is how to accurately and effectively model and capture 'consumer choices', namely their preferences across alternatives. The increasing availability of `big' data allows us to build more granular models of how consumers choose. Unfortunately, these same granular choice models give rise to assortment optimization models that are extremely challenging to solve.
Intellectual Merit. The work under this project contributed to the development of a unified practical approach to study the relationship between empirically documented behavioral features regarding how consumers make purchasing (or other) choices, and the theoretical and practical computational tractability of the corresponding assortment optimization problems. More specifically, the work under the grant has yielded several important theoretical and practical contributions:
First, it is shown that, computationally, general assortment optimization problems are theoretically intractable not only to solve optimally but even approximately.
Second, the work develops new consumer choice models that explicitly capture empirically documented behavioral mechanisms from the psychology and marketing literature regarding how consumers make purchasing decisions, and give rise to theoretically and practically tractable assortment optimization models and optimal algorithms. In particular, the newly developed models and algorithms are shown, on industry as well as synthetic data, to be superior compared to existing state-of-the-art models currently used in the academic literature and in practice.
Third, the general new framework establishes a direct connection between choice model complexity and computational tractability.
Fourth, for several core variants of dynamic assortment models, where assortment and inventory decisions are optimized simultaneously, the work develops a range of computationally tractable greedy-like (i.e., extremely practical) approximation algorithms that not only admit analytical worst-case guarantees and reveal fundamental structural properties of the underlying models, but have superior empirical performance in computational experiments.
Finally, the work develops the first known analytical data-driven consumer choice models to capture consumption of fresh vegetables and fruits or more generally healthy food as a function of access and value. The models explains known empirical finding from field data. In particular, the newly developed models capture the potential impact of several existing policy interventions related to the challenge of ‘food deserts’ (i.e., poor neighborhoods with no access to healthy food), and inform tractable optimization models that provide important policy level insights.
Broader Impact. The research outcomes of the grant were disseminated into fourteen academic articles that are published or in advanced stages of review in top peer-reviewed academic journals in management science and operations research. Moreover, variants of several of the algorithms and the frameworks developed under the grant were used in industry settings with some preliminary promising results. In addition, this grant enabled the training of several PhD students, including three female students. One of the students that was supported by the grant currently holds a faculty position in a premiere university in Europe. Some of the grant research outcomes have already been disseminated into graduate courses and are used to train the next generation of researchers.
Last Modified: 02/09/2020
Modified by: Retsef Levi
Please report errors in award information by writing to: awardsearch@nsf.gov.