Computing time-dependent bid prices in network revenue management problems

Transportation Science

Volumn 44, Issue 1, 2010, Pages 38-62

  Kunnumkal, Sumit ^a   Topaloglu, Huseyin ^b  

^a INDIAN SCHOOL OF BUSINESS   (India)

^b School of Operations Research and Industrial Engineering   (United States)

Author keywords

Approximate dynamic programming; Lagrangian relaxation; Network revenue management

Indexed keywords

COSTS; LINEAR PROGRAMMING;

APPROXIMATE DYNAMIC PROGRAMMING; COMPUTATIONAL EXPERIMENT; COMPUTING TIME; EXPECTED REVENUE; IN NETWORKS; LAGRANGIAN RELAXATION; NETWORK REVENUE MANAGEMENTS; UPPER BOUND;

DYNAMIC PROGRAMMING;

EID: 77949290296     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1090.0291     Document Type: Article

References (27)

1. Adelman, D. 2007. Dynamic bid prices in revenue management. Oper. Res. 55(4) 647-661.
2. Adelman, D., A. J. Mersereau. 2008. Relaxations of weakly coupled stochastic dynamic programs. Oper. Res. 56(3) 712-727.
3. Belobaba, P. P. 1987. Air travel demand and airline seat inventory control. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA.
4. Bertsekas, D. P. 2001. Dynamic Programming and Optimal Control. Athena Scientific, Belmont, MA.
5. Bertsimas, D., I. Popescu. 2003. Revenue management in a dynamic network environment. Transportation Sci. 37 257-277.
6. Castanon, D. A. 1997. Approximate dynamic programming for sensor management. Proc. 36th Conf. Decision Control, Institute of Electrical and Electronics Engineers, San Diego.
7. Cheung, R. K., W. B. Powell. 1996. An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management. Oper. Res. 44(6) 951-963.
8. Cooper, W. L. 2002. Asymptotic behavior of an allocation policy for revenue management. Oper. Res. 50(4) 720-727.
9. Gallego, G., G. Iyengar, R. Phillips, A. Dubey. 2004. Managing flexible products on a network. Technical report TR-2004-01, Computational Optimization Research Center, Columbia University, New York, http://corc.ieor.columbia.edu/ reports/techreports.html.
10. Hawkins, J. 2003. A Lagrangian decomposition approach to weakly coupled dynamic optimization problems and its applications. Unpublished doctoral dissertation, Massachusetts Institute of Technology, Cambridge, MA.
11. Karmarkar, U. S. 1981. The multiperiod multilocation inventory problems. Oper. Res. 29 215-228.
12. Kunnumkal, S., H. Topaloglu. 2008a. A duality-based relaxation and decomposition approach for inventory distribution systems. Naval Res. Logist. Quart. 55(7) 612-631.
13. Kunnumkal, S., H. Topaloglu. 2008b. A refined deterministic linear program for the network revenue management problem with customer choice behavior. Naval Res. Logist. Quart. 55 563-580.
14. Kunnumkal, S., H. Topaloglu. 2009. A new dynamic programming decomposition method for the network revenue management problem with customer choice behavior. Production Oper. Management. Forthcoming.
15. Law, A. L., W. D. Kelton. 2000. Simulation Modeling and Analysis. McGraw-Hill, Boston.
16. Liu, Q., G. van Ryzin. 2008. On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10(2) 288-310.
17. Ruszczynski, A. 2003. Decomposition methods. A. Ruszczynski, A. Shapiro, eds. Handbook in Operations Research and Management Science, Vol. 10, Stochastic Programming. North Holland, Amsterdam.
18. Simpson, R. W. 1989. Using network flow techniques to find shadow prices for market and seat inventory control. Technical report, Massachusetts Institute of Technology Flight Transportation Laboratory Memorandum M89-1, Cambridge, MA.
19. Talluri, K., G. van Ryzin. 1998. An analysis of bid-price controls for network revenue management. Management Sci. 44(11) 1577-1593.
20. Talluri, K., G. van Ryzin. 1999. A randomized linear programming method for computing network bid prices. Transportation Sci. 33(2) 207-216.
21. Talluri, K. T., G. J. van Ryzin. 2004. The Theory and Practice of Revenue Management. Kluwer Academic Publishers, Boston.
22. Topaloglu, H. 2009. Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. 57(3) 637-649.
23. Topaloglu, H., S. Kunnumkal. 2006. Computing time-dependent bid prices in network revenue management problems. Technical report, Cornell University, School of Operations Research and Information Engineering, Ithaca, NY, http://legacy.orie.cornell.edu/~huseyin/publications/publications.html.
24. Varaiya, P. P. 1998. Lecture notes on optimization. Unpublished manuscript, University of California, Department of Electrical Engineering and Computer Science. http://paleale.eecs.berkeley.edu/~varaiya/papers-ps.dir.NOO. pdf.
25. Williamson, E. L. 1992. Airline network seat control. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA.
26. Wolsey, L. A. 1998. Integer Programming. John Wiley & Sons, Inc., New York.
27. Zhang, D., D. Adelman. 2006. An approximate dynamic programming approach to network revenue management with customer choice. Technical report, University of Chicago, Graduate School of Business, Chicago.