Artículo

Méndez-Díaz, I.; Miranda-Bront, J.J.; Vulcano, G.; Zabala, P. "A branch-and-cut algorithm for the latent-class logit assortment problem" (2014) Discrete Applied Mathematics. 164(PART 1):246-263
Estamos trabajando para incorporar este artículo al repositorio
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

We study the product assortment problem of a retail operation that faces a stream of customers who are heterogeneous with respect to preferences. Each customer belongs to a market segment characterized by a consideration set that includes the alternatives viewed as options, and by the preference weights that the segment assigns to each of those alternatives. Upon arrival, he checks the offer set displayed by the firm, and either chooses one of those products or quits without purchasing according to a multinomial-logit (MNL) criterion. The firm's goal is to maximize the expected revenue extracted during a fixed time horizon. This problem also arises in the growing area of choice-based, network revenue management, where computational speed is a critical factor for the practical viability of a solution approach. This so-called latent-class, logit assortment problem is known to be NP-Hard. In this paper, we analyze unconstrained and constrained (i.e., with a limited number of products to display) versions of it, and propose a branch-and-cut algorithm that is computationally fast and leads to (nearly) optimal solutions. © 2012 Elsevier B.V. All rights reserved.

Registro:

Documento: Artículo
Título:A branch-and-cut algorithm for the latent-class logit assortment problem
Autor:Méndez-Díaz, I.; Miranda-Bront, J.J.; Vulcano, G.; Zabala, P.
Filiación:Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina
Leonard N. Stern School of Business, New York University, New York, NY, United States
Consejo Nacional de Investigaciones Científicas y Técnicas, Argentina
Palabras clave:Choice behavior; Fractional programming; Integer programming; Multinomial logit; Retail operations; Revenue management; Choice behaviors; Fractional programming; Multinomial Logit; Retail operations; Revenue management; Combinatorial optimization; Industry; Integer programming; Management; Sales
Año:2014
Volumen:164
Número:PART 1
Página de inicio:246
Página de fin:263
DOI: http://dx.doi.org/10.1016/j.dam.2012.03.003
Título revista:Discrete Applied Mathematics
Título revista abreviado:Discrete Appl Math
ISSN:0166218X
CODEN:DAMAD
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v164_nPART1_p246_MendezDiaz

