A Comparative Revenue Analysis of Hotel Yield Management Heuristics

Yield management is the dynamic pricing, overbooking, and allocation of perishable assets across market segments in an effort to maximize short-term revenues for the firm. Numerous optimization heuristics for allocation and overbooking exist for the airline industry, whose perishable asset is the airplane seat. When an airplane departs, no revenue is gained from the empty seat(s). In the hotel industry, the perishable asset is the hotel room-once a room is left empty for a night, that night's revenue cannot be recaptured. The literature on yield management heuristics for the hotel industry is sparse. For the hotel operating environment, no research has adequately (1) integrated overbooking with allocation, (2) modeled the phenomenon of hotel patrons extending or contracting their stay at a moment's notice, or (3) performed a realistic performance comparison of alternative heuristics. This research develops (1) two hotel-specific algorithms that both integrate overbooking with the allocation decisions, (2) a simulation model to reproduce realistic hotel operating environments, and (3) compares the performance of five heuristics under 36 realistic hotel operating environments. Seven conclusions are reached with regard to which heuristic(s) perform best in specific operating environments. Generally, heuristic selection is very much dependent on the hotel operating environment. A counterintuitive result is that in many operating environments, the simpler heuristics work as well as the more complex ones.     

酒店收益管理的研究进展与前景

对酒店收益管理的内涵进行了讨论,从六个方面介绍了酒店收益管理的应用特征,归纳 分析了酒店收益管理的常用研究方法. 基于酒店收益管理(包括需求预测、超量预订、客房分配 和定价等) 研究进展的介绍与分析,指出了酒店收益管理的研究发展方向.     

基于收益管理的邮轮客舱分配与定价模型

基于收益管理的思想对邮轮客舱分配与定价问题进行了研究。结合邮轮运营中的个性化特点，例如消费者团体人员构成多样、较长的预售周期以及救生位和儿童看护人员的数量限制等。在不失一般性的前提下，建立了整数规划模型用以确定在预售周期内的不同预售阶段中各种客舱类型的待售数量及其价格，以达到使邮轮公司收益最大化的目的。实验分析表明，该模型在实际应用中是有效的且呈现出显著的年增长趋势，可明显提高邮轮公司的收益。此外，设计了一种基于韦伯分布的EM算法用以解决模型中涉及到的需求量的无约束估计问题。数值算例研究表明，该算法收敛速度快且无约束估计过程可靠有效。     

Increasing the Revenue of Self‐Storage Warehouses by Facility Design

Self‐storage is a booming industry. Both private customers and companies can rent temporary space from such facilities. The design of self‐storage warehouses differs from other facility designs in its focus on revenue maximization. A major question is how to design self‐storage facilities to fit market segments and accommodate volatile demand to maximize revenue. Customers that cannot be accommodated with a space size of their choice can be either rejected or upscaled to a larger space. Based on data of 54 warehouses in America, Europe, and Asia, we propose a new facility design approach with models for three different cases: an overflow customer rejection model and two models with customer upscale possibilities, one with reservation and another without reservation. We solve the models for several real warehouse cases, and our results show that the existing self‐storage warehouses can be redesigned to generate larger revenues for all cases. Finally, we show that the upscaling policy without reservation generally outperforms the upscaling policy with reservation.     

Improving Revenue Management Decision Making for Airlines by Evaluating Analyst‐Adjusted Passenger Demand Forecasts*

To maximize revenue, airline revenue management analysts (RMAs) attempt to protect the right number of seats for late‐booking, high‐revenue‐generating passengers from low‐valued leisure passengers. Simulation results in the past showed that a major airline can generate approximately $500 million per year through efficient RM operations. Accurate passenger demand forecasts are required, because reduced forecast error significantly improves revenue. RMAs often adjust the system forecasts to improve revenue opportunity. Analysis of system forecast performance and analyst adjustment is complex, because one must account for all unseen demands throughout the life of a flight. This article proposes a method to account for unseen demand and evaluate forecast performance (adjusted or unadjusted) through a forecast monitoring system. Initial results from one major airline's origin‐destination market data justify the value of RMA forecasting adjustments.     

The Usage of Opportunity Cost to Maximize Performance in Revenue Management*

To meet customer requirements efficiently, a manager needs to supply adequate quantities of products, capacity, or services at the right time with the right prices. Revenue management (RM) techniques can help firms use differential pricing strategies and capacity allocation tactics to maximize revenue. In this article, we propose a marginal revenue‐based capacity management (MRBCM) model to manage stochastic demand in order to create improved revenue opportunities. The new heuristic employs opportunity cost estimation logic that is unique and is the reason for the increased performance. The MRBCM model generates order acceptance policies that allocate available capacity to higher revenue generating market segments in both service and manufacturing environments. To evaluate these models, we design and conduct simulation experiments for 64 scenarios using a wide range of operating conditions. The experimental results show that the MRBCM model generates significantly higher revenues over the first come, first served rule when capacity is tight. In addition, we also show that the MRBCM model generally performs better than a recent RM model published in the literature.     

不确定需求情境下的供应链预测契约设计

以报童模型为基础,研究了在由单一生厂商和零售商组成的供应链系统中,生产商如何通过契约设计来影响零售商的需求预测行为,使其收益最大化的问题。文章基于静态博弈模型对此问题进行了分析,发现在整合供应链情境下,当需求预测成本较小时选择预测能够获得更高的期望收益;在分散式供应链情境下,当生产商选择预测契约时,预测成本最终由生产商承担,且其期望收益为预测成本的减函数,而选择无预测契约时则为预测成本的非减函数;最后通过生产商期望收益对比,给出了最优策略。     

Revenue Management for Intermodal Transportation: The Role of Dynamic Forecasting

We study a joint capacity leasing and demand acceptance problem in intermodal transportation. The model features multiple sources of evolving supply and demand, and endogenizes the interplay of three levers—forecasting, leasing, and demand acceptance. We characterize the optimal policy, and show how dynamic forecasting coordinates leasing and acceptance. We find (i) the value of dynamic forecasting depends critically on scarcity, stochasticity, and volatility; (ii) traditional mean‐value equivalence approach performs poorly in volatile intermodal context; (iii) mean‐value‐based forecast may outperform stationary distribution‐based forecast. Our work enriches revenue management models and applications. It advances our understanding on when and how to use dynamic forecasting in intermodal revenue management.     

Pricing,Allocation, and Overbooking in Dynamic Service Network Competition When Demand Is Uncertain

We study the problem of combined pricing, resource allocation, and overbooking by service providers involved in dynamic noncooperative oligopolistic competition on a network that represents the relationships of the providers to one another and to their customers when service demand is uncertain. We propose, analyze, and compute solutions for a model that is more general than other models reported in the revenue management literature to date. In particular, previous models typically consider only three or four of five key revenue management features that we have purposely built into our model: (1) pricing, (2) resource allocation, (3) dynamic competition, (4) an explicit network, and (5) uncertain demand. Illustrative realizations of the abstract problem we study are those of airline revenue management and service provision by companies facing resource constraints. Under fairly general regularity conditions, we prove existence and uniqueness of a pure strategy Nash equilibrium for dynamic oligopolistic service network competition described by our model. We also show, for an appropriate notion of regularity, that competition leads to the underpricing of network services, a finding numerically illustrated by an example of intermediate size. Our proposed algorithm can be implemented using well‐known off‐the‐shelf commercial software.     

Dynamic pricing and revenue management process in Internet retailing under uncertainty: An integrated real options approach

Competition and demand volatility often cause modern enterprises to be confronted by uncertain environments. When a firm manages revenue in such competitive and risky environments, the optimization of pricing and capacity allocation, subject to a fixed time and capacity, becomes a complicated problem. Many previous papers concerning revenue management (RM) and pricing require that the firm possesses the ability to know the demand curve (or demand distribution) and set prices on it to maximize profits. However, this assumption may not be the case in some industries. Therefore, this paper focuses on the dynamic lead indicators rather than assumptive lag indicators to establish a concise and flexible decision model for practical use. This paper provides an integrated real options (IRO) approach with analytic hierarchy process (AHP) for the auction RM problem under competitive/dynamic pricing and revenue uncertainty in Internet retailing. A numerical example is also presented to illustrate that the IRO approach can generate better decisions than the naı¨ve (or risk unawareness) approach in revenue quality of safety and profitability. The new perspective and approach proposed by this paper can be extended to other RM fields whenever both profitability and risk are critical to decision making.     

大规模客运专线网络运营优化模型与求解算法

