<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-20T03:27:29Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/82839" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/82839</identifier><datestamp>2026-06-06T01:05:33Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Peter P. Belobaba.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Lepage, Pierre-Olivier</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Department of Civil and Environmental Engineering.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Civil and Environmental Engineering</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Operations Research Center</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-12-06T20:47:58Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2013-12-06T20:47:58Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2013</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/82839</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">863223304</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M. in Operations Research)--Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, 2013.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Cataloged from PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (pages 85-86).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Although many airlines offer seats in multiple cabins (economy vs. premium classes) with different service quality, previous work on airline revenue management has focused on treating the cabins separately. In this thesis, we develop several single-leg multiple cabin revenue management optimization algorithms. We extend two different single-leg separate cabin dynamic programming algorithms to the multiple cabin case, and also present three Expected Marginal Seat Revenue (EMSR) based heuristics and a dynamic programming decomposition heuristic. We then evaluate the revenue and passenger mix performance of the different algorithms using the Passenger Origin-Destination Simulator (PODS) which simulates competitive markets with passenger choice of fare options and cabin. We first test the methods in a simple single market network and then in a more realistic complex network. We find that multiple cabin methods do not lead to a systematic revenue increase. Indeed, simulation results show that the performance of the different methods ranges from a decrease of 9.6% to an increase of 2.4% in revenues. The discrepancies in performance between the different methods are explained by the trade-off between revenue gains from additional economy bookings and the losses from displaced premium passengers. Further, we observe that successful methods lead to a revenue increase by accepting additional bookings in top economy classes rather than in low economy classes. Finally, the poor performance of the dynamic programming methods tested is due to a misalignment between the underlying assumptions of the algorithms and the reality of the booking and passenger choice process.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Pierre-Olivier Lepage.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M. in Operations Research</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">86 pages</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.I.T. theses are protected by 
copyright. They may be viewed from this source for any purpose, but 
reproduction or distribution in any format is prohibited without written 
permission. See provided URL for inquiries about permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Civil and Environmental Engineering.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Performance of multiple cabin optimization methods in airline revenue management</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="e28345aa-c2b1-477d-b40d-8883c0845105">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Performance of multiple cabin optimization methods in airline revenue management&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2013&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Lepage, Pierre-Olivier&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Civil and Environmental Engineering.&lt;/Keyword>
   	&lt;Abstract>Although many airlines offer seats in multiple cabins (economy vs. premium classes) with different service quality, previous work on airline revenue management has focused on treating the cabins separately. In this thesis, we develop several single-leg multiple cabin revenue management optimization algorithms. We extend two different single-leg separate cabin dynamic programming algorithms to the multiple cabin case, and also present three Expected Marginal Seat Revenue (EMSR) based heuristics and a dynamic programming decomposition heuristic. We then evaluate the revenue and passenger mix performance of the different algorithms using the Passenger Origin-Destination Simulator (PODS) which simulates competitive markets with passenger choice of fare options and cabin. We first test the methods in a simple single market network and then in a more realistic complex network. We find that multiple cabin methods do not lead to a systematic revenue increase. Indeed, simulation results show that the performance of the different methods ranges from a decrease of 9.6% to an increase of 2.4% in revenues. The discrepancies in performance between the different methods are explained by the trade-off between revenue gains from additional economy bookings and the losses from displaced premium passengers. Further, we observe that successful methods lead to a revenue increase by accepting additional bookings in top economy classes rather than in low economy classes. Finally, the poor performance of the dynamic programming methods tested is due to a misalignment between the underlying assumptions of the algorithms and the reality of the booking and passenger choice process.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>