A Scenario-Based Heuristic for a Capacitated Transportation-Inventory Problem with Stochastic Demands

2002 ◽  
pp. 231-248
Author(s):  
Paveena Chaovalitwongse ◽  
H. Edwin Romeijn ◽  
Panos M. Pardalos
Keyword(s):  
Inventory Problem ◽  
Stochastic Demands

An inventory problem

1973 ◽  
Vol 4 (3) ◽  
pp. 15-20
Author(s):  
Robert C. Shook ◽  
Harold Joseph Highland
Keyword(s):  
Inventory Problem

scholarly journals Single-Manufacturer Multi-Retailer Supply Chain Models with Discrete Stochastic Demand

2021 ◽  
Vol 13 (15) ◽  
pp. 8271
Author(s):  
Yaqing Xu ◽  
Jiang Zhang ◽  
Zihao Chen ◽  
Yihua Wei
Keyword(s):  
Dynamic Programming ◽  
Supply Chain ◽  
Computational Complexity ◽  
Stackelberg Game ◽  
Programming Model ◽  
Dynamic Programming Method ◽  
Game Model ◽  
Chain Model ◽  
Stochastic Demands ◽  
Demand Models

Although there are highly discrete stochastic demands in practical supply chain problems, they are seldom considered in the research on supply chain systems, especially the single-manufacturer multi-retailer supply chain systems. There are no significant differences between continuous and discrete demand supply chain models, but the solutions for discrete random demand models are more challenging and difficult. This paper studies a supply chain system of a single manufacturer and multiple retailers with discrete stochastic demands. Each retailer faces a random discrete demand, and the manufacturer utilizes different wholesale prices to influence each retailer’s ordering decision. Both Make-To-Order and Make-To-Stock scenarios are considered. For each scenario, the corresponding Stackelberg game model is constructed respectively. By proving a series of theorems, we transfer the solution of the game model into non-linear integer programming model, which can be easily solved by a dynamic programming method. However, with the increase in the number of retailers and the production capacity of manufacturers, the computational complexity of dynamic programming drastically increases due to the Dimension Barrier. Therefore, the Fast Fourier Transform (FFT) approach is introduced, which significantly reduces the computational complexity of solving the supply chain model.

scholarly journals Integrating Dynamic Pricing and Inventory Control for Fresh Agriproduct under Multinomial Logit Choice

2018 ◽  
Vol 2018 ◽  
pp. 1-12
Author(s):  
Xiong-zhi Wang ◽  
Wenliang Zhou
Keyword(s):  
Dynamic Pricing ◽  
Programming Model ◽  
Choice Model ◽  
Multinomial Logit ◽  
Linear Ordering ◽  
Stochastic Dynamic ◽  
Inventory Problem ◽  
Numerical Illustration ◽  
Dynamic Stochastic ◽  
Joint Pricing

In this article, we investigate a joint pricing and inventory problem for a retailer selling fresh agriproducts (FAPs) with two-period shelf lifetime in a dynamic stochastic setting, where new and old FAPs are on sale simultaneously. At the beginning of each period the retailer makes ordering decision for new FAP and sets regular and discount price for new and old inventories, respectively. After demand realization, the expired leftover is disposed and unexpired inventory is carried to the next period, continuing selling. Unmet demand of all FAPs is backordered. The objective is to maximize the total expected discount profit over the whole planning horizon. We present a price-dependent, stochastic dynamic programming model taking into account zero lead time, linear ordering costs, inventory holding, and backlogging costs, as well as disposal cost. Considering the influence of the perishability, we integrate a Multinomial Logit (MNL) choice model to describe the consumer behavior on purchasing fresh or nonfresh product. By way of the inverse of the price vector, the original formulation can be transferred to be jointly concave and tractable. Finally we characterize the optimal policy and develop effective methods to solve the problem and conduct a simple numerical illustration.

Optimal Policy for a Multi-Product, Dynamic, Nonstationary Inventory Problem

1965 ◽  
Vol 12 (3) ◽  
pp. 206-222 ◽  
Author(s):  
Arthur F. Veinott
Keyword(s):  
Optimal Policy ◽  
Inventory Problem

Approximations for the single-product production-inventory problem with compound Poisson demand and service-level constraints

1984 ◽  
Vol 16 (2) ◽  
pp. 378-401 ◽  
Author(s):  
A. G. De kok ◽  
H. C. Tijms ◽  
F. A. Van der Duyn Schouten
Keyword(s):  
Poisson Process ◽  
Compound Poisson Process ◽  
Service Level ◽  
Inventory Level ◽  
Inventory Problem ◽  
Single Product ◽  
Compound Poisson ◽  
Poisson Demand ◽  
Production Inventory ◽  
Random Fluctuations

We consider a production-inventory problem in which the production rate can be continuously controlled in order to cope with random fluctuations in the demand. The demand process for a single product is a compound Poisson process. Excess demand is backlogged. Two production rates are available and the inventory level is continuously controlled by a switch-over rule characterized by two critical numbers. In accordance with common practice, we consider service measures such as the average number of stockouts per unit time and the fraction of demand to be met directly from stock on hand. The purpose of the paper is to derive practically useful approximations for the switch-over levels of the control rule such that a pre-specified value of the service level is achieved.

Sign in / Sign up

Export Citation Format

Share Document