本文在分析铁路运营优化模型的研究进展的基础上,提出了一个适合大规模客运专线网络运营的优化模型,并提出了求解此模型的列生成算法和启发式快速算法。目的是将客运专线网路的开行方案优化与动态收益优化问题结合起来,解决更大、更复杂的客运网络运营优化问题。模型以列车运营总收益最大化为目标。用随机生成数据进行的模型试验表明,模型及算法可以在较短的时间内求解较大规模的收益管理优化问题。     

考虑服务约束的第三方仓库收益与设计优化模型

第三方仓库作为服务提供商, 主要以期望收益最大化为目标, 但是必须满足一定的顾客服务标准。针对高需求环境, 考虑顾客服务水平约束, 提出了一个基于排队论的随机设计优化模型以使仓库的期望收益最大化。采用动态优化算法对模型求解, 选取实例进行了数值实验。结果显示, 模型的优化设计显著地提高了高需求环境下该第三方仓库的期望收益。在此基础上, 找到了服务约束的可行范围和有效范围, 为决策者制定服务标准提供了依据。     

Pareto‐Improving Contracts for Express Package Delivery Services

We address the problem of an express package delivery company in structuring a long‐term customer contract whose terms may include prices that differ by day‐of‐week and by speed‐of‐service. The company traditionally offered speed‐of‐service pricing to its customers, but without day‐of‐week differentiation, resulting in customer demands with considerable day‐of‐week seasonality. The package delivery company hoped that using day‐of‐week and speed‐of‐service price differentiation for contract customers would induce these customers to adjust their demands to become counter‐cyclical to the non‐contract demand. Although this usually cannot be achieved by pricing alone, we devise an approach that utilizes day‐of‐week and speed‐of‐service pricing as an element of a Pareto‐improving contract. The contract provides the lowest‐cost arrangement for the package delivery company while ensuring that the customer is at least as well off as he would have been under the existing pricing structure. The contract pricing smoothes the package delivery company's demand and reduces peak requirements for transport capacity. The latter helps to decrease capital costs, which may allow a further price reduction for the customer. We formulate the pricing problem as a biconvex optimization model, and present a methodology for designing the contract and numerical examples that illustrate the achievable savings.     

A Comparison of Unconstraining Methods to Improve Revenue Management Systems

Asuccessful revenue management system requires accurate demand forecasts for each customer segment. The forecasts are used to set booking limits for lower value customers to ensure an adequate supply for higher value customers. The very use of booking limits, however, constrains the historical demand data needed for an accurate forecast. Ignoring this interaction leads to substantial penalties in a firm's potential revenues. We review existing unconstraining methods and propose a new method that includes some attractive properties not found in the existing methods. We evaluate several of the common unconstraining methods against our proposed method by testing them on intentionally constrained simulated data. Results indicate our proposed method outperforms other methods in two of three data sets. We also test the revenue impact of our proposed method, expectation maximization (EM), and “no unconstraining” on actual booking data from a hotel/casino. We show that performance varies with the initial starting protection limits and a lack of unconstraining leads to significant revenue losses.     

Demand Growth in Services: A Discrete Choice Analysis of Customer Preferences and Online Selling

The selling of perishable services (e.g., hotel rooms, airline seats, and rental cars) online is increasingly popular with both retailers and consumers. Among the innovative approaches to online sales is opaque selling. First popularized by Priceline.com's name‐your‐own‐price model, opaque selling hides some attributes of the service (notably, brand and specific location) until after the purchase decision, in exchange for a discounted price. This means that a branded “product” is being sold as somewhat of a commodity, but the brand “name” is protected by the opaque model. The attraction of this model for retailers is that they are presumably able to increase their revenue stream, albeit at a lower rate, by selling rooms that otherwise would remain in inventory. In this article, we outline the development and analysis of an online choice survey to understand consumer preferences among three types of online distribution channels: regular full information sales channels, and opaque sales channels with or without consumer bidding. A Multinomial Logit model is employed to analyze the data and measure the consumer trade‐offs between price and other attributes of the product. We use the estimated model to calculate the incremental demand and revenue created by using an opaque channel simultaneously with regular full information channels. On balance, we find that correctly priced opaque channels can add to hotels revenue streams without undue cannibalization of regular room sales.     

Robust Resource Allocation Decisions in Resource‐Constrained Projects*

