共查询到20条相似文献,搜索用时 15 毫秒
1.
Yingjie Lan Michael O. Ball Itir Z. Karaesmen Jean X. Zhang Gloria X. Liu 《European Journal of Operational Research》2015
We investigate a single-leg airline revenue management problem where an airline has limited demand information and uncensored no-show information. To use such hybrid information for simultaneous overbooking and booking control decisions, we combine expected overbooking cost with revenue. Then we take a robust optimization approach with a regret-based criterion. While the criterion is defined on a myriad of possible demand scenarios, we show that only a small number of them are necessary to compute the objective. We also prove that nested booking control policies are optimal among all deterministic ones. We further develop an effective computational method to find the optimal policy and compare our policy to others proposed in the literature. 相似文献
2.
Dong Ling Han Loon Ching Tang Huei Chuen Huang 《European Journal of Operational Research》2010,200(3):412
In this paper, we consider the capacity allocation problem in single-leg air cargo revenue management. We assume that each cargo booking request is endowed with a random weight, volume and profit rate and propose a Markovian model for the booking request/acceptance/rejection process. The decision on whether to accept the booking request or to reserve the capacity for future bookings follows a bid-price control policy. In particular, a cargo will be accepted only when the revenue from accepting it exceeds the opportunity cost, which is calculated based on bid prices. Optimal solutions are derived by maximizing a reward function of a Markov chain. Numerical comparisons between the proposed approach and two existing static single-leg air cargo capacity allocation policies are presented. 相似文献
3.
To formulate stochastic capacity allocation problems in a manufacturing system, the concept and techniques of revenue management is applied in this research. It is assumed the production capacity is stochastic and hence its exact size cannot be forecasted in advance, at the time of planning. There are two classes of “frequent” and “occasional” customers demanding this capacity. The price rate as well as the penalty for order cancellation caused by overbooking is different for each class. The model is developed mathematically and we propose an analytical solution method. The properties of the optimal solution as well as the behavior of objective function are also analyzed. The objective function is not concave, in general. However, we prove it is a unimodal function and by taking advantage of this property, the optimal solution is determined. 相似文献
4.
We study a network airline revenue management problem with discrete customer choice behavior. We discuss a choice model based on the concept of preference orders, in which customers can be grouped according to a list of options in decreasing order of preference. If a customer’s preferred option is not available, the customer moves to the next choice on the list with some probability. If that option is not available, the customer moves to the third choice on the list with some probability, and so forth until either the customer has no other choice but to leave or his/her request is accepted. Using this choice model as an input, we propose some mathematical programs to determine seat allocations. We also propose a post-optimization heuristic to refine the allocation suggested by the optimization model. Simulation results are presented to illustrate the effectiveness of our method, including comparisons with other models. 相似文献
5.
Classical vehicle routing problems typically do not consider the impact of delivery price on the demand for delivery services. Existing models seek the minimum sum of tour lengths in order to serve the demands of a given set of customers. This paper proposes approximation models to estimate the impacts of price on delivery services when demand for delivery service is price dependent. Such models can serve as useful tools in the planning phase for delivery service providers and can assist in understanding the economics of delivery services. These models seek to maximize profit from delivery service, where price determines demand for deliveries as well as the total revenue generated by satisfying demand. We consider a variant of the model in which each customer’s delivery volume is price sensitive, as well as the case in which customer delivery volumes are fixed, but the total number of customers who select the delivery service provider is price sensitive. A third model variant allows the delivery service provider to select a subset of delivery requests at the offered price in order to maximize profit. 相似文献
6.
This paper focuses on detecting nuclear weapons on cargo containers using port security screening methods, where the nuclear weapons would presumably be used to attack a target within the United States. This paper provides a linear programming model that simultaneously identifies optimal primary and secondary screening policies in a prescreening-based paradigm, where incoming cargo containers are classified according to their perceived risk. The proposed linear programming model determines how to utilize primary and secondary screening resources in a cargo container screening system given a screening budget, prescreening classifications, and different device costs. Structural properties of the model are examined to shed light on the optimal screening policies. The model is illustrated with a computational example. Sensitivity analysis is performed on the ability of the prescreening in correctly identifying prescreening classifications and secondary screening costs. Results reveal that there are fewer practical differences between the screening policies of the prescreening groups when prescreening is inaccurate. Moreover, devices that can better detect shielded nuclear material have the potential to substantially improve the system’s detection capabilities. 相似文献
7.
Cost effectiveness is central to the air freight forwarders. In this work, we study how an air freight forwarder should plan its cargo loading in order to minimize the total freight cost given a limited number of rented containers. To solve the problem efficiently for practical implementation, we propose a new large-scale neighborhood search heuristic. The proposed large-scale neighborhood relaxes the subset-disjoint restriction made in the existing literature; the relaxation risks a possibility of infeasible exchanges while at the same time it avoids the potentially large amount of checking effort required to enforce the subset-disjoint restriction. An efficient procedure is then used to search for improvement in the neighborhood. We have also proposed a subproblem to address the difficulties caused by the fixed charges. The compromised large-scale neighborhood (CLSN) search heuristic has shown stably superior performance when compared with the traditional large-scale neighborhood search and the mixed integer programming model. 相似文献
8.
In many service industries, firms offer a portfolio of similar products based on different types of resources. Mismatches between demand and capacity can therefore often be managed by using product upgrades. Clearly, it is desirable to consider this possibility in the revenue management systems that are used to decide on the acceptance of requests. To incorporate upgrades, we build upon different dynamic programming formulations from the literature and gain several new structural insights that facilitate the control process under certain conditions. We then propose two dynamic programming decomposition approaches that extend the traditional decomposition for capacity control by simultaneously considering upgrades as well as capacity control decisions. While the first approach is specifically suited for the multi-day capacity control problem faced, for example, by hotels and car rental companies, the second one is more general and can be applied in arbitrary network revenue management settings that allow upgrading. Both approaches are formally derived and analytically related to each other. It is shown that they give tighter upper bounds on the optimal solution of the original dynamic program than the well-known deterministic linear program. Using data from a major car rental company, we perform computational experiments that show that the proposed approaches are tractable for real-world problem sizes and outperform those disaggregated, successive planning approaches that are used in revenue management practice today. 相似文献
9.
M. Graf A. Kimms 《European Journal of Operational Research》2011,215(2):459-469
An airline has to decide whether to accept an incoming customer request for a seat in the airplane or to reject it in hope that another customer will request the seat later at a higher price. Capacity control, as one of the instruments of revenue management, gives a solution to this decision problem. In the presence of strategic alliances capacity control changes. For the case of two airlines in the alliance and a single flight leg we propose an option-based capacity control process. The determination of booking limits for capacity control is done with real options. A simulation model is introduced to evaluate the booking process of the partner airlines within the strategic alliance, considering the option-based procedure. In an iterative process the booking limits are improved with simulation-based optimization. The results of the option-based procedure will be compared with the results of the simulation-based optimization, the results of a first-come-first-served (FCFS) approach and ex post optimal solutions. 相似文献
10.
We present a single-resource finite-horizon Markov decision process approach for a firm that seeks to maximize expected revenues by dynamically adjusting the menu of offered products and their prices to be selected from a finite set of alternative values predetermined as a matter of policy. Consumers choose among available products according to an attraction choice model, a special but widely applied class of discrete choice models. 相似文献
11.
Approximate nucleolus-based revenue sharing in airline alliances 总被引:1,自引:0,他引:1
Alliances allow the airlines to extend their networks and increase the number of destinations they can access. Different from the traditional single airline approach, in an alliance, partner airlines may sell tickets for the same itinerary. In addition, one itinerary may consist of several flight legs, each of which may be operated by a different airline. A major issue that needs to be addressed is how to share the revenue generated from selling a ticket for a product among the individual airlines in a fair way. The fair allocation of the revenue has a critical importance for the long-term stability of the alliance. We model the problem as a cooperative game and show that the core of the game is non-empty. We propose to use a revenue proration scheme based on the concept of the nucleolus. The numerical studies reveal that the revenue shares can effectively be computed even for large alliance networks. 相似文献
12.
We consider a retailer selling a fixed inventory of two perishable products over a finite horizon. Assuming Poisson arrivals and a bivariate reservation price distribution, we determine the optimal product and bundle prices that maximize the expected revenue. Our results indicate that the performances of mixed bundling, pure bundling and unbundled sales strategies heavily depend on the parameters of the demand process and the initial inventory levels. Bundling appears to be most effective with negatively correlated reservation prices and high starting inventory levels. When the starting inventory levels are equal and in excess of average demand, most of the benefits of bundling can be achieved through pure bundling. However, the mixed bundling strategy dominates the other two when the starting inventory levels are not equal. We also observe that an incorrect modeling of the reservation prices may lead to significant losses. The model is extended to allow for price changes during the selling horizon. It is shown that offering price bundles mid-season may be more effective than changing individual product prices. 相似文献
13.
We model a supply chain consisting of an author, a publisher, a physical bookstore (p-bookstore), and an electronic bookstore (e-bookstore). We employ game theory to examine and compare two types of pricing models of electronic books (e-books): wholesale model and agency model. Furthermore, we consider decentralized and horizontally centralized channels. The p-bookstore and e-bookstore are independent in the former but centralized in the latter. We adopt a simplified linear demand model to study when the publisher and the e-bookstore both benefit from the agency model. We find that a Pareto zone where both the publisher and e-bookstore benefit from the agency model always exists in the decentralized channels. In the agency model, the benefit from e-book sales may be more than the loss in physical book (p-book) sales. By contrast, a Pareto zone exists in the horizontally centralized channels if the wholesale price of p-books is not excessively low and the price elasticity is not extremely large. To check the robustness of our results, we relax model assumptions and conduct numerical studies in the Pareto zone to investigate how various parameters, such as authors royalty rate, affect profit improvement and readers welfare. We show that the publisher and bookstore have great potentials for profit improvement in the Pareto zone. Significant improvement is also observed in readers welfare. 相似文献
14.
为解决市场需求不确定环境下,酒店和在线旅行网站(Online Travel Agency,OTA)合作时的能力超订量与在线房间预留量的决策问题,建立了基于佣金合作模式的数学模型,给出了实现酒店整体期望收益最大化的在线房间预留量与能力超订量。借助数值分析,进一步研究了佣金率与需求不确定性对最优决策的影响。结果表明,当佣金率与门店需求不确定性较小时,酒店采取双渠道策略并且实施超订;当佣金率与门店需求不确定性很大时,酒店采取门店单渠道策略但不实施超订。另外,在线房间预留量随着佣金率、门店需求不确定性的增大而减小。 相似文献
15.
Alper Şen 《Operations Research Letters》2013,41(5):530-534
We consider the problem of selling a fixed stock of items over a finite horizon when the buyers arrive following a Poisson process. We obtain a general lower bound on the performance of using a fixed price rather than dynamically adjusting the price. The bound is 63.21% for one unit of inventory, and it improves as the inventory increases. For the one-unit case, we also obtain tight bounds: 89.85% for the constant-elasticity and 96.93% for the linear price-response functions. 相似文献
16.
In this paper we consider a dynamic pricing model for a firm knowing that a competitor adopts a static pricing strategy. We establish a continuous time model to analyze the effect of dynamic pricing on the improvement in expected revenue in the duopoly. We assume that customers arrive to purchase tickets in accordance with a geometric Brownian motion. We derive an explicit closed-form expression for an optimal pricing policy to maximize the expected revenue. It is shown that when the competitor adopts a static pricing policy, dynamic pricing is not always effective in terms of maximizing expected revenue compared to a fixed pricing strategy. Moreover, we show that the size of the reduction in the expected revenue depends on the competitor’s pricing strategy. Numerical results are presented to illustrate the dynamic pricing policy. 相似文献
17.
《Operations Research Letters》2019,47(5):377-385
I consider a worker’s optimal per-unit-time pricing problem on an on-demand service platform. I establish that if the customer arrival process is Poisson, then any price discrimination must result only from differences in the customers’ willingness-to-pay distributions, and not from differences in their arrival or service-time characteristics. For multiple customer classes that differ in their willingness-to-pay distributions, I present a simple procedure to compute the optimal prices. Finally, I analyze price competition across workers in the presence of reputation effects. 相似文献
18.
Low-cost providers have emerged as important players in many service industries, the most predominant being low-cost, or the so-called discount airlines. This paper presents models and results leading toward understanding the revenue management outlook for a discount pricing firm. A framework and model is formulated specifically for the airline industry, but is generalizable to low-cost providers in similar revenue management settings. We formulate an optimal pricing control model for a firm that must underprice to capture a segment of exogenous demand. Two specific model formulations are considered: a continuous deterministic version, and a discrete stochastic version. Structural results are derived for the deterministic case, providing insight into the general form of optimal underpricing policies. The stochastic results support the structural insight from the deterministic solution, and illuminate the effect of randomness on the underpricing policies. 相似文献
19.
20.
For network revenue management problems, it is known that the bid prices computed through the so-called deterministic linear program are asymptotically optimal as the capacities on the flight legs and the expected numbers of product requests increase linearly with the same rate. In this paper, we show that the same asymptotic optimality result holds for the bid prices computed through the so-called randomized linear program. We computationally investigate how the performance of the randomized linear program changes with different problem parameters and with the number of samples. The hope is that our asymptotic optimality result and computational experiments will raise awareness for the randomized linear program, which has yet not been popular in the research community or industry. 相似文献