A Column Generation Algorithm for Choice-Based Network Revenue Management
|Authors:||Bront, Juan Jose Miranda|
|Keywords:||choice behavior;multinomial logit;capacity control;hyperbolic programming;integer programming|
|Abstract:||In the last few years, there has been a trend to enrich traditional revenue management models built upon the independent demand paradigm by accounting for customer choice behavior. This extension involves both modeling and computational challenges. One way to describe choice behavior is to assume that each customer belongs to a segment, which is characterized by a consideration set, i.e., a subset of the products provided by the firm that a customer views as options. Customers choose a particular product according to a multinomial-logit criterion, a model widely used in the marketing literature. In this paper, we consider the choice-based, deterministic, linear programming model (CDLP) of Gallego et al. , and the follow-up dynamic programming (DP) decomposition heuristic of van Ryzin and Liu , and focus on the more general version of these models, where customers belong to overlapping segments. To solve the CDLP for real-size networks, we need to develop a column generation algorithm. We prove that the associated column generation subproblem is indeed NP-Complete, and propose a simple, greedy heuristic to overcome the complexity of an exact algorithm. Our computational results show that the heuristic is quite effective, and that the overall approach has good practical potential and leads to high quality solutions.|
|Appears in Collections:||IOMS: Operations Management Working Papers|
Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.