The well‐known deterministic resource‐constrained project scheduling problem involves the determination of a predictive schedule (baseline schedule or pre‐schedule) of the project activities that satisfies the finish–start precedence relations and the renewable resource constraints under the objective of minimizing the project duration. This baseline schedule serves as a baseline for the execution of the project. During execution, however, the project can be subject to several types of disruptions that may disturb the baseline schedule. Management must then rely on a reactive scheduling procedure for revising or reoptimizing the baseline schedule. The objective of our research is to develop procedures for allocating resources to the activities of a given baseline schedule in order to maximize its stability in the presence of activity duration variability. We propose three integer programming–based heuristics and one constructive procedure for resource allocation. We derive lower bounds for schedule stability and report on computational results obtained on a set of benchmark problems.     

Restaurant Revenue Management at Chevys: Determining the Best Table Mix

Revenue management has been used in a variety of industries and generally takes the form of managing demand by manipulating length of customer usage and price. Supply mix is rarely considered, although it can have considerable impact on revenue. In this research, we focused on developing an optimal supply mix, specifically on determining the supply mix that would maximize revenue. We used data from a Chevys restaurant, part of a large chain of Mexican restaurants, in conjunction with a simulation model to evaluate and enumerate all possible supply (table) mixes. Compared to the restaurant's existing table mix, the optimal mix is capable of handling a 30% increase in customer volume without increasing waiting times beyond their original levels. While our study was in a restaurant context, the results of this research are applicable to other service businesses.     

Pricing and Operational Performance in Discretionary Services

In many services, for example, website or landscape design, the value or quality derived by a customer depends upon the service time, and this valuation differs across customers. Customers procure the service based on the expected value to be delivered, prices charged, and the timeliness of service. We investigate the performance of the optimal pricing scheme as well as two commonly used pricing schemes (fixed fee and time‐based pricing) for such services on important dimensions such as revenue, demand served, and utilization. We propose a novel model that captures the above features and wherein both service rate and demand are endogenous and functions of the pricing scheme. In particular, service time is an outcome of the pricing scheme adopted and the heterogeneous valuations of customers, unlike in the queueing‐based pricing literature. We find that the service system may benefit from a greater variance in consumer valuations, and the performance of pricing schemes is impacted by the shape of the distribution of customers' valuation of service time and the responsiveness desired by customers. Both the fixed fee and time‐based schemes do well relative to the optimal pricing scheme in terms of revenue in many plausible scenarios, but there are substantial differences between the pricing schemes in some important operational metrics. For instance, the fixed fee scheme serves more customers and has higher utilization than the time‐based scheme. We also explore variants of the fixed and time‐based schemes that have better revenue performance and show that the two‐part tariff which is a combination of fixed and time‐based pricing can do as well as the optimal scheme in terms of revenue.     

Coordinated Contract Decisions in a Make‐to‐Order Manufacturing Supply Chain: A Stochastic Programming Approach

One of the important objectives of supply chain S&OP (Sales and Operations Planning) is the profitable alignment of customer demand with supply chain capabilities through the coordinated planning of sales, production, distribution, and procurement. In the make‐to‐order manufacturing context considered in this paper, sales plans cover both contract and spot sales, and procurement plans require the selection of supplier contracts. S&OP decisions also involve the allocation of capacity to support sales plans. This article studies the coordinated contract selection and capacity allocation problem, in a three‐tier manufacturing supply chain, with the objective to maximize the manufacturer's profitability. Using a modeling approach based on stochastic programming with recourse, we show how these S&OP decisions can be made taking into account economic, market, supply, and system uncertainties. The research is based on a real business case in the Oriented Strand Board (OSB) industry. The computational results show that the proposed approach provides realistic and robust solutions. For the case considered, the planning method elaborated yields significant performance improvements over the solutions obtained from the mixed integer programming model previously suggested for S&OP.     

Strategic Management of Distressed Inventory

It is well known that maximizing revenue from a fixed stock of perishable goods may require discounting prices rather than allowing unsold inventory to perish. This behavior is seen in industries ranging from fashion retail to tour packages and baked goods. A number of authors have addressed the markdown management problem in which a seller seeks to determine the optimal sequence of discounts to maximize the revenue from a fixed stock of perishable goods. However, merchants who consistently use markdown policies risk training customers to “wait for the sale.” We investigate models in which the decision to sell inventory at a discount will change the future expectations of customers and hence their buying behavior. We show that, in equilibrium, a single‐price policy is optimal if all consumers are strategic and demand is known to the seller. Relaxing any of these conditions can lead to a situation in which a two‐price markdown policy is optimal. We show using numerical simulation that if customers update their expectations of availability over time, then optimal sales limit policies can evolve in a complex fashion.