Pricing substitutable flights in airline revenue management.

*(English)*Zbl 1176.90627Summary: We develop a Markov decision process formulation of a dynamic pricing problem for multiple substitutable flights between the same origin and destination, taking into account customer choice among the flights. The model is rendered computationally intractable for exact solution by its multi-dimensional state and action spaces, so we develop and analyze various bounds and heuristics. We first describe three related models, each based on some form of pooling, and introduce heuristics suggested by these models. We also develop separable bounds for the value function which are used to construct value- and policy-approximation heuristics. Extensive numerical experiments show the value- and policy-approximation approaches to work well across a wide range of problem parameters, and to outperform the pooling-based heuristics in most cases. The methods are applicable even for large problems, and are potentially useful for practical applications.

##### MSC:

90C40 | Markov and semi-Markov decision processes |

PDF
BibTeX
XML
Cite

\textit{D. Zhang} and \textit{W. L. Cooper}, Eur. J. Oper. Res. 197, No. 3, 848--861 (2009; Zbl 1176.90627)

Full Text:
DOI

##### References:

[1] | Algers, S.; Beser, M., Modelling choice of flight and booking class - A study using stated preference and revealed preference data, International journal of services technology and management, 2, 1/2, 28-45, (2001) |

[2] | Andersson, S., Passenger choice analysis for seat capacity control: A pilot project in Scandinavian airlines, International transactions in operational research, 5, 6, 471-486, (1998) |

[3] | Ben-Akiva, M.; Lerman, S., Discrete choice analysis, (1985), MIT Press Cambridge, MA |

[4] | Bertsekas, D.P.; Tsitsiklis, J.N., Neuro-dynamic programming, (1996), Athena Scientific Belmont, MA · Zbl 0924.68163 |

[5] | Bitran, G.; Caldentey, R., An overview of pricing models for revenue management, Manufacturing and service operations management, 5, 3, 203-229, (2003) |

[6] | Bitran, G.R.; Mondschein, S.V., Periodic pricing of seasonal products in retailing, Management science, 43, 1, 64-79, (1997) · Zbl 0888.90026 |

[7] | Bitran, G.; Caldentey, R.; Mondschein, S., Coordinating clearance markdown sales of seasonal products in retail chains, Operations research, 46, 5, 609-624, (1998) · Zbl 0996.90006 |

[8] | Boyd, A.; Kallesen, R., The science of revenue management when passengers purchase the lowest available fare, Journal of revenue and pricing management, 3, 2, 171-177, (2004) |

[9] | Carrier, E., 2003. Modeling airline passenger choice: Passenger preference for schedule in the passenger origin – destination simulator (PODS). Master’s Thesis, Massachusetts Institute of Technology. |

[10] | Elmaghraby, W.; Keskinocak, P., Dynamic pricing in the presence of inventory considerations: research overview, current practices, and future directions, Management science, 49, 10, 1287-1309, (2003) · Zbl 1232.90042 |

[11] | Gallego, G.; van Ryzin, G., Optimal dynamic pricing of inventories with stochastic demand over finite horizons, Management science, 40, 8, 999-1020, (1994) · Zbl 0816.90054 |

[12] | Gallego, G.; van Ryzin, G., A multi-product, multi-resource pricing problem and its applications to network yield management, Operations research, 45, 1, 24-41, (1997) · Zbl 0889.90052 |

[13] | Iyengar, G., Phillips, R., Gallego, G., Dubey, A., 2004. Managing flexible products on a network. CORC Technical Report TR-2004-01, Department of Industrial Engineering and Operations Research, Columbia University. |

[14] | Kleywegt, A.J., 2001. An optimal control problem of dynamic pricing. Working Paper, School of Industrial and Systems Engineering, Georgia Institute of Technology. |

[15] | Lin, KY, Li, F., 2004. Optimal dynamic pricing for a line of substitutable products. Working Paper, Grado Department of Industrial and Systems Engineering, Virginia Tech. |

[16] | Liu, B., Milner, J., 2006. Multiple-item dynamic pricing under a common pricing constraint. Working Paper, University of Toronto. |

[17] | Maglaras, C.; Meissner, J., Dynamic pricing strategies for multi-product revenue management problems, Manufacturing and service operations management, 8, 2, 136-148, (2006) |

[18] | Mahajan, S.; van Ryzin, G., Stocking retail assortments under dynamic consumer substitution, Operations research, 49, 3, 334-351, (2001) · Zbl 1163.90339 |

[19] | McFadden, D., 2000. Disaggregate behavioral travel demand’s RUM side: A 30-year retrospective. Technical Report, Department of Economics, University of California, Berkeley. |

[20] | Talluri, K.; van Ryzin, G., Revenue management under a general discrete choice model of consumer behavior, Management science, 50, 1, 15-33, (2004) · Zbl 1168.91427 |

[21] | Talluri, K.; van Ryzin, G., The theory and practice of revenue management, (2004), Kluwer Academic Publishers Boston · Zbl 1083.90024 |

[22] | Train, K.E., Discrete choice methods with simulation, (2003), Cambridge University Press Cambridge, UK · Zbl 1047.62098 |

[23] | van Ryzin, G., Liu, Q., 2007. On the choice-based linear programming model for network revenue management. Forthcoming in Manufacturing and Service Operations Management. |

[24] | van Ryzin, G., Vulcano, G., 2006. Computing virtual nesting controls for network revenue management under customer choice behavior. Forthcoming in Operations Research. · Zbl 1167.90357 |

[25] | Zhang, D.; Cooper, W.L., Revenue management for parallel flights with customer-choice behavior, Operations research, 53, 3, 415-431, (2005) · Zbl 1165.90342 |

[26] | Zhao, W.; Zheng, Y.-S., Optimal dynamic pricing for perishable assets with nonhomogeneous demand, Management science, 46, 3, 375-388, (2000) · Zbl 1231.91106 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.