Revenue management for a supply chain with two streams of customers

In this paper, we consider revenue management for a service supply chain with one supplier and one retailer. The supplier has a limited capacity of a perishable product and both the supplier and the retailer face customers. Each customer may choose to buy a product from either the supplier or the retailer by considering prices and the cost associated with switching. For the centralized model, the supplier determines the selling prices for both herself and the retailer, and the retailer simply collects a commission fee for each product sold. We derive monotone properties for the revenue functions and pricing strategies. Further, we show that the commission fee increases the retailer’s price while decreasing the supplier’s and leads to efficiency loss of the chain. For the decentralized decision-making model, the supplier and the retailer compete in price over time. Two models are considered. In the first, the retailer buys products from the supplier before the selling season and in the second the retailer shares products with the supplier in retailing. For both models, we discuss the existence of the equilibrium and characterize the optimal decisions. Numerical results are presented to illustrate properties of the models and to compare the supply chain performance between the centralized and the decentralized models.     

Inventory control by different service levels

This paper examines the multiple period inventory control problem of a single product with multiple (two) prices, depending on service level, in which optimal pricing and ordering decisions are made in each period. Traditional inventory and pricing models consider only single products, single prices, and single service levels. However, this research paper finds that a seller can improve inventory control and revenue by offering multiple prices depending on service level. This research considers a single product with multiple (two) pricing policies corresponding to service level as follows: if the customer is willing to delay the shipment, he/she will be offered a lower regular price. Otherwise, the customer will pay the regular price plus extra charges for express service. In this paper, I show the following: (1) there is an optimal pricing and replenishment policy that can control inventory and (2) there exists a finite threshold for inventory levels such that if the inventory level at the beginning of each period is higher than the threshold, the customer will be offered the express service at the regular price, without any extra charge.     

An algorithm for solving the multi-period online fulfillment assignment problem

This paper develops an optimal solution procedure for the multi-period online fulfillment assignment problem to determine how many and which of a retailer/e-tailer’s capacitated regional warehouse locations should be set up to handle online sales over a finite planning horizon. To reduce the number of candidate solutions in each period, dominance rules from the facility location literature are extended to handle the nonlinear holding and backorder cost implications of our problem. Computational results indicate that multi-period considerations can play a major role in determining the optimal set of online fulfillment locations. In 92% of our test problems, the multi-period solution incorporated fewer openings and closings than myopic single period solutions. To illustrate the use of the model under changing demands, the multi-period solution yielded different supply chain configurations than the myopic single period solution in over 37% of the periods.     

退款保证对竞争供应链的影响:基于顾客退货行为视角

为研究退款保证对竞争供应链的影响,从顾客退货行为视角构建消费者效用函数,建立竞争制造商与在线零售商之间的博弈模型,分析退款保证对供应链均衡的影响。研究发现:高质量产品的批发价格和零售价格总是更高,但高质量产品制造商可能并不能获得更多利润;退款保证会影响消费者的产品购买选择,对低质量产品需求有利。然而,从利润最大化的角度,在线零售商只有在退货损失足够低时,才会有动机提供退款保证,而退款保证对制造商利润的影响取决于退货产品残值。     

Integration of pricing and capacity allocation for perishable products

For years pricing and capacity allocation decisions in most revenue management models have been carried out independently. This article presents a comprehensive model to integrate these two decisions for perishable products. We assume that the supplier sells the same products to different micro-markets at distinct prices. Throughout the sales season, the supplier faces decisions as to which micro-markets or customer classes should be served and at what prices. We show that (i) at any time, a customer class is active (being served) if and only if the price offered is over a threshold level, but the optimal price may not be the highest one of the supplier’s choice; (ii) when the price decision is made in conjunction with inventory, it is similar to the procedure shown in pure pricing models, i.e., the optimal price comes from a subset of prices that forms a maximum increasing concave envelope; (iii) because of dynamic changes in the optimal prices, the nested-price structure does not necessarily hold in general and needs to be redefined; and (iv) the optimal pricing and capacity control policy is based on a sequence of threshold points that incorporate inventory, price and demand intensity. Numerical examples are provided.     

A dynamic pricing approach for returned products in integrated forward/reverse logistics network design

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics network. In this paper, we address the problem of designing and planning a multi-echelon, multi-period, multi-commodity and capacitated integrated forward/reverse logistics network. Returned products are categorized with respect to their quality levels, and a different acquisition price is offered for each return type. Furthermore, the reservation incentive of customers, the expected price of customers for one unit of used product described by uniform distribution, is applied to model the customers’ return willingness. Due to the fact that the remaining worthwhile value in the used products is the corporation’s key motivation for buying them from customers, a dynamic pricing approach is developed to determine the acquisition price for these products and based on it determine the percentage of returned products collected from customer zones. The used products’ acquisition prices at each time period are determined based on the customers’ return willingness by each collection center.     

