Multidimensional assortment problem with an application

Date

1999-05-01

Author

Tripathy, A
Süral, Haldun
Gerchak, Y

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

87
views

0
downloads

This paper addresses the discrete multidimensional assortment problem. Assortment issues arise frequently in practice as an important design and inventory problem which simultaneously seeks the answers to two related questions: (a) Which items (or sizes of a product) to stock? (b) How much of each to stock? its discrete multidimensional version concerns itself with choosing sizes from among a discrete set of possible ones with each size being characterized by more than one dimension. Our research is motivated by an application 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) devising a heuristic procedure that generates a good solution to the problem as well as a bound on the optimal solution, and (3) implementing the heuristic procedure on a PC so as to obtain solutions for actual large-scale instances of a three-dimensional problem. (C) 1999 John Wiley & Sons, Inc.

Subject Keywords

Uncapacitated facility location, Stock, Glass, Sizes

URI

https://hdl.handle.net/11511/55082

Journal

NETWORKS

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Discrete linear Hamiltonian systems: Lyapunov type inequalities, stability and disconjugacy criteria Zafer, Ağacık (2012-12-15) In this paper, we first establish new Lyapunov type inequalities for discrete planar linear Hamiltonian systems. Next, by making use of the inequalities, we derive stability and disconjugacy criteria. Stability criteria are obtained with the help of the Floquet theory, so the system is assumed to be periodic in that case.
Multipath Characteristics of Frequency Diverse Arrays Over a Ground Plane Cetintepe, Cagri; Demir, Şimşek (Institute of Electrical and Electronics Engineers (IEEE), 2014-07-01) This paper presents a theoretical framework for an analytical investigation of multipath characteristics of frequency diverse arrays (FDAs), a task which is attempted for the first time in the open literature. In particular, transmitted field expressions are formulated for an FDA over a perfectly conducting ground plane first in a general analytical form, and these expressions are later simplified under reasonable assumptions. Developed formulation is then applied to a uniform, linear, continuous-wave opera...
A discrete optimality system for an optimal harvesting problem Bakan, Hacer Oz; Yilmaz, Fikriye; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2017-10-01) In this paper, we obtain the discrete optimality system of an optimal harvesting problem. While maximizing a combination of the total expected utility of the consumption and of the terminal size of a population, as a dynamic constraint, we assume that the density of the population is modeled by a stochastic quasi-linear heat equation. Finite-difference and symplectic partitioned Runge-Kutta (SPRK) schemes are used for space and time discretizations, respectively. It is the first time that a SPRK scheme is e...
Multisymplectic Schemes for the Complex Modified Korteweg-de Vries Equation AYDIN, AYHAN; Karasözen, Bülent (2008-09-20) In this paper, the multisymplectic formulation of the CMKdV(complex modified Korteweg-de Vries equation) is derived. Based on the multisymplectic formulation, the eight-point multisymplectic Preissman scheme and a linear-nonlinear multisymplectic splitting scheme are developed. Both methods are compared numerically with respect to the conservation of local and global quantities of the CMKdV equation.
Binarized Weight Networks for Inverse Problems Ozkan, Savas; Becek, Kadircan; Inci, Alperen; Kutukcu, Basar; Ugurcali, Faruk; Kaya, Mete Can; Akar, Gözde (2020-01-01) In this paper, we present a binarized neural network structure for inverse problems. In this structure, memory requirements and computation time are significantly reduced with a negligible performance drop compared to full-precision models. For this purpose, a unique architecture is proposed based on a residual learning. Precisely, it opts to reconstruct only the error between input and output images, which is eventually centralized the responses around zero. To this end, this provides several advantages fo...

Citation Formats

A. Tripathy, H. Süral, and Y. Gerchak, “Multidimensional assortment problem with an application,” NETWORKS, pp. 239–245, 1999, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55082.