An approximate dynamic programming approach for network capacity control problem with origin-destination demands Online publication date: Sat, 21-Mar-2015
by Feng Liu, Qizong Wu, Yanan Wang, Ying Qu
International Journal of Modelling, Identification and Control (IJMIC), Vol. 13, No. 3, 2011
Abstract: Bid-price control is a popular method for controlling the sale of inventory in revenue management. It is well known that the network capacity control problem can be formulated as a dynamic programming model. However, this formulation is intractable in practice due to the enormous size of the state space. As a result, various approximation methods are proposed in the literature. In this paper, we approximate the optimal dynamic programming value function with an affine function of the state vector and develop our model based on stochastic demand between origin-destination (O-D) pairs. We show that the resulting problem is the deterministic linear programming (DLP) for bid-price control. The DLP yields tighter bounds than the classical DLP. We give a column generation procedure for solving the DLP within a desired optimality tolerance, and present numerical results which show the policy perform from our solution approach can outperform that from the classical DLP.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook