Abstract
dc:description.abstractThis thesis handles a fundamental problem in retail: given an enormous variety of products which does the retailer display to its customers? This is the assortment planning problem. We solve this problem by developing algorithms that, given input parameters for products, can efficiently return the set of products that should be displayed. To develop these algorithms we use a mathematical model of how customers react to displayed items, a customer choice model. Below we consider two classic customer choice models, the Multinomial Logit model and Nested Logit model. Under each of these customer choice models we develop algorithms that solve the assortment planning problem. Additionally, we consider the constrained assortment planning problem where the retailer must display products to customers but must also satisfy operational constraints.
Degree
thesis:*- Name thesis:degree_name
- Ph. D., Operations Research
- Level thesis:degree_level
- Doctor of Philosophy
- Discipline thesis:degree_discipline
- Operations Research
- Grantor
- Cornell University
- Year dc:date.issued
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Davis, James
- Chair dc:contributor.chair
-
- Topaloglu,Huseyin
- Committee members dc:contributor.committeemember
-
- Frazier,Peter
- Williamson,David P.
- Shmoys,David B.
Subjects
dc:subject × 3Rights
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Dc Identifier Bibid
- 9255221