Robust optimisation in network revenue management
Robust optimisation in network revenue management
Network revenue management is used extensively, particularly within the airline industry, to allocate dependent resources between different products. This work focuses on the situation where demand is uncertain and the aim is to determine booking limits that are robust to fluctuations in demand. Expanding on the work of Perakis and Roels (2010), we developed a genetic algorithm that finds booking limits that either minimize the maximum regret or maximize the minimum revenue for a number of different booking control policies: partitioned booking limits, nested booking limits and bid prices. We present results that demonstrate how these booking limits outperform those obtained via local descent methods and other traditional network models. Furthermore, we consider the uncertainty set for demand to be ellipsoidal further to the polyhedral as originally proposed. Finally, we introduce the formulation on network cruise revenue management application. We present the robust formulation for the cruise network setting and present numerical results that show that the robust control measures outperform standard approximation methods.
University of Southampton
Zachariades, Simos
1c5ec238-f82a-4819-ba2a-9e4ac2ae5b5b
July 2022
Zachariades, Simos
1c5ec238-f82a-4819-ba2a-9e4ac2ae5b5b
Currie, Christine
dcfd0972-1b42-4fac-8a67-0258cfdeb55a
Fliege, Joerg
54978787-a271-4f70-8494-3c701c893d98
Zachariades, Simos
(2022)
Robust optimisation in network revenue management.
University of Southampton, Doctoral Thesis, 143pp.
Record type:
Thesis
(Doctoral)
Abstract
Network revenue management is used extensively, particularly within the airline industry, to allocate dependent resources between different products. This work focuses on the situation where demand is uncertain and the aim is to determine booking limits that are robust to fluctuations in demand. Expanding on the work of Perakis and Roels (2010), we developed a genetic algorithm that finds booking limits that either minimize the maximum regret or maximize the minimum revenue for a number of different booking control policies: partitioned booking limits, nested booking limits and bid prices. We present results that demonstrate how these booking limits outperform those obtained via local descent methods and other traditional network models. Furthermore, we consider the uncertainty set for demand to be ellipsoidal further to the polyhedral as originally proposed. Finally, we introduce the formulation on network cruise revenue management application. We present the robust formulation for the cruise network setting and present numerical results that show that the robust control measures outperform standard approximation methods.
Text
SimosZachariades_PhD_Thesis
- Version of Record
Text
Permission to deposit thesis - form_SimosZachariades_RW
- Version of Record
Restricted to Repository staff only
More information
Published date: July 2022
Identifiers
Local EPrints ID: 471275
URI: http://eprints.soton.ac.uk/id/eprint/471275
PURE UUID: 8c63297c-3ebc-4fcd-bc8d-508490e0f5a5
Catalogue record
Date deposited: 01 Nov 2022 17:52
Last modified: 17 Mar 2024 03:12
Export record
Contributors
Author:
Simos Zachariades
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics