Optimizing capacity,pricing and location decisions on a congested network with balking

In this paper, we consider the problem of making simultaneous decisions on the location, service rate (capacity) and the price of providing service for facilities on a network. We assume that the demand for service from each node of the network follows a Poisson process. The demand is assumed to depend on both price and distance. All facilities are assumed to charge the same price and customers wishing to obtain service choose a facility according to a Multinomial Logit function. Upon arrival to a facility, customers may join the system after observing the number of people in the queue. Service time at each facility is assumed to be exponentially distributed. We first present several structural results. Then, we propose an algorithm to obtain the optimal service rate and an approximate optimal price at each facility. We also develop a heuristic algorithm to find the locations of the facilities based on the tabu search method. We demonstrate the efficiency of the algorithms numerically.     

A competitive hub location and pricing problem

We formulate and solve a new hub location and pricing problem, describing a situation in which an existing transportation company operates a hub and spoke network, and a new company wants to enter into the same market, using an incomplete hub and spoke network. The entrant maximizes its profit by choosing the best hub locations and network topology and applying optimal pricing, considering that the existing company applies mill pricing. Customers’ behavior is modeled using a logit discrete choice model. We solve instances derived from the CAB dataset using a genetic algorithm and a closed expression for the optimal pricing. Our model confirms that, in competitive settings, seeking the largest market share is dominated by profit maximization. We also describe some conditions under which it is not convenient for the entrant to enter the market.     

Optimal pricing for service facilities with self-optimizing customers

Many service industries (e.g., walk-in clinics, vehicle inspection facilities, and data-processing centers) have customers who choose among congested facilities, and select the facility with the lowest combination of travel cost plus congestion cost at the facility. In general, customers over-utilize attractive facilities, causing higher costs than if customers were assigned to facilities to minimize total costs. Optimal facility prices induce customers to select facilities that minimize total cost. We find optimal facility prices and show they equal charging customers for the impact (net costs and benefits) they cause for others. We explore a rich flexibility that allows a range of optimal prices, useful when negotiating the implementation of facility fees. Facility prices can be positive or negative (price discounts), and can be adjusted to be all positive, or to provide net subsidy or net revenue. We contribute to unifying and generalizing several disparate streams of research.     

Simple plant location under uniform delivered pricing

Given a geographical system of demand functions, the simple-plant location problem under uniform delivered pricing consists in determining the delivered price taken as uniform for all customers, the number, the locations, the sizes and the market areas of the plants which supply these customers, in order to maximize the profit of the firm. A model is proposed, which allows, moreover, to integrate some aspects of the commercial policy of the firm, i.e., its decision to satisfy all markets with positive demands or profitable markets only, or to allow a maximum unit loss or require a minimum unit gain on each served market. An efficient algorithm is presented and illustrated by an example. Computational results with a code using recursively Erlenkotter's DUALOC program as a subroutine are summarized.     

Optimizing pig marketing decisions under price fluctuations

In the manufacturing of fattening pigs, pig marketing refers to a sequence of culling decisions until the production unit is empty. The profit of a production unit is highly dependent on the price of pork, the cost of feeding and the cost of buying piglets. Price fluctuations in the market consequently influence the profit, and the optimal marketing decisions may change under different price conditions. Most studies have considered pig marketing under constant price conditions. However, because price fluctuations have an influence on profit and optimal marketing decisions it is relevant to consider pig marketing under price fluctuations. In this paper we formulate a hierarchical Markov decision process with two levels which model sequential marketing decisions under price fluctuations in a pig pen. The state of the system is based on information about pork, piglet and feed prices. Moreover, the information is updated using a Bayesian approach and embedded into the hierarchical Markov decision process. The optimal policy is analyzed under different patterns of price fluctuations. We also assess the value of including price information into the model.

     

Strategic competitive location: improving existing and establishing new facilities

Competitive facility location models consider two main strategies for increasing the market share captured by a chain subject to a budget constraint. One strategy is the improvement of existing facilities. The second strategy is the construction of new facilities. In this paper we analyse these two strategies as well as the joint strategy which is a combination of the two. All three strategies are formulated as a unified model. The best solution to an individual strategy is a feasible solution to the joint one. Therefore, the joint strategy must yield solutions that are at least as good as the solutions to each of the individual strategies. Based on the results of extensive experiments, we conclude that the increase in market share captured by a chain when the joint strategy is employed can be significantly higher than increases obtained by individual strategies. A branch and bound procedure and a tabu search heuristic are constructed for the solution of the unified model. Both algorithms performed very well on a set of test problems with up to 900 demand points. A total of 62% of the test problems were optimally solved by the branch and bound procedure.     

Coordinating pricing and production decisions in the presence of price competition

