Two storage inventory problem with dynamic demand and interval valued lead-time over finite time horizon under inflation and time-value of money

A finite time horizon inventory problem for a deteriorating item having two separate warehouses, one is a own warehouse (OW) of finite dimension and other a rented warehouse (RW), is developed with interval-valued lead-time under inflation and time value of money. Due to different preserving facilities and storage environment, inventory holding cost is considered to be different in different warehouses. The demand rate of item is increasing with time at a decreasing rate. Shortages are allowed in each cycle and backlogged them partially. Shortages may or may not be allowed in the last cycle and under this circumstance, there may be three different types of model. Here it is assumed that the replenishment cycle lengths are of equal length and the stocks of RW are transported to OW in continuous release pattern. For each model, different scenarios are depicted depending upon the re-order point for the next lot. Representing the lead-time by an interval number and using the interval arithmetic, the single objective function for profit is changed to corresponding multi-objective functions. These functions are maximized and solved by Fast and Elitist Multi-objective Genetic Algorithm (FEMGA). The models are illustrated numerically and the results are presented in tabular form.     

Inventory model with deteriorating items,ramp-type demand and partially backlogged shortages for a two warehouse system

In this paper, we consider a two warehouse inventory model, an owned one (OW) and a rented one (RW). Inventory deteriorates in the two warehouses at different constant rates, demand rate is a general ramp-type function of time and shortages are partially backlogged at a constant rate. Existence and uniqueness of the optimal solution is discussed. An algorithm is developed to obtain the overall optimal replenishment policy, which would enable the manager to decide upon the feasibility of renting a warehouse. The dynamics of the model and application of the algorithm are demonstrated through numerical examples. Sensitivity analysis is conducted with respect to model parameters and some important observations are drawn.     

A two-echelon inventory model for a deteriorating item with stock-dependent demand,partial backlogging and capacity constraints

This study investigates a two-echelon supply chain model for deteriorating inventory in which the retailer’s warehouse has a limited capacity. The system includes one wholesaler and one retailer and aims to minimise the total cost. The demand rate in retailer is stock-dependent and in case of any shortages, the demand is partially backlogged. The warehouse capacity in the retailer (OW) is limited; therefore the retailer can rent a warehouse (RW) if needed with a higher cost compared to OW. The optimisation is done from both the wholesaler’s and retailer’s perspectives simultaneously. In order to solve the problem a genetic algorithm is devised. After developing a heuristic a numerical example together with sensitivity analysis are presented. Finally, some recommendations for future research are presented.     

Investigation of two-warehouse inventory problems in interval environment under inflation via particle swarm optimization

ABSTRACT

In this paper, a two-warehouse inventory problem has been investigated under inflation with different deterioration effects in two separate warehouses (rented warehouse, RW, and owned warehouse, OW). The objective of this investigation is to determine the lot-size of the cycle of the two-warehouse inventory system by minimizing the average cost of the system. Considering different inventory policies, the corresponding models have been formulated for linear trend in demand and interval valued cost parameters. In OW, shortages, if any, are allowed and partially backlogged with a variable rate dependent on the duration of the waiting time up to the arrival of the next lot. The corresponding optimization problems have been formulated as non-linear constrained optimization problems with interval parameters. These problems have been solved by an efficient soft computing method, viz. practical swarm optimization. To illustrate the model, a numerical example has been solved with different partially backlogging rates. Then to study the effect of changes of different system parameters on the optimal policy, sensitivity analyses have been carried out graphically by changing one parameter at a time and keeping the others at their original values. Finally, a fruitful conclusion has been reached regarding the selection of an appropriate inventory policy of the two-warehouse system.     

A two-warehouse inventory model for deteriorating items under conditionally permissible delay in payment

For the capacity of any warehouse is limited, it has to rent warehouse (RW) for storing the excess units over the fixed capacity W of the own warehouse (OW) in practice. The RW is assumed to offer better preserving facilities than the OW resulting in a lower rate of deterioration and is assumed to charge higher holding cost than the OW. In this paper, a two-warehouse inventory model for deteriorating items is considered with constant demand under conditionally permissible delay in payment. The purpose of this study is to find the optimal replenishment policies for minimizing the total relevant inventory costs. Useful theorems to characterize the optimal solutions have been derived. Furthermore, numerical examples are provided to illustrate the proposed model, sensitivity analysis of the optimal solutions with respect to major parameters is carried out and some managerial inferences are obtained.     

A multiobjective model of wholesaler-retailers' problem via genetic algorithm

