Randomization Approaches for Network Revenue Management with Customer Choice Behavior

In this study, we present new approximation methods for the network revenue management problem with customer choice behavior. Our methods are sampling‐based and so can handle fairly general customer choice models. The starting point for our methods is a dynamic program that allows randomization. An attractive feature of this dynamic program is that the size of its action space is linear in the number of itineraries, as opposed to exponential. It turns out that this dynamic program has a structure that is similar to the dynamic program for the network revenue management problem under the so called independent demand setting. Our approximation methods exploit this similarity and build on ideas developed for the independent demand setting. We present two approximation methods. The first one is based on relaxing the flight leg capacity constraints using Lagrange multipliers, whereas the second method involves solving a perfect hindsight relaxation problem. We show that both methods yield upper bounds on the optimal expected total revenue. Computational experiments demonstrate the tractability of our methods and indicate that they can generate tighter upper bounds and higher expected revenues when compared with the standard deterministic linear program that appears in the literature.     

Assessing fairness of selfish revenue sharing mechanisms for airline alliances

Airline alliances offer flights including flight legs operated by different airlines. A major problem is how to share the revenue obtained through selling a flight ticket among the airlines in a fair way. Recently, Kimms and Çetiner [1] have proposed fair revenue allocations based on the solution concept nucleolus, which assumes that the decisions of the alliance are given centrally. However, in an alliance, each airline has a selfish behavior and tries to maximize its own revenue. The contribution of this paper is twofold. First, we provide a method to evaluate the fairness of revenue sharing mechanisms applied in a selfish setting. The method includes a simulation model for the booking process of the alliance and uses the nucleolus-based allocations as benchmark. Second, we develop a revenue sharing mechanism based on the transfer of dual prices. The fairness of the new mechanism and several other existing approaches is assessed through a numerical study.     

Bounding Optimal Expected Revenues for Assortment Optimization under Mixtures of Multinomial Logits

We consider assortment problems under a mixture of multinomial logit models. There is a fixed revenue associated with each product. There are multiple customer types. Customers of different types choose according to different multinomial logit models whose parameters depend on the type of the customer. The goal is to find a set of products to offer so as to maximize the expected revenue obtained over all customer types. This assortment problem under the multinomial logit model with multiple customer types is NP‐complete. Although there are heuristics to find good assortments, it is difficult to verify the optimality gap of the heuristics. In this study, motivated by the difficulty of finding optimal solutions and verifying the optimality gap of heuristics, we develop an approach to construct an upper bound on the optimal expected revenue. Our approach can quickly provide upper bounds and these upper bounds can be quite tight. In our computational experiments, over a large set of randomly generated problem instances, the upper bounds provided by our approach deviate from the optimal expected revenues by 0.15% on average and by less than one percent in the worst case. By using our upper bounds, we are able to verify the optimality gaps of a greedy heuristic accurately, even when optimal solutions are not available.     

A Dynamic Disaggregation Approach to Approximate Linear Programs for Network Revenue Management

The linear programming approach to approximate dynamic programming has received considerable attention in the recent network revenue management (RM) literature. A major challenge of the approach lies in solving the resulting approximate linear programs (ALPs), which often have a huge number of constraints and/or variables. Starting from a recently developed compact affine ALP for network RM, we develop a novel dynamic disaggregation algorithm to solve the problem, which combines column and constraint generation and exploits the structure of the underlying problem. We show that the formulation can be further tightened by considering structural properties satisfied by an optimal solution. We prove that the sum of dynamic bid‐prices across resources is concave over time. We also give a counterexample to demonstrate that the dynamic bid‐prices of individual resources are not concave in general. Numerical experiments demonstrate that dynamic disaggregation is often orders of magnitude faster than existing algorithms in the literature for problem instances with and without choice. In addition, adding the concavity constraints can further speed up the algorithm, often by an order of magnitude, for problem instances with choice.     