In this paper we study the effects of coordinating pricing and production decisions on the improvement of a firm’s position in a price-competitive environment. Assuming duopolistic market conditions, we use game-theoretic concepts and models to analyze two scenarios. A firm’s marketing and production departments may vertically coordinate their pricing and production quantity decisions and the two firms may horizontally compete for price-sensitive random demand. The two scenarios include (i) no coordination and (ii) coordination in both firms. We show that by coordinating their pricing and production decisions, competing firms can increase their profitability—especially when conditions are unfavourable (i.e., with smaller market sizes, higher unit costs and lower unit revenues). While it may be intuitive to expect that coordination will outperform non-coordination, our models provide a means for formalizing and quantifying the differences between the two policies.     

A two-player competitive discrete location model with simultaneous decisions

In this paper we will describe and study a competitive discrete location problem in which two decision-makers (players) will have to decide where to locate their own facilities, and customers will be assigned to the closest open facilities. We will consider the situation in which the players must decide simultaneously, unsure about the decisions of one another, and we will present the problem in a franchising environment. Most problems described in the literature consider sequential rather than simultaneous decisions. In a competitive environment, most problems consider that there is a set of known and already located facilities, and new facilities will have to be located, competing with the existing ones. In the presence of more than one decision-maker, most problems found in the literature belong to the class of Stackelberg location problems, where one decision-maker, the leader, locates first and then the other decision-maker, the follower, locates second, knowing the decisions made by the first. These types of problems are sequential and differ significantly from the problem tackled in this paper, where we explicitly consider simultaneous, non-cooperative discrete location decisions. We describe the problem and its context, propose some mathematical formulations and present an algorithmic approach that was developed to find Nash equilibria. Some computational tests were performed that allowed us to better understand some of the features of the problem and the associated Nash equilibria. Among other results, we conclude that worsening the situation of a player tends to benefit the other player, and that the inefficiency of Nash equilibria tends to increase with the level of competition.     

Optimal multi-period service capacity allocation and pricing allowing for uncertain competitive entry

A nonlinear programming model is formulated in this paper to determine the optimal scheme of capacity allocation and prices over a multi-period planning horizon for a service provider in the absence and presence of uncertain competitive entry. The model is solved for constant, decreasing, and increasing price sensitivities employing a combination of analytical and numerical methods. The study highlights the importance of advance selling of service prior to its eventual consumption in the spot period and investigates the impact of uncertain competitive entry on the optimal capacity allocation policy and its related profit if the entry is more or less likely or if the rival is more or less influential. The findings of the study reveal that the conclusions drawn from a two-period model are not necessarily generalizable to a model of a multi-period planning horizon.     

Coordination of staffing and pricing decisions in a service firm

Customer demand is sensitive to the price paid for the service in many service environments. Using queueing theory framework, we develop profit maximization models for jointly determining the price and the staffing level in a service company. The models include constraints on the average waiting time and the blocking probability. We show convexity of the single‐variable subproblem under certain plausible assumptions on the demand and staffing cost functions. Using numerical examples, we investigate the sensitivity of the price and the staffing level to changes in the marginal service cost and the user‐specified constraint on the congestion measure. Copyright © 2008 John Wiley & Sons, Ltd.     

Heuristic algorithms for delivered price spatially competitive network facility location problems

We review previous formulations of models for locating a firm's production facilities while simultaneously determining production levels at those facilities so as to maximize the firm's profit. We enhance these formulations by adding explicit variables to represent the firm's shipping activities and discuss the implications of this revised approach. In these formulations, existing firms, as well as new entrants, are assumed to act in accordance with an appropriate model of spatial equilibrium. The firm locating new production facilities is assumed to be a large manufacturer entering an industry composed of a large number of small firms. Our previously reported proof of existence of a solution to the combined location-equilibrium problem is briefly reviewed. A heuristic algorithm based on sensitivity analysis methods which presume the existence of a solution and which locally approximate price changes as linear functions of production perturbations resulting from newly established facilities is presented. We provide several numerical tests to illustrate the contrasting locational solutions which this paper's revised delivered price formulation generates relative to those of previous formulations. An exact, although computationally burdensome, method is also presented and employed to check the reliability of the heuristic algorithm.     

Retail store location and pricing within a competitive environment using constrained multinomial logit

The purpose of this paper is to report a pricing and retail location model using the constrained multinomial logit (CMNL), which takes into account customers’ utility and maximum willingness to pay via cut-off soft-constraints. The proposed model is probabilistic and non-linear, therefore a PSO metaheuristic approach was designed to determine the most suitable price, store locations and demand segmentation. The results obtained in test-cases showed a close relationship between price and location decisions. In addition, the results suggest that not only price, but also location decisions are affected when the consumers’ maximum willingness to pay is considered.     

Covering location problem of emergency service facilities in an uncertain environment