Referencias:

  • Ben-Akiva, M., Lerman, S., (1994) Discrete Choice Analysis: Theory and Applications to Travel Demand, , sixth ed. The MIT Press Cambridge, MA
  • Cachon, G., Terwiesch, C., Xu, Y., Retail assortment planning in the presence of consumer search (2005) Manufacturing & Service Operations Management, 7, pp. 330-346
  • Cardell, N., Dunbar, F., Measuring the societal impacts of automobile downsizing (1980) Transportation Research Part A, 14, pp. 423-434
  • Caro, F., Gallien, J., Dynamic assortment with demand learning for seasonal consumer Goods (2007) Management Science, 53, pp. 276-292
  • Chintagunta, P., Jain, D., Vilcassim, N., Investigating heterogeneity in brand preference in logit models for panel data (1991) Journal of Marketing Research, 28, pp. 417-428
  • Farias, V., Jagabathula, S., Shah, D., (2009) A New Approach to Modeling Choice with Limited Data, , Working paper, MIT Sloan School of Management, Cambridge, MA
  • Fisher, M., Rocket science retailing: The 2006 Philip McCord Morse lecture (2009) Operations Research, 57, pp. 527-540
  • Fisher, M., Vaidyanathan, R., (2009) An Algorithm and Demand Estimation Procedure for Retail Assortment Optimization, , Working paper, OPIM Department, The Wharton School, University of Pennsylvania
  • Gallego, G., Iyengar, G., Phillips, R., Dubey, A., Managing flexible products on a network (2004) Technical Report CORC TR-2004-01, , Department of Industrial Engineering and Operations Research, Columbia University
  • Goyal, V., Levi, R., Segev, D., (2009) Near-optimal Algorithms for the Assortment Planning Problem under Dynamic Substitution and Stochastic Demand, , Working paper, Operations Research Center, MIT, Cambridge, MA
  • Kamakura, W., Russell, G., A probabilistic choice model for market segmentation and elasticity structure (1989) Journal of Marketing Research, 26, pp. 379-390
  • Kök, G., Fisher, M., Vaidyanathan, R., Assortment planning: Review of literature and industry practice (2009) Retail Supply Chain Management: Quantitative Models and Empirical Studies, pp. 99-154. , N. Agrawal, S. Smith, International Series in Operations Research & Management Science Springer (Chapter 6)
  • Liu, Q., Van Ryzin, G., On the choice-based linear programming model for network revenue management (2008) Manufacturing & Service Operations Management, 10, pp. 288-310
  • Mahajan, S., Van Ryzin, G., Stocking retail assortments under dynamic consumer substitution (2001) Operations Research, 49, pp. 334-351
  • McFadden, D., Train, K., Mixed MNL models for discrete response (2000) Journal of Applied Econometrics, 15, pp. 447-470
  • Meggido, N., Combinatorial optimization with rational objective functions (1979) Mathematics of Operations Research, 4, pp. 414-424
  • Meissner, J., Strauss, A., (2009) Choice-based Network Revenue Management under Weak Market Segmentation, , Working paper, Lancaster University Management School, Bailrigg, Lancaster, UK
  • Miranda Bront, J., Méndez-Díaz, I., Vulcano, G., A column generation algorithm for choice-based network revenue management (2009) Operations Research, 57, pp. 769-784
  • Prokopyev, O., Meneses, C., Oliveira, C., Pardalos, P., On multiple-ratio hyperbolic 0-1 programming problems (2005) Pacific Journal of Optimization, 1 (2), pp. 327-345
  • Ratliff, R., Weatherford, L., A review of revenue management methods with dependent demands (2009) AGIFORS Cargo and RM Study Group Meeting, , Amsterdam, Netherlands, May
  • Rusmevichientong, P., Shen, M., Shmoys, D., Dynamic assortment optimization with multinomial logit choice model and capacity constraint (2010) Operations Research, 58, pp. 1666-1680
  • Rusmevichientong, P., Shmoys, D., Topaloglu, H., (2010) Assortment Optimization with Mixtures of Logits, , Working paper, School of Operations Research and Information Engineering, Cornell University, Ithaca, NY
  • Rusmevichientong, P., Topaloglu, H., (2010) Robust Assortment Optimization under the Multinomial Logit Choice Model, , Working paper, School of Operations Research and Information Engineering, Cornell University, Ithaca, NY
  • Saure, D., Zeevi, A., (2009) Optimal Dynamic Assortment Planning, , Working paper, Graduate School of Business, Columbia University, New York, NY
  • Smith, S., Optimizing retail assortments for diverse customer preferences (2009) Retail Supply Chain Management: Quantitative Models and Empirical Studies, pp. 183-205. , N. Agrawal, S. Smith, International Series in Operations Research & Management Science Springer (Chapter 8)
  • Smith, S., Agrawal, N., Management of multi-item retail inventory systems with demand substitution (2000) Operations Research, 48, pp. 50-64
  • Talluri, K., Van Ryzin, G.J., (2004) The Theory and Practice of Revenue Management, , Kluwer Academic Publishers New York, NY
  • Train, K., (2003) Discrete Choice Methods with Simulation, , Cambridge University Press New York, NY
  • Van Ryzin, G., Mahajan, S., On the relationship between inventory costs and variety benefits in retail assortments (1999) Management Science, 45, pp. 1496-1509
  • Wu, T., A note on a global approach for general 0-1 fractional programming (1997) European Journal of Operational Research, 101, pp. 220-223

Citas:

---------- APA ----------
Méndez-Díaz, I., Miranda-Bront, J.J., Vulcano, G. & Zabala, P. (2014) . A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Applied Mathematics, 164(PART 1), 246-263.
http://dx.doi.org/10.1016/j.dam.2012.03.003
---------- CHICAGO ----------
Méndez-Díaz, I., Miranda-Bront, J.J., Vulcano, G., Zabala, P. "A branch-and-cut algorithm for the latent-class logit assortment problem" . Discrete Applied Mathematics 164, no. PART 1 (2014) : 246-263.
http://dx.doi.org/10.1016/j.dam.2012.03.003
---------- MLA ----------
Méndez-Díaz, I., Miranda-Bront, J.J., Vulcano, G., Zabala, P. "A branch-and-cut algorithm for the latent-class logit assortment problem" . Discrete Applied Mathematics, vol. 164, no. PART 1, 2014, pp. 246-263.
http://dx.doi.org/10.1016/j.dam.2012.03.003
---------- VANCOUVER ----------
Méndez-Díaz, I., Miranda-Bront, J.J., Vulcano, G., Zabala, P. A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Appl Math. 2014;164(PART 1):246-263.
http://dx.doi.org/10.1016/j.dam.2012.03.003