Optimal Configuration of a Service Delivery Network: An Application to a Financial Services Provider

Driven by market pressures, financial service firms are increasingly partnering with independent vendors to create service networks that deliver greater profits while ensuring high service quality. In the management of call center networks, these partnerships are common and form an integral part of the customer care and marketing strategies in the financial services industry. For a financial services firm, configuring such a call center service network entails determining which partners to select and how to distribute service requests among vendors, while incorporating their capabilities, costs, and revenue‐generating abilities. Motivated by a problem facing a Fortune 500 financial services provider, we develop and apply a novel mixed integer programming model for the service network configuration problem. Our tactical decision support model effectively accounts for the firm's costs by capturing the impact of service requirements on vendor staffing levels and seat requirements, and permits imposing call routing preferences and auxiliary service costs. We implemented the model and applied it to data from an industry partner. Results suggest that our approach can generate considerable cost savings and substantial additional revenues, while ensuring high service quality. Results based on test instances demonstrate similar savings and outperform two rule‐based methods for vendor assignment.     

Dynamic Pricing to Minimize Maximum Regret

We consider a dynamic pricing problem that involves selling a given inventory of a single product over a short, two‐period selling season. There is insufficient time to replenish inventory during this season, hence sales are made entirely from inventory. The demand for the product is a stochastic, nonincreasing function of price. We assume interval uncertainty for demand, that is, knowledge of upper and lower bounds but not a probability distribution, with no correlation between the two periods. We minimize the maximum total regret over the two periods that results from the pricing decisions. We consider a dynamic model where the decision maker chooses the price for each period contingent on the remaining inventory at the beginning of the period, and a static model where the decision maker chooses the prices for both periods at the beginning of the first period. Both models can be solved by a polynomial time algorithm that solves systems of linear inequalities. Our computational study demonstrates that the prices generated by both our models are insensitive to errors in estimating the demand intervals. Our dynamic model outperforms our static model and two classical approaches that do not use demand probability distributions, when evaluated by maximum regret, average relative regret, variability, and risk measures. Further, our dynamic model generates a total expected revenue which closely approximates that of a maximum expected revenue approach which requires demand probability distributions.     

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.     

Revenue Management vs. Newsvendor Decisions: Does Behavioral Response Mirror Normative Equivalence?

We study and compare decision‐making behavior under the newsvendor and the two‐class revenue management models, in an experimental setting. We observe that, under both problems, decision makers deviate significantly from normative benchmarks. Furthermore, revenue management decisions are consistently higher compared to the newsvendor order quantities. In the face of increasing demand variability, revenue managers increase allocations; this behavior is consistent with normative patterns when the ratio of the selling prices of the two customer segments is less than 1/2, but is its exact opposite when this ratio is greater than 1/2. Newsvendors' behavior with respect to changing demand variability, on the other hand, is consistent with normative trends. We also observe that losses due to leftovers weigh more in newsvendor decisions compared to the revenue management model; we argue that overage cost is more salient in the newsvendor problem because it is perceived as a direct loss, and propose this as the driver of the differences in behavior observed under the two problems.     

基于双层规划的反恐应急设施选址模型及算法

恐怖袭击常以人流密集地区的平民作为袭击目标，并存在突发性和随机性等特点，极易造成严重的袭击后果。通过反恐应急设施的合理布局可以缩短救援人员和物资的到达时间，从而减轻袭击后果。首先，对反恐应急设施选址问题进行描述，并将其构造为一类离散双层规划模型。其中，上层规划是关于政府选址的0-1规划问题，下层规划则是关于恐怖分子袭击目标选择的0-1规划问题。其次，结合模型和问题的特征设计算法，利用分支定界算法实现上层选址变量的隐枚举，同时通过下层问题的求解来确定上下界并判断是否满足分枝或剪枝的条件。最后，结合南疆地区的交通拓扑网络进行算例分析，结果证明有效的选址方案可以大大降低袭击损失。     

