Multidimensional assortment problem with an application

This paper addresses the discrete multidimensional assortment problem. Asso rtment issues arise frequently in practice as an important design and inven tory problem which simultaneously seeks the answers to two related question s: (a) Which items (or sizes of a product) to stock? (b) How much of each t o stock? its discrete multidimensional version concerns itself with choosin g sizes from among a discrete set of possible ones with each size being cha racterized by more than one dimension. Our research is motivated by an appl ication of the problem in the distribution center of a global manufacturer of telecommunications equipment where the goal was to standardize the sizes of three-dimensional crates used to package finished items by selecting a few from among all crate sizes. The main contributions of this research are (1) modeling the assortment problem as a facility location problem, (2) de vising a heuristic procedure that generates a good solution to the problem as well as a bound on the optimal solution, and (3) implementing the heuris tic procedure on a PC so as to obtain solutions for actual large-scale inst ances of a three-dimensional problem. (C) 1999 John Wiley & Sons, Inc.