A new model and solution method for product line design with pricing

Existing customer preference based product design models do not consider product prices and consumer budgets. These models assume that a purchase is based only on the satisfaction obtained from the product, irrespective of the product price and customer budget. However, when products are expensive relative to buyers' budgets, the effect of prices and budgets must be considered in addition to customer satisfaction. Most current models, moreover, assume that a low preference for one product characteristic is compensated by high preference for another, which may not hold for unacceptable levels of characteristics. For such products, we incorporate prices, budget constraints, and minimum acceptable thresholds in our model. To solve the model we develop a highly accurate, robust and efficient Beam Search (BS) based heuristic that identifies optimal or near optimal product lines. The heuristic is tested on 300 simulated problems and an application. It is also compared to a Genetic Algorithms (GA) based heuristic. We found that our heuristic worked better than the GA heuristic in identifying optimal and near optimal solutions quickly. We also give detailed examples that illustrate the heuristic and demonstrate a pricing analysis application of the model.     

Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network

This paper addresses a generalization of the capacitated location-routing problem (CLRP) arising in the design of a collection network for a company engaged in collecting used products from customer zones. The company offers customers a financial incentive per unit of used products. This incentive determines the quantity of used products which are returned by customers. Moreover, it is not necessary for the company to visit all customer zones or to collect all returns in each visited customer zone. The objective is to simultaneously find the location of collection centers, the routes of vehicles, the value of incentive offered and the amount of used products collected from customer zones, so as to maximize the company's overall profit. We develop two mixed integer linear programming formulations of the problem and a heuristic algorithm based on iterated local search. Extensive computational experiments on this problem demonstrate the effectiveness of the proposed algorithm.     

Product line pricing for services with capacity constraints and dynamic substitution

In this paper, we address a service provider’s product line pricing problem for substitutable products in services, such as concerts, sporting events, or online advertisements. For each product, a static price is selected from a pre-defined set such that the total revenue is maximised. The products are differentiated by some of their attributes, and their availability is restricted due to individual capacity constraints. Furthermore, they are simultaneously sold during a common selling period at the end of which the service is delivered. Consumers differ from one another with respect to their willingness to pay, and, hence, their reservation prices vary depending on the product. In the event of a purchase, they choose the product that maximises their consumer surplus.     

Optimal Product Line Design: Genetic Algorithm Approach to Mitigate Cannibalization

In this marketing-oriented era where manufacturers maximize profits through customer satisfaction, there is an increasing need to design a product line rather than a single product. By offering a product line, the manufacturer can customize his or her products to the needs of a variety of segments in order to maximize profits by satisfying more customers than a single product would. When the amount of data on customer preferences or possible product configurations is large and no analytical relations can be established, the problem of an optimal product line design becomes very difficult and there are no traditional methods to solve it. In this paper, we show that the usage of genetic algorithms, a mathematical heuristics mimicking the process of biological evolution, can solve efficiently the problem. Special domain operators were developed to help the genetic algorithm mitigate cannibalization and enhance the algorithm’s local search abilities. Using manufacturer’s profits as the criteria for fitness in evaluating chromosomes, the usage of domain specific operators was found to be highly beneficial with better final results. Also, we have hybridized the genetic algorithm with a linear programming postprocessing step to fine tune the prices of products in the product line. Attacking the core difficulty of cannibalization in the algorithm, the operators introduced in this work are unique.     

Entropy methods for identifying hedonic models

This paper contributes to the literature on hedonic models in two ways. First, it makes use of Queyranne’s reformulation of a hedonic model in the discrete case as a network flow problem in order to provide a proof of existence and integrality of a hedonic equilibrium and efficient computation of hedonic prices. Second, elaborating on entropic methods developed in Galichon and Salanié (Cupid’s invisible hand: social surplus and identification in matching models. Working Paper, 2014), this paper proposes a new identification strategy for hedonic models in a single market. This methodology allows one to introduce heterogeneities in both consumers’ and producers’ attributes and to recover producers’ profits and consumers’ utilities based on the observation of production and consumption patterns and the set of hedonic prices.     

In–Out Algorithm for assortment planning under a ranking-based consumer choice model

We consider a retailer’s assortment planning problem under a ranking-based consumer choice model. The retailer incurs a fixed carrying cost per product offered, a substitution penalty cost for each customer who does not purchase his first choice, and a penalty cost on lost sales. We develop an effective In–Out Algorithm to identify the optimal solution. The extensive numerical study shows that the algorithm performs well, and is more than 10,000 times faster than enumeration on problems with 20 products.     

On the expected discounted penalty function at ruin of a surplus process with interest