In the existing literature, most of the purchasing models were developed only for retailers problem ignoring the constraint of storage capacity of retailers shop/showroom. In this paper, we have developed a deterministic model of wholesaler-retailers' problem of single product. The storage capacity of wholesaler's warehouse/showroom and retailers' showroom/shop are assumed to be finite. The items are transported from wholesaler's warehouse to retailers' Own Warehouse (OW) in a lot. The customer's demand is assumed to be displayed inventory level dependent. Demands are met from OW and that spaces of OW will immediately be filled by shifting the same amount from the Rented Warehouse (RW) till the RW is empty. The time duration between selling from OW and filling up its space by new ones from RW is negligible. According to relative size of the retailers' existing (own) warehouse capacity and the demand factors, different scenarios are identified. Our objectives are to optimize the cost functions of wholesaler and two retailers separately. To solve this problem, a real coded Genetic Algorithm (GA) with roulette wheel selection/reproduction, whole arithmetic crossover and non-uniform mutation is developed. Finally a numerical example is presented to illustrate the results for different scenarios. To compare the results of GA, Generalised Reduced Gradient Method has been used for the problem. Also, a sensitivity analysis has been performed to study the variations of the optimal average cost with respect to the different parameters.     

A two warehouse inventory model for a deteriorating item with partially/fully backlogged shortage and fuzzy lead time

An optimization inventory policy for a deteriorating item with imprecise lead-time, partially/fully backlogged shortages and price dependent demand is developed under two-warehouse system. For display and storage, the retailer hires one warehouse of finite capacity at market place, treated as own warehouse (OW) and another warehouse of large capacity as it may be required at a distance place from the market, treated as rented warehouse (RW). Holding cost at RW decreases with the increase of distance from the market place. Units are transferred from RW to OW in bulk release pattern and sold from OW. Using the nearest interval approximation method the estimated fuzzy average profit function is defuzzified and transformed to multiple crisp objective functions which are solved by Global Criteria Method. The models are illustrated numerically. Sensitivity of the inventory costs on the location of RW has been depicted graphically. Also loss in profit due to deteriorations for both models have been presented.     

Deterministic inventory model for deteriorating items with capacity constraint and time-proportional backlogging rate

In this paper, a deterministic inventory model for deteriorating items with two warehouses is developed. A rented warehouse is used when the ordering quantity exceeds the limited capacity of the owned warehouse, and it is assumed that deterioration rates of items in the two warehouses may be different. In addition, we allow for shortages in the owned warehouse and assume that the backlogging demand rate is dependent on the duration of the stockout. We obtain the condition when to rent the warehouse and provide simple solution procedures for finding the maximum total profit per unit time. Further, we use a numerical example to illustrate the model and conclude the paper with suggestions for possible future research.     

井位不确定环境下的油田仓库选址问题

油田工作中,合理的仓库选址决策不仅能节约物流成本,而且能提高油田作业效率。现有研究通常基于当前的油井位置(简称井位),没有考虑未来井位变化对仓库选址的影响。同时井位受到地下储层条件及油气公司远景规划等因素影响,未来的井位具有很强的不确定性。此外,仓库选址决策属中长期决策,将长期影响油田的物流费用、管理工作甚至开发工作,而且油田生产要求仓库能持续供应物资,所以油田仓库选址应考虑井位的不确定性和仓库服务中断等因素。本文首先根据油田井位分布和钻井规划采用随机模拟方法模拟未来井位,建立并求解考虑设施中断的离散选址模型。然后以鄂南油区物资仓库选址问题为例,模拟井位并求解仓库选址问题,从8个候选点中选出3个建库/租库。最后,分析井位和需求量变化对仓库选址结果的影响。井位不确定环境下油田物资仓库选址问题的研究,不仅对油田物流系统管理的研究具有一定的理论意义,也对油田的物流决策有重要的现实意义。     

An inventory sharing and allocation method for a multi-location service parts logistics network with time-based service levels

We consider a model to allocate stock levels at warehouses in a service parts logistics network. The network is a two-echelon distribution system with one central warehouse with infinite capacity and a number of local warehouses, each facing Poisson demands from geographically dispersed customers. Each local warehouse uses a potentially different base stock policy. The warehouses are collectively required to satisfy time-based service targets: Certain percentages of overall demand need to be satisfied from facilities within specified time windows. These service levels not only depend on the distance between customers and the warehouses, but also depend on the part availabilities at the warehouses. Moreover, the warehouses share their inventory as a way to increase achieved service levels, i.e., when a local warehouse is out of stock, demand is satisfied with an emergency shipment from another close-by warehouse. Observing that the problem of finding minimum-cost stock levels is an integer non-linear program, we develop an implicit enumeration-based method which adapts an existing inventory sharing model from the literature, prioritizes the warehouses for emergency shipments, and makes use of a lower bound. The results show that the proposed inventory sharing strategy results in considerable cost reduction when compared to the no-sharing case and the method is quite efficient for the considered test problems.     

