Full metadata record
DC FieldValueLanguage
dc.contributor.authorWONG, JTen_US
dc.contributor.authorKOPPELMAN, FSen_US
dc.contributor.authorDASKIN, MSen_US
dc.date.accessioned2014-12-08T15:04:39Z-
dc.date.available2014-12-08T15:04:39Z-
dc.date.issued1993-02-01en_US
dc.identifier.issn0191-2615en_US
dc.identifier.urihttp://hdl.handle.net/11536/3132-
dc.description.abstractThis paper proposes a new approach to the optimal allocation of airline seats among itineraries in a network under stochastic demand. Current approaches to network seat inventory control are based on either full assignment or bucket control. Under full assignment, all seats on each flight leg are assigned to a specific single- or multi-leg itinerary. Under bucket control seats are assigned to groups of itineraries. The flexible assignment approach proposed in this paper assigns some seats exclusively to each single- or multi-leg itinerary as in fixed assignment and assigns the remaining seats to groups of itineraries as in bucket control. This paper formulates the flexible assignment approach, develops rules for optimal assignment for a single-fare-class network and proves the superiority of this approach to either fixed assignment or bucket control. A numerical simulation is used to illustrate the differences in expected revenue among these three methods of seat inventory control for four different demand scenarios.en_US
dc.language.isoen_USen_US
dc.titleFLEXIBLE ASSIGNMENT APPROACH TO ITINERARY SEAT ALLOCATIONen_US
dc.typeArticleen_US
dc.identifier.journalTRANSPORTATION RESEARCH PART B-METHODOLOGICALen_US
dc.citation.volume27en_US
dc.citation.issue1en_US
dc.citation.spage33en_US
dc.citation.epage48en_US
dc.contributor.department運輸與物流管理系 註:原交通所+運管所zh_TW
dc.contributor.departmentDepartment of Transportation and Logistics Managementen_US
dc.identifier.wosnumberWOS:A1993KN01300003-
dc.citation.woscount13-
Appears in Collections:Articles