An optimization of an inventory model of decaying-lot depleted by declining market demand and extended with discretely variable holding costs

Inventory management is considered as major concerns of every organization. In inventory holding, many steps are taken by managers that result a cost involved in this row. This cost may not be constant in nature during time horizon in which perishable stock is held. To investigate on such a case, this study proposes an optimization of inventory model where items deteriorate in stock conditions. To generalize the decaying conditions based on location of warehouse and conditions of storing, the rate of deterioration follows the Weibull distribution function. The demand of fresh item is declining with time exponentially (because no item can always sustain top place in the list of consumers’ choice practically e.g. FMCG). Shortages are allowed and backlogged, partially. Conditions for global optimality and uniqueness of the solutions are derived, separately. The results of some numerical instances are analyzed under various conditions

Supply Chain and Revenue Management for Online Retailing

This dissertation focuses on optimizing inventory and pricing decisions in the online retail industry. Motivated by the importance of great customer service quality in the online retail marketplace, we investigate service-level-constrained inventory control problems in both static and dynamic settings. The first essay studies multi-period production planning problems (with or without pricing options) under stochastic demand. A joint service-level constraint is enforced to restrict the joint probability of having backorders in any period. We use the Sample Average Approximation (SAA) approach to reformulate both chance-constrained models as mixed-integer linear programs (MILPs). Via computations of diverse instances, we demonstrate the effectiveness of the SAA approach, analyze the solution feasibility and objective bounds, and conduct sensitivity analysis. The approaches can be generalized to a wide variety of production planning problems. The second essay investigates the dynamic versions of the service-level-constrained inventory control problems, in which retailers have the flexibility to adjust their inventory policies in each period. We formulate two periodic-review stochastic inventory models (backlogging model and remanufacturing model) via Dynamic Programs (DP), and establish the optimality of generalized base-stock policies. We also propose 2-approximation algorithms for both models, which is computationally more efficient than the brute-force DP. The core concept developed in our algorithms is called the delayed marginal cost, which is proven effective in dealing with service-level-constrained inventory systems. The third essay is motivated by the exploding use of sales rank information in today's internet-based e-commerce marketplace. The sales rank affects consumers' shopping preference and therefore, is critical for retailers to utilize when making pricing decisions. We study periodic-review dynamic pricing problems in presence of sales rank, in which customers' demand is a function of both prices and sales rank. We propose rank-based pricing models and characterize the structure and monotonicity of optimal pricing policies. Our numerical experiments illustrate the potential of revenue increases when strategic cyclic policy is used.PHDIndustrial & Operations EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/144159/1/ycjiang_1.pd

Joint Pricing and Inventory Control under Reference Price Effects

In this work, we address the problem of simultaneously determining a pricing and inventory replenishment strategy under reference price effects. This reference price effect models the fact that consumers not only react sensitively to the current price, but also to deviations from a reference price formed on the basis of past purchases. Immediate effects of price reductions on profits have to be weighted against the resulting losses in future periods. By providing an analytical analysis and numerical simulations we study how the additional dynamics of the consumers’ willingness to pay affect an optimal pricing and inventory control model and whether a simple policy such as a base-stock-list-price policy holds in such a setting

On-line Non-stationary Inventory Control using Champion Competition

The commonly adopted assumption of stationary demands cannot actually reflect fluctuating demands and will weaken solution effectiveness in real practice. We consider an On-line Non-stationary Inventory Control Problem (ONICP), in which no specific assumption is imposed on demands and their probability distributions are allowed to vary over periods and correlate with each other. The nature of non-stationary demands disables the optimality of static (s,S) policies and the applicability of its corresponding algorithms. The ONICP becomes computationally intractable by using general Simulation-based Optimization (SO) methods, especially under an on-line decision-making environment with no luxury of time and computing resources to afford the huge computational burden. We develop a new SO method, termed "Champion Competition" (CC), which provides a different framework and bypasses the time-consuming sample average routine adopted in general SO methods. An alternate type of optimal solution, termed "Champion Solution", is pursued in the CC framework, which coincides the traditional optimality sense under certain conditions and serves as a near-optimal solution for general cases. The CC can reduce the complexity of general SO methods by orders of magnitude in solving a class of SO problems, including the ONICP. A polynomial algorithm, termed "Renewal Cycle Algorithm" (RCA), is further developed to fulfill an important procedure of the CC framework in solving this ONICP. Numerical examples are included to demonstrate the performance of the CC framework with the RCA embedded.Comment: I just identified a flaw in the paper. It may take me some time to fix it. I would like to withdraw the article and update it once I finished. Thank you for your kind suppor

Optimal dynamic pricing and replenishment policies for deteriorating items

