A Linear Programming Approximation for Network Capacity Control Problem with Customer Choice
作者： Feng Liu , Ying Qu , Yanan Wang
DOI: 10.1007/978-3-642-32054-5_194
关键词:
摘要: By dividing customers into different segments according to origin destination (O-D) pairs, we consider a network capacity control problem where each customer chooses the open product within segment he belongs to. Starting with Markov decision process (MDP) formulation, approximate value function an affine of state vector and develop our model based on O-D demands. The approximation results in linear program (LP). We give column generation procedure for solving dual LP provide numerical results.
springer.com
aasmr.org 
sci-hub.st 参考文章(5)
Guillermo Gallego, Garud Iyengar, Robert Phillips, Abhay Dubey, Managing Flexible Products on a Network Social Science Research Network. ,(2004) , 10.2139/SSRN.3567371
Qian Liu, Garrett van Ryzin, On the Choice-Based Linear Programming Model for Network Revenue Management Manufacturing & Service Operations Management. ,vol. 10, pp. 288- 310 ,(2008) , 10.1287/MSOM.1070.0169
Feng Liu, Qizong Wu, Yanan Wang, Ying Qu, None, An approximate dynamic programming approach for network capacity control problem with origin-destination demands International Journal of Modelling, Identification and Control. ,vol. 13, pp. 195- 201 ,(2011) , 10.1504/IJMIC.2011.041308
Juan José Miranda Bront, Isabel Méndez-Díaz, Gustavo Vulcano, A Column Generation Algorithm for Choice-Based Network Revenue Management Operations Research. ,vol. 57, pp. 769- 784 ,(2009) , 10.1287/OPRE.1080.0567
Garrett van Ryzin, Gustavo Vulcano, Simulation-Based Optimization of Virtual Nesting Controls for Network Revenue Management Operations Research. ,vol. 56, pp. 865- 880 ,(2008) , 10.1287/OPRE.1080.0550