一个带有增加量价格折扣的两货栈库存模型

已有的确定性两货栈(其中一个是自己货栈(OW);另一个是租用货栈(RW))库存模型通常不考虑增加量价格折扣,然而在实际生活中,增加量价格折扣却是促使库存管理者加大订货量的一个重要原因.本文通过考虑增加量价格折扣而将两货栈系统作了进一步扩展,在采用间隔式运输模式运送RW的物品到OW的情形下,建立了一个带有增加量价格折扣并允许短缺的两货栈库存模型,提供了一种寻求最优库存策略的简单方法.     

Computationally Efficient Solution of a Multiproduct,Two-Stage Distribution—Location Problem

A two-stage distribution planning problem, in which customers are to be served with different commodities from a number of plants, through a number of intermediate warehouses is addressed. The possible locations for the warehouses are given. For each location, there is an associated fixed cost for opening the warehouse concerned, as well as an operating cost and a maximum capacity. The demand of each customer for each commodity is known, as are the shipping costs from a plant to a possible warehouse and thereafter to a customer. It is required to choose the locations for opening warehouses and to find the shipping schedule such that the total cost is minimized. The problem is modelled as a mixed-integer programming problem and solved by branch and bound. The lower bounds are calculated through solving a minimum-cost, multicommodity network flow problem with capacity constraints. Results of extensive computational experiments are given.     

The continuous resupply policy for deteriorating items with stock-dependent observable demand in a two-warehouse and two-echelon supply chain

This paper expands previous work on stock-dependent demand for a retailer with a two-warehouse (OW/RW) situation to the case of deteriorating items and where the retailer seeks to obtain the integrated optimal distribution policy from collaboration with a supplier. Motivated by practical applications and recent literature, a policy is considered whereby products in good order from the retailer’s back-room (RW) are frequently transferred to its capacitated main store OW. Because the demand depends on the stock of good products in the OW, the aim is to keep this stock at its full capacity with products in good condition, and this can be done for as long as the RW stock of good products is positive. A firm’s objective function is the Net Present Value (NPV) of the firm’s future cash-flows. The profit functions are developed for both this continuous resupply policy and the commonly used policy in the OW/RW literature. Numerical examples are included and have been solved with grid search methods. The examples illustrate the benefits of adopting the continuous resupply policy, and also collaboration between the retailer and the wholesaler. Moreover, it is shown how these benefits can be shared by small adjustments to the product’s unit price between the firms.     

A Plant and Warehouse Location Problem

A model is proposed for the simultaneous location of plants and warehouses among a given set of possible locations in order to satisfy a given demand at minimum cost. The demand of each customer may be satisfied directly from a plant or through a warehouse. The model also applies to the design of a distribution network with two levels of warehouses. A branch-and-bound algorithm, which generalizes previous work by Efroymson and Ray and others, is presented, computational experience is reported on.     

Complements and substitutes among locations in the two-stage transshipment problem

This paper considers complementarity and substitutability among locations for a two-stage transshipment problem with locations being factories, warehouses, and demand centers. A direct generalization of properties known for the transportation problem would be that any two locations of different types are complements and any two locations of the same type are substitutes. Examples show that these properties need not hold for pairs of locations that include at least one warehouse. An algorithm of Nagelhout and Thompson (European J. Operational Res. 6 (1981) 149–161) for locating warehouses is based on the incorrect supposition that any two warehouses are substitutes, and an example shows that their algorithm need not generate an optimal solution as claimed. For pairs of locations that do not include a warehouse, complementarity and substitutability properties hold just as in the transportation problem.     

Approximate evaluation of multi-location inventory models with lateral transshipments and hold back levels