In this paper, we study the expected value of a discounted penalty function at ruin of the classical surplus process modified by the inclusion of interest on the surplus. The ‘penalty’ is simply a function of the surplus immediately prior to ruin and the deficit at ruin. An integral equation for the expected value is derived, while the exact solution is given when the initial surplus is zero. Dickson’s [Insurance: Mathematics and Economics 11 (1992) 191] formulae for the distribution of the surplus immediately prior to ruin in the classical surplus process are generalised to our modified surplus process.     

A discrete long-term location–price problem under the assumption of discriminatory pricing: Formulations and parametric analysis

We consider a competitive location problem in which a new firm has to make decisions on the locations of several new facilities as well as on its price setting in order to maximise profit. Under the assumption of discriminatory prices, competing firms set a specific price for each market area. The customers buy one unit of a single homogeneous price-inelastic product from the facility that offers the lowest price in the area the consumers belong to. Three customer choice rules are considered in order to break ties in the offered prices. We prove that, considering long-term competition on price, this problem can be reduced to a problem with decisions on location only. For each one of the choice rules the location problem is formulated as an integer programming model and a parametric analysis of these models is given. To conclude, an application with real data is presented.     

On the management of life insurance company risk by strategic choice of product mix,investment strategy and surplus appropriation schemes

The aim of this paper is to analyze the impact of management’s strategic choice of asset and liability composition in life insurance on shortfall risk and the shareholders’ fair risk charge. In contrast to previous work, we focus on the effectiveness of management decisions regarding the product mix and the riskiness of the asset side under different surplus appropriation schemes. We propose a model setting that comprises temporary life annuities and endowment insurance contracts. Our numerical results show that the effectiveness of management decisions in regard to risk reduction strongly depends on the surplus appropriation scheme offered to the customer and their impact on guaranteed benefit payments, which thus presents an important control variable for the insurer.     

Pricing decisions for substitutable products with a common retailer in fuzzy environments

The pricing problem of substitutable products in a fuzzy supply chain is analyzed by using game theory in this paper. There are two substitutable products produced by two competitive manufacturers respectively and then sold by one common retailer to the consumers. Both the manufacturing cost and the customer demand for each product are characterized as fuzzy variables. How the two manufacturers and the common retailer make their own pricing decisions about wholesale prices and retail prices are explored under four different scenarios, and the corresponding expected value models are developed in this paper. Finally, a numerical example is given to illustrate the effectiveness of the proposed supply chain models.     

Internet shopping with price sensitive discounts

A customer would like to buy a given set of products in a given set of Internet shops. For each Internet shop, standard prices for the products are known as well as a concave increasing discounting function of total standard and delivery price. The problem is to buy all the required products at the minimum total discounted price. Computational complexity of various special cases is established. Properties of optimal solutions are proved and polynomial time and exponential time solution algorithms based on these properties are designed. Two heuristic algorithms are suggested and computationally tested.     

Strategic commitment to price to stimulate downstream innovation in a supply chain

It is generally in a firm’s interest for its supply chain partners to invest in innovations. To the extent that these innovations either reduce the partners’ variable costs or stimulate demand for the end product, they will tend to lead to higher levels of output for all of the firms in the chain. However, in response to the innovations of its partners, a firm may have an incentive to opportunistically increase its own prices. The possibility of such opportunistic behavior creates a hold-up problem that leads supply chain partners to underinvest in innovation. Clearly, this hold-up problem could be eliminated by a pre-commitment to price. However, by making an advance commitment to price, a firm sacrifices an important means of responding to demand uncertainty. In this paper we examine the trade-off that is faced when a firm’s channel partner has opportunities to invest in either cost reduction or quality improvement, i.e. demand enhancement. Should it commit to a price in order to encourage innovation, or should it remain flexible in order to respond to demand uncertainty. We discuss several simple wholesale pricing mechanisms with respect to this trade-off.     

回收率依赖价格的再制造EPQ模型研究

研究了考虑回收率依赖于回收品价格,并带有废弃处理的制造和再制造混合系统的(1,R)和(M,1)EPQ模型.在模型中,采用新产品的制造和回收产品的再制造两种方式来满足客户的需要,回收产品部分用于再制造,其余作为废弃处理;总平均成本包括与回收产品、可销售产品有关的库存持有成本,与制造和再制造有关的生产成本和固定成本,与回收品及制造所需原材料的采购成本以及废弃处理成本.模型给出最优生产策略及总平均成本的表达式.算例验证了所建模型的计算方法,并分析了新引人决策变量p(回收产品单价占制造新产品所需原料价格的比例对总平均成本的变化率的影响.     

The ‘final orderrs problem

When the service department of a company selling machines stops producing and supplying spare parts for certain machines, customers are offered an opportunity to place a so-called final order for these spare parts. We focus on one customer with one machine. The customer plans to use this machine up to a fixed horizon. Based on this horizon, and on the failure rates of the components, the prices of spare components and the consequences of the machine failing before the critical lifetime is reached, the size of the final order is determined.