In practical location problems on networks, the response time between any pair of vertices and the demands of vertices are usually indeterminate. This paper employs uncertainty theory to address the location problem of emergency service facilities under uncertainty. We first model the location set covering problem in an uncertain environment, which is called the uncertain location set covering model. Using the inverse uncertainty distribution, the uncertain location set covering model can be transformed into an equivalent deterministic location model. Based on this equivalence relation, the uncertain location set covering model can be solved. Second, the maximal covering location problem is investigated in an uncertain environment. This paper first studies the uncertainty distribution of the covered demand that is associated with the covering constraint confidence level α. In addition, we model the maximal covering location problem in an uncertain environment using different modelling ideas, namely, the (α, β)-maximal covering location model and the α-chance maximal covering location model. It is also proved that the (α, β)-maximal covering location model can be transformed into an equivalent deterministic location model, and then, it can be solved. We also point out that there exists an equivalence relation between the (α, β)-maximal covering location model and the α-chance maximal covering location model, which leads to a method for solving the α-chance maximal covering location model. Finally, the ideas of uncertain models are illustrated by a case study.     

Stochastic competitive entries and dynamic pricing

How should firms price new products when they do not know the timing, nor the nature of the next competitive entry? To guide managers’ pricing decisions in such contexts, we propose a dynamic pricing model with two types of randomly timed entry, i.e. imitative and innovative. The characterization of the equilibrium strategies reveals how optimal prices vary with the manager’s knowledge about the timing of future competitive entries. We show that price skimming is not always optimal when entry dates are unknown to managers. Everything else equal, we demonstrate that the randomness of competitive entries make forward looking managers to choose constant prices, even though the characteristics of the market would have justified skimming the demand in the normal course. Moreover, we show that the constant pricing policy remains optimal even when the incumbent’s optimal pricing strategy influences the probability of facing a competitive entry. Finally, we find that uncertainty does not necessarily hurt firms’ profits.     

The ability to compensate for suboptimal capacity decisions by optimal pricing decisions

Certain companies have high capacity cost and rather moderate production cost. These companies usually assume that deciding about their capacity is quite critical. Frequently, however, they are able to adjust the demand for their products to the available capacity by setting appropriate prices, that is higher (lower) than current prices in the presence of under-capacity (over-capacity). We argue that appropriate prices can reduce the adverse effects of non-optimal capacities. We analyze the sensitivity of profit in such a situation for a company in a monopolistic market, selling a non-storable product and facing fluctuating but interdependent demand across two time periods which allows to profitably differentiate prices. Therefore, we state optimality conditions for prices in situations of variable and given capacities and describe a procedure to determine them. The main suggestion of this analysis is that, within the bounds of the normative models and specific parameters examined, optimal prices can substantially reduce the adverse effects of capacity deviating from its optimum. In this way, profit is rather insensitive to deviations of capacity from its optimum. The implications of this finding are discussed for a number of situations.     

Option pricing for a logstable asset price model

The paper generalises the celebrated Black and Scholes [1] European option pricing formula for a class of logstable asset price models. The theoretical option prices have the potential to explain the implied volatility smiles evident in the market.     

Differential game approach to pricing and advertising decisions

This study proposes a model to make concurrent decisions on dynamic pricing and advertising to maximise firms' profitability over an infinite time horizon in a duopoly market. To this end, the Nerlove-Arrow pricing and advertising model is designed in the presence of shifting costs in a dynamic duopolistic competition as a differential game. The Nash equilibrium solution is defined based upon a set of Hamilton–Jacobi–Bellman. Four scenarios are applied for economic interpretations and the efficacy of the model.     

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.     

Dynamic pricing for perishable items with costly price adjustments

Dynamic pricing is widely adopted in inventory management for perishable items, and the corresponding price adjustment cost should be taken into account. This work assumes that the price adjustment cost comprises of a fixed component and a variable one, and attempts to search for the optimal dynamic pricing strategy to maximize the firm’s profit. However, considering the fixed price adjustment cost turns this dynamic pricing problem to a non-smooth optimal control problem which cannot be solved directly by Pontryagin’s maximum principle. Hence, we first degenerate the original problem into a standard optimal control problem and calculate the corresponding solution. On the basis of this solution, we further propose a suboptimal pricing strategy which simultaneously combines static pricing and dynamic pricing strategies. The upper bound of profit gap between the suboptimal solution and the optimal one is obtained. Numerical simulation indicates that the suboptimal pricing strategy enjoys an efficient performance.     

LP-based approximation for uniform capacitated facility location problem

In this paper, we study uniform hard capacitated facility location problem. The standard LP for the problem is known to have an unbounded integrality gap. We present constant factor approximation by rounding a solution to the standard LP with a slight $(1+ϵ)$ violation in the capacities.Our result shows that the standard LP is not too bad.Our algorithm is simple and more efficient as compared to the strengthened LP-based true approximation that uses the inefficient ellipsoid method with a separation oracle. True approximations are also known for the problem using local search techniques that suffer from the problem of convergence. Moreover, solutions based on standard LP are easier to integrate with other LP-based algorithms.The result is also extended to give the first approximation for uniform hard capacitated $k$-facility location problem violating the capacities by a factor of $(1+ϵ)$ and breaking the barrier of 2 in capacity violation. The result violates the cardinality by a factor of $\frac{2}{1+ϵ}$.