We consider a continuous-time, single-echelon, multi-location inventory model with Poisson demand processes. In case of a stock-out at a local warehouse, a demand can be fulfilled via a lateral transshipment (LT). Each warehouse is assigned a pre-determined sequence of other warehouses where it will request for an LT. However, a warehouse can hold its last part(s) back from such a request. This is called a hold back pooling policy, where each warehouse has hold back levels determining whether a request for an LT by another warehouse is satisfied. We are interested in the fractions of demand satisfied from stock (fill rate), via an LT, and via an emergency procedure from an external source. From these, the average costs of a policy can be determined. We present a new approximation algorithm for the evaluation of a given policy, approximating the above mentioned fractions. Whereas algorithms currently known in the literature approximate the stream of LT requests from a warehouse by a Poisson process, we use an interrupted Poisson process. This is a process that is turned alternatingly On and Off for exponentially distributed durations. This leads to the On/Off overflow algorithm. In a numerical study we show that this algorithm is significantly more accurate than the algorithm based on Poisson processes, although it requires a longer computation time. Furthermore, we show the benefits of hold back levels, and we illustrate how our algorithm can be used in a heuristic search for the setting of the hold back levels.     

Elementary Theory of Optimal Silo Storage Design

This study indicates a method for calculating an economic division of warehouses into compartments when different varieties have to be stored simultaneously and separately. The study deals with cases where the total storage capacity demand and the number of varieties are known and fixed, but where the storage capacity demand of each variety is unknown. Problems of this nature exist in the preliminary designing of grain silos, fleets of transport vehicles, utensils in public kitchens, etc. If the warehouse capacity can cope with the total storage capacity demand, but the number of compartments is insufficient, it is possible that part of the material to be stored cannot be accommodated, although certain compartments may only be partly filled; this will be due to the impossibility of storing different varieties together. The materials will have to be stored in other warehouses, at a higher charge per capacity unit than that of the warehouse in question.The division of the warehouse into a large number of compartments will assure storage of most, if not all, the material. On the other hand, increase in the number of compartments (and installations) makes for increased investment in transport installation, partitions and additional storage capacity to compensate for space taken up by these partitions and installations.The object of this study is to introduce a method for calculating the optimal division of a warehouse into compartments, so that the annual costs of storage and capital investment are minimized.It is possible-by introducing not very restrictive statistical assumptions-to calculate the annual costs of storing excluded material elsewhere for different modes of partitioning a warehouse into compartments. The annual building cost of the warehouse is calculated in the ordinary way.In this study a solution is offered for the partitioning of a warehouse into equal compartments. It is to be expected that the extension of this solution to cases of the partition into compartments, differing from each other as to storage capacity, will tend to lower costs.     

Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem

This paper considers a production–distribution problem that consists of defining the flow of produced products from manufacturing plants to clients (markets) via a set of warehouses. The problem also consists of defining the location of such warehouses that have unlimited storage capacity. This problem is known in the literature as the three-echelon uncapacitated facility location problem (TUFLP), and is known to be NP-hard when the objective function is to minimize the total cost of warehouse location and production and distribution of products. This paper proposes a Greedy Randomized Adaptive Search Procedure (GRASP) to solve the multi-item version of the TUFLP. Computational experiments are conducted using known instances from the literature. Solutions obtained using GRASP are compared against both optimal solutions and lower bounds obtained using mathematical programming. Results show that proposed algorithm performs well, obtaining good solutions (and even the optimal values) in less computational time than the mixed-integer linear programming model.     

Solution procedures for sizing of warehouses

In the past, researchers presented a linear programming formulation for the economic sizing of warehouses when demand is highly seasonal and public warehouse space is available on a monthly basis. The static model was extended for the dynamic sizing problem in which the warehouse size is allowed to change over time. By applying simplex routine, the optimal size of the warehouse to be constructed could be determined. In this paper, an alternative and simple method of arriving at an optimal solution for the static problem is given. Three extensions of the static model are given. These extensions involve costs varying over time, economies of scale in capital expenditure and/or operating cost and stochastic version. The dynamic warehouse sizing problem is shown to be a network flow problem which could be solved by using network flow algorithms. The structure of an optimal solution is also given. The concave cost version of the dynamic warehouse sizing problem is also discussed and it is shown that this problem can be solved efficiently using dynamic programming.     

A heuristic algorithm for the truckload and less-than-truckload problem

The delivery of goods from a warehouse to local customers is an important and practical problem of a logistics manager. In reality, we are facing the fluctuation of demand. When the total demand is greater than the whole capacity of owned trucks, the logistics managers may consider using an outsider carrier.Logistics managers can make a selection between a truckload (a private truck) and a less-than-truckload carrier (an outsider carrier). Selecting the right mode to transport a shipment may bring significant cost savings to the company.In this paper, we address the problem of routing a fixed number of trucks with limited capacity from a central warehouse to customers with known demand. The objective of this paper is developing a heuristic algorithm to route the private trucks and to make a selection of less-than-truckload carriers by minimizing a total cost function. Both the mathematical model and the heuristic algorithm are developed. Finally, some computational results and suggestions for future research are presented.