Home > Research > Publications & Outputs > Dynamic Simultaneous Fare Proration for Large-S...

Electronic data

View graph of relations

Dynamic Simultaneous Fare Proration for Large-Scale Network Revenue Management

Research output: Working paper

Published

Standard

Dynamic Simultaneous Fare Proration for Large-Scale Network Revenue Management. / Kemmer, P; Strauss, A K; Winter, T.
Lancaster University: The Department of Management Science, 2011. (Management Science Working Paper Series).

Research output: Working paper

Harvard

Kemmer, P, Strauss, AK & Winter, T 2011 'Dynamic Simultaneous Fare Proration for Large-Scale Network Revenue Management' Management Science Working Paper Series, The Department of Management Science, Lancaster University.

APA

Kemmer, P., Strauss, A. K., & Winter, T. (2011). Dynamic Simultaneous Fare Proration for Large-Scale Network Revenue Management. (Management Science Working Paper Series). The Department of Management Science.

Vancouver

Kemmer P, Strauss AK, Winter T. Dynamic Simultaneous Fare Proration for Large-Scale Network Revenue Management. Lancaster University: The Department of Management Science. 2011. (Management Science Working Paper Series).

Author

Kemmer, P ; Strauss, A K ; Winter, T. / Dynamic Simultaneous Fare Proration for Large-Scale Network Revenue Management. Lancaster University : The Department of Management Science, 2011. (Management Science Working Paper Series).

Bibtex

@techreport{2ad2628cd0544fb2b496e6cd4bd16197,
title = "Dynamic Simultaneous Fare Proration for Large-Scale Network Revenue Management",
abstract = "Network revenue management is concerned with managing demand for products that require inventory from one or several resources by controlling product availability and/or prices in order to maximize expected revenues subject to the available resource capacities. One can tackle this problem by decomposing it into resource-level subproblems that can be solved efficiently, e.g. by dynamic programming (DP). We propose a new dynamic fare proration method specifically having large-scale applications in mind. It decomposes the network problem by fare proration and solves the resource-level dynamic programs simultaneously using simple, endogenously obtained dynamic marginal capacity value es- timates to update fare prorations over time. An extensive numerical simulation study demonstrates that the method results in tightened upper bounds on the optimal expected revenue, and that the obtained policies are very effective with regard to achieved revenues and required runtime.",
keywords = "Transport, Revenue Management, Dynamic Programming, Air Transport",
author = "P Kemmer and Strauss, {A K} and T Winter",
year = "2011",
language = "English",
series = "Management Science Working Paper Series",
publisher = "The Department of Management Science",
type = "WorkingPaper",
institution = "The Department of Management Science",

}

RIS

TY - UNPB

T1 - Dynamic Simultaneous Fare Proration for Large-Scale Network Revenue Management

AU - Kemmer, P

AU - Strauss, A K

AU - Winter, T

PY - 2011

Y1 - 2011

N2 - Network revenue management is concerned with managing demand for products that require inventory from one or several resources by controlling product availability and/or prices in order to maximize expected revenues subject to the available resource capacities. One can tackle this problem by decomposing it into resource-level subproblems that can be solved efficiently, e.g. by dynamic programming (DP). We propose a new dynamic fare proration method specifically having large-scale applications in mind. It decomposes the network problem by fare proration and solves the resource-level dynamic programs simultaneously using simple, endogenously obtained dynamic marginal capacity value es- timates to update fare prorations over time. An extensive numerical simulation study demonstrates that the method results in tightened upper bounds on the optimal expected revenue, and that the obtained policies are very effective with regard to achieved revenues and required runtime.

AB - Network revenue management is concerned with managing demand for products that require inventory from one or several resources by controlling product availability and/or prices in order to maximize expected revenues subject to the available resource capacities. One can tackle this problem by decomposing it into resource-level subproblems that can be solved efficiently, e.g. by dynamic programming (DP). We propose a new dynamic fare proration method specifically having large-scale applications in mind. It decomposes the network problem by fare proration and solves the resource-level dynamic programs simultaneously using simple, endogenously obtained dynamic marginal capacity value es- timates to update fare prorations over time. An extensive numerical simulation study demonstrates that the method results in tightened upper bounds on the optimal expected revenue, and that the obtained policies are very effective with regard to achieved revenues and required runtime.

KW - Transport

KW - Revenue Management

KW - Dynamic Programming

KW - Air Transport

M3 - Working paper

T3 - Management Science Working Paper Series

BT - Dynamic Simultaneous Fare Proration for Large-Scale Network Revenue Management

PB - The Department of Management Science

CY - Lancaster University

ER -