Expected future value decomposition based bid price generation for large-scale network revenue management

Transportation Science

Volumn 47, Issue 2, 2013, Pages 181-197

  Escudero, L F ^a   Monge, J F ^b   Romero Morales, D ^c   Wang, J ^c  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b MIGUEL HERNÁNDEZ UNIVERSITY   (Spain)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Expected future value curves; Load factor of demand; Network revenue management; Nonadditive bid prices; Scenario trees; Stochastic dynamic programming

Indexed keywords

COSTS; DECISION TREES; STOCHASTIC MODELS; STOCHASTIC PROGRAMMING; STOCHASTIC SYSTEMS;

EXPECTED FUTURE VALUE CURVES; LOAD FACTORS; NETWORK REVENUE MANAGEMENTS; NON-ADDITIVE; SCENARIO TREE; STOCHASTIC DYNAMIC PROGRAMMING;

DYNAMIC PROGRAMMING;

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

References (35)

1. Adelman D (2007) Dynamic bid prices in revenue management. Oper. Res. 55(4): 647-661.
2. Akan M, Ata B (2009) Bid-price controls for network revenue management: Martingale characterization of optimal bid prices. Math. Oper. Res. 34(4): 912-936.
3. Ball MO, Queyranne M (2009) Toward robust revenue management: Competitive analysis of online booking. Oper. Res. 57(4): 950-963.
4. Bertsimas D, Popescu I (2003) Revenue management in a dynamic network environment. Transportation Sci. 37(3): 257-277.
5. Birge JR (1985) Decomposition and partitioning methods for multistage stochastic linear programs. Oper. Res. 33(5): 989-1007.
6. Birge J, Louveaux FV (1997) Introduction to Stochastic Programming (Springer, New York).
7. Cristóbal MP, Escudero LF, Monge JF (2009) On stochastic dynamic programming for solving large-scale planning problems under uncertainty. Comput. Oper. Res. 36(8): 2418-2428.
8. Chen L, Homem-de-Mello T (2010) Re-solving stochastic programming models for air revenue management. Ann. Oper. Res. 177(1): 91-114.
9. DeMiguel V, Mishra N (2008) What multistage stochastic programming can do for network revenue management. Working paper, London Business School, UK
10. Donohue CJ, Birge JR (2006) The abridged nested decomposition method for multistage stochastic linear programs with relatively complete recourse. Algorithmic Oper. Res. 1(1): 20-30.
11. D'Sylva E (1982) O and D seat assignment to maximize expected revenue. Technical report, Boeing Commercial Airplane Company, Seattle.
12. Emich K, Möller W, Römisch W (2010) Airline network revenue management under uncertainty by Lagrangian relaxation. 12th Internat. Conf. Stochastic Programming, Halifax, Canada.
13. Escudero LF, Garín A, Merino M, Pérez G (2007) A twostage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes. Ann. Oper. Res. 152(1): 395-420.
14. Escudero LF, Garín MA, Merino M, Pérez G (2009) A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems. Comput. Oper. Res. 36(9): 2590-2600.
15. Escudero LF, Garín MA, Merino M, Pérez G (2010a) An exact algorithm for solving large-scale two-stage stochastic mixed- integer problems: Some theoretical and computational aspects. Eur. J. Oper. Res. 204(1): 105-116.
16. Escudero LF, Garín MA, Merino M, Pérez G (2010b) On BFCMSMIP strategies for scenario cluster partitioning and twin node families branching selection and bounding for multistage stochastic mixed integer programming. Comput. Oper. Res. 37(4): 738-753.
17. Glover F, Glover R, Lorenzo J, McMillan C (1982) The passenger mix problem in the scheduling airlines. Interfaces 12(3): 73-79.
18. Haensel A, Mederer M, Schmidt H (2011) Revenue management in the car rental industry: A stochastic programming approach. J. Revenue Pricing Management 11(1): 99-108.
19. Higle JL, Sen S (2005) A stochastic programming model for network resource utilization in the presence of multiclass demand uncertainty. Wallace SW, Ziemba WT, eds. Applications of Stochastic Programming. MPS-SIAM Series on Optimization (SIAM/MPS, Philadelphia), 299-313.
20. IBM ILOG (2007) CPLEX 11.0, http://www.ilog.com/products/cplex.
21. Kunnumkal S, Topaloglu H (2010) Computing time-dependent bid prices in network revenue management problem. Transportation Sci. 44(1): 38-62.
22. Möller A, Römisch W, Weber K (2004) A new approach to O-D revenue management based on scenario trees. J. Revenue Pricing Management 3(3): 265-276.
23. Möller A, Römisch W, Weber K (2008) Airline network revenue management by multistage stochastic programming. Computational Management Sci. 5(4): 355-377.
24. Powell WB (2007) Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley, Hoboken, NJ).
25. Ross SM (1995) Introduction to Stochastic Dynamic Programming (Academic Press, Orlando, FL).
26. Smith BC, Penn CW (1988) Analysis of alternative origin-destination control strategies. Proc. Twenty Eight Annual AGIFORS Sympos., New Seabury, MA
27. Talluri KT, van Ryzin GJ (1998) An analysis of bid-price controls for network revenue management. Management Sci. 44(11): 1577-1593.
28. Talluri KT, van Ryzin GJ (1999) A randomized linear programming method for computing network bid prices. Transportation Sci. 33(2): 207-216.
29. Talluri KT, van Ryzin GJ (2004) The Theory and Practice of Revenue Management (Springer).
30. Topaloglu H (2009a) On the asymptotic optimality of the randomized linear programming method for network revenue management. Euro. J. Oper. Res. 197(3): 884-896.
31. Topaloglu H (2009b) Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. 57(3): 637-649.
32. van Slyke RM, Wets R (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17(4): 638-663.
33. Wets RJ-B (1974) Stochastic programs with fixed recourse: The equivalent deterministic program. SIAM Rev. 16(3): 309-339.
34. Wollmer RD (1992) An airline seat management model for a single leg route when lower fare classes book first. Oper. Res. 40(1): 26-37.
35. Wong JT, Koppelman FS, Daskin MS (1993) Flexible assignment approach to itinerary seat allocation. Transportation Res. Part B: Methodological 27(1): 33-48.