Optimal Dynamic Upgrading in Revenue Management

We consider a revenue management problem involving a two compartment aircraft flying a single leg, with no cancellations or over‐booking. We apply the practice of transforming a choice revenue management model into an independent demand model. Within this assumed independent model, there are two sets of demands, business and economy, each with multiple fare class products. A business passenger can only be accepted into business. An economy passenger can be accepted into economy or upgraded into business. We define a two‐dimensional dynamic program (DP) and show that the value function is sub‐modular and concave in seat availability in the two compartments. Thus the bid prices are non‐decreasing with respect to these state variables. We use this result to propose an exact algorithm to solve the DP. Our numerical investigation suggests that in contrast to standard backward induction, our method could be included in production revenue management systems. Further, when the economy compartment is capacity constrained, we observe a substantial monetary benefit from optimal dynamic upgrading compared to the static upgrading procedures currently used in practice.     

Allocation of Returned Products among Different Recovery Options through an Opportunity Cost–Based Dynamic Approach*

In a make‐to‐order product recovery environment, we consider the allocation decision for returned products decision under stochastic demand of a firm with three options: refurbishing to resell, parts harvesting, and recycling. We formulate the problem as a multiperiod Markov decision process (MDP) and present a linear programming (LP) approximation that provides an upper bound on the optimal objective function value of the MDP model. We then present two solution approaches to the MDP using the LP solution: a static approach that uses the LP solution directly and a dynamic approach that adopts a revenue management perspective and employs bid‐price controls technique where the LP is resolved after each demand arrival. We calculate the bid prices based on the shadow price interpretation of the dual variables for the inventory constraints and accept a demand if the marginal value is higher than the bid price. Since the need for solving the LP at each demand arrival requires a very efficient solution procedure, we present a transportation problem formulation of the LP via variable redefinitions and develop a one‐pass optimal solution procedure for it. We carry out an extensive numerical analysis to compare the two approaches and find that the dynamic approach provides better performance in all of the tested scenarios. Furthermore, the solutions obtained are within 2% of the upper bound on the optimal objective function value of the MDP model.     

考虑长期运力合同的班轮收益管理运输路径优化模型

基于收益管理的方法,文章对随机需求环境下班轮运力分配和路径优化问题进行了定量研究。首先针对海运收益管理的特征,建立了考虑长期运力合同、空箱调运的轮运力分配和路径选择随机规划模型,然后应用稳健优化方法对此模型进行求解。最后,通过数值仿真得到了优化的舱位分配方案,比较发现稳健优化模型取得了较确定性规划模型更好的收益,显示了模型和方法对于集装箱海运企业的收益管理问题具有应用价值。     

考虑空箱调运的集装箱海运收益管理能力分配优化模型

文章基于收益管理的思想对面临不确定需求的海运集装箱能力分配问题进行了定量研究。首先描述了集装箱海运收益管理问题与航空客运收益管理的差异,接着建立了考虑和不考虑空箱调运的海运集装箱能力分配随机规划模型,并应用稳健优化方法对模型进行求解,最后通过数值仿真,说明了模型和求解方法对于海运集装箱运输企业的收益管理问题具有重要的应用价值。     

Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters

We consider assortment optimization problems under the multinomial logit model, where the parameters of the choice model are random. The randomness in the choice model parameters is motivated by the fact that there are multiple customer segments, each with different preferences for the products, and the segment of each customer is unknown to the firm when the customer makes a purchase. This choice model is also called the mixture‐of‐logits model. The goal of the firm is to choose an assortment of products to offer that maximizes the expected revenue per customer, across all customer segments. We establish that the problem is NP complete even when there are just two customer segments. Motivated by this complexity result, we focus on assortments consisting of products with the highest revenues, which we refer to as revenue‐ordered assortments. We identify specially structured cases of the problem where revenue‐ordered assortments are optimal. When the randomness in the choice model parameters does not follow a special structure, we derive tight approximation guarantees for revenue‐ordered assortments. We extend our model to the multi‐period capacity allocation problem, and prove that, when restricted to the revenue‐ordered assortments, the mixture‐of‐logits model possesses the nesting‐by‐fare‐order property. This result implies that revenue‐ordered assortments can be incorporated into existing revenue management systems through nested protection levels. Numerical experiments show that revenue‐ordered assortments perform remarkably well, generally yielding profits that are within a fraction of a percent of the optimal.     