Marketing strategies and proper inventory replenishment policies are often incorporated by enterprises to stimulate demand and maximize profit. The aim of this paper is to represent an integrated model for dynamic pricing and inventory control of deteriorating items. To reflect the dynamic characteristic of the problem, the selling price is defined as a time-dependent function of the initial selling price and the discount rate. In this regard, the price is exponentially discounted to compensate negative impact of the deterioration. The planning horizon is assumed to be infinite and the deterioration rate is time-dependent. In addition to price, the demand rate is dependent on advertisement as a powerful marketing tool. Several theoretical results and an iterative solution algorithm are developed to provide the optimal solution. Finally, to show validity of the model and illustrate the solution procedure, numerical results are presented

Service Level Constrained Inventory Systems

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/151878/1/poms13060_am.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/151878/2/poms13060.pd

Matching Spatially Diversified Suppliers with Random Demands

A fundamental challenge in operations management is to dynamically match spatially diversified supply sources with random demand units. This dissertation tackles this challenge in two major areas: in supply chain management, a company procures from multiple, geographically differentiated suppliers to service stochastic demands based on dynamically evolving inventory conditions; in revenue management of ride-hailing systems, a platform uses operational and pricing levers to match strategic drivers with random, location and time-varying ride requests over geographically dispersed networks. The first part of this dissertation is devoted to finding the optimal procurement and inventory management strategies for a company facing two potential suppliers differentiated by their lead times, costs and capacities. We synthesize and generalize the existing literature by addressing a general model with the simultaneous presence of (a) orders subject to capacity limits, (b) fixed costs associated with inventory adjustments, and (c) possible salvage opportunities that enable bilateral adjustments of the inventory, both for finite and infinite horizon periodic review models. By identifying a novel, generalized convexity property, termed (C1K1, C2K2)-convexity, we are able to characterize the optimal single-source procurement strategy under the simultaneous treatment of all three complications above, which has remained an open challenge in stochastic inventory theory literature. To our knowledge, we recover almost all existing structural results as special cases of a unified analysis. We then generalize our results to dual-source settings and derive optimal policies under specific lead time restrictions. Based on these exact optimality results, we develop various heuristics and bounds to address settings with fully general lead times. The second part of this dissertation focuses on a ride-hailing platform's optimal control facing two major challenges: (a) significant demand imbalances across the network, and (b) stochastic demand shocks at hotspot locations. Towards the first major challenge, which is evidenced by our analysis of New York City taxi trip data, the dissertation shows how the platform's operational controls--including demand-side admission control and supply-side empty car repositioning--can improve system performance significantly. Counterintuitively, it is shown that the platform can improve the overall value through strategic rejection of demand in locations with ample supply capacity (driver queue). Responding to the second challenge, a demand shock of uncertain duration, we show how the platform can resort to surge pricing and dynamic spatial matching jointly, to enhance profits in an incentive compatible way for the drivers. Our results provide distinctive insights on the interplay among the relevant timescales of different phenomena, including rider patience, demand shock duration and drivers' traffic delay to the hotspot, and their impact on optimal platform operations

Virtual transshipments and revenue-sharing contracts in supply chain management

This dissertation presents the use of virtual transshipments and revenue-sharing contracts for inventory control in a small scale supply chain. The main objective is to maximize the total profit in a centralized supply chain or maximize the supply chain\u27s profit while keeping the individual components\u27 incentives in a decentralized supply chain. First, a centralized supply chain with two capacitated manufacturing plants situated in two distinct geographical regions is considered. Normally, demand in each region is mostly satisfied by the local plant. However, if the local plant is understocked while the remote one is overstocked, some of the newly generated demand can be assigned to be served by the more remote plant. The sources of the above virtual lateral transshipments, unlike the ones involved in real lateral transshipments, do not need to have nonnegative inventory levels throughout the transshipment process. Besides the theoretical analysis for this centralized supply chain, a computational study is conducted in detail to illustrate the ability of virtual lateral transshipments to reduce the total cost. The impacts of the parameters (unit holding cost, production cost, goodwill cost, etc.) on the cost savings that can be achieved by using the transshipment option are also assessed. Then, a supply chain with one supplier and one retailer is considered where a revenue-sharing contract is adopted. In this revenue-sharing contract, the retailer may obtain the product from the supplier at a less-than-production-cost price, but in exchange, the retailer must share the revenue with the supplier at a pre-set revenuesharing rate. The objective is to maximize the overall supply chain\u27s total profit while upholding the individual components\u27 incentives. A two-stage Stackelberg game is used for the analysis. In this game, one player is the leader and the other one is the follower. The analysis reveals that the party who keeps more than half of the revenue should also be the leader of the Stackelberg game. Furthermore, the adoption of a revenue-sharing contract in a supply chain with two suppliers and one retailer under a limited amount of available funds is analyzed. Using the revenue-sharing contract, the retailer pays a transfer cost rate of the production cost per unit when he obtains the items from the suppliers, and shares the revenue with the suppliers at a pre-set revenue-sharing rate. The two suppliers have different transfer cost rates and revenue-sharing rates. The retailer will earn more profit per unit with a higher transfer cost rate. How the retailer orders items from the two suppliers to maximize his expected profit under limited available funds is analyzed next. Conditions are shown under which the optimal way the retailer orders items from the two suppliers exists