不完全信息下多阶段移动应用产品与服务合作的可更新契约

考虑不完全信息下由提供移动应用产品与服务的ERP厂商、APP厂商与客户企业组成的产品服务供应链,针对ERP厂商与APP厂商产品服务合作中存在的逆向选择与道德风险问题,构建两阶段的动态博弈模型,分析了APP厂商隐藏与披露能力信息对产品与服务质量、供应链系统绩效与ERP厂商利润的影响,提出了信息披露、收益共享的单阶段契约与存在契约变更的两阶段契约激励策略,比较了两种契约的价值。研究表明：通过在产品开发阶段观察APP厂商的契约菜单选择以及获得的产品质量信息,甄别APP厂商的能力信息,在服务阶段进行契约变更,有利于提高产品与服务质量,降低ERP厂商风险,使供应链系统利润与ERP厂商自身利润实现帕累托改善。最后,通过算例对研究结论进行了直观考察和说明。     

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.     

Penalizing passenger’s transfer time in computing airlines revenue

Airline strategic alliances result in a form of cooperation where firms can access the resources of others network members in order to create added value for their passengers. The shortcoming of this process is that each member of the network makes individual revenue management decisions to maximize its own income, resulting in a sub-optimal income for the network members.To deal with this problem, this paper suggests a resource allocation based on a transfer pricing mechanism, to cooperatively divide the revenue of a passenger between network members. The method penalizes the total time that a passenger takes for reaching the final destination. The model takes into consideration that the profit is independent of the number of available seats (with a maximum determined for each airline). The method computes the optimal transfer pricing and, at the same time, optimizes the quantity of seats (the booking limits). The solution results in a strong Nash equilibrium, which incorporate both the transfer prices and booking limits. We describe the transfer pricing process using an ergodic, finite and continuous-time Markov game model for multiple players. The revenue of each airline in the supply chain will depend on the number of flight transfers and the transit time of the passenger at the airports: the longer the time to the final destination, the lower the price. We compute a collaborative equilibrium point, useful for understanding the resulting revenue of each member of the network. For solving the game, we employ an iterative method based on a proximal approach that involves time penalization. In our final contribution, we present results from a numerical example, which validates the proposed Markov game model and measures the benefits of the transfer pricing resource allocation.     

资产负债管理多阶段模型及应用

本文根据我国实际情况,考虑未来各种经济因素的不确定性,建立了资产负债管理问题多阶段随机优化模型.对基金公司的多阶段资产配置问题、个人财务计划问题、银行资产负债管理问题以及养老金问题进行研究,针对每一个具体问题对目标函数和约束条件进行了调整和改进.对未来不确定的经济因素采用向量自回归方法进行预测,得到了最优资产配置,使得与负债选择和投资者财富相联系的资产投资决策通过多期随机规划达到最优.     

航空客运舱位控制和超售综合静态建模研究

本文研究航空运输收益管理的舱位控制和超售综合静态建模问题.通过将机票销售过程模拟成排队过程,以收益最大化为目标函数,首先给出了单航段单等级票价下的超售水平公式.然后将该思路推广到多等级票价情况,应用动态规划方法建立了舱位控制和超售综合控制静态模型,在建立了两个定理的基础上,由该模型进一步推导出了各等级舱位最优订座限制的决策方程.最后分析了一个实例以说明决策方程的应用.     

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.