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 deterministic order level inventory model for deteriorating items with two storage facilities

In this paper a deterministic inventory model is developed for a single deteriorating item which is stored in two different warehouses. A rented warehouse is used to store the excess units over the fixed capacity W of the own warehouse. The rented warehouse is assumed to charge higher unit holding cost than the own warehouse, but to offer a better preserving facility resulting in a lower rate of deterioration for the goods than the own warehouse. The optimal stock level for the beginning of the period is found and the model developed is shown to agree with the order level model for non deteriorating items with a single storage facility. An illustration to show the applicability of the model is also presented.     

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.     

A two warehouse inventory model for deteriorating items with a linear trend in demand and shortages

In this paper, we develop a deterministic inventory model with two warehouses (one is the existing storage known as own warehouse (OW) and the other is hired on rental basis known as rented warehouse (RW). The model allows different levels of item deterioration in both warehouses. The demand rate is supposed to be a linear (increasing) function of time and the replenishment rate is infinite. The stock is transferred from RW to OW in continuous release pattern and the associated transportation cost is taken into account. Shortages in OW are allowed and excess demand is backlogged. For the general model, we give the equations for the optimal policy and cost function and we discuss some special cases. A numerical example is given to illustrate the solution procedure of the model. Finally, based on this example, we conduct a sensitivity analysis of the model.     

A Two-Warehouse Probabilistic Order-Level Inventory Model for Deteriorating Items

In this paper an order-level probabilistic inventory model for deteriorating items with two warehouses is developed. It is assumed that the production rate is infinite and shortages are allowed. The rates of deterioration of items in the two warehouses are different. Also, a single-warehouse version for deteriorating items is discussed. This paper also considers a two-warehouse model for non-deteriorating items. An illustrative example offers a comparative study of the optimum cost for varying shortage cost.     

A large-scale application of the partial coverage uncapacitated facility location problem

The traditional, uncapacitated facility location problem (UFLP) seeks to determine a set of warehouses to open such that all retail stores are serviced by a warehouse and the sum of the fixed costs of opening and operating the warehouses and the variable costs of supplying the retail stores from the opened warehouses is minimized. In this paper, we discuss the partial coverage uncapacitated facility location problem (PCUFLP) as a generalization of the uncapacitated facility location problem in which not all the retail stores must be satisfied by a warehouse. Erlenkotter's dual-ascent algorithm, DUALOC, will be used to solve optimally large (1600 stores and 13?000 candidate warehouses) real-world implemented PCUFLP applications in less than two minutes on a 500?MHz PC. Furthermore, a simple analysis of the problem input data will indicate why and when efficient solutions to large PCUFLPs can be expected.     

Determining optimal lot size for a two-warehouse system with deterioration and shortages using net present value

In this paper, we develop a deterministic inventory model for deteriorating items with two warehouses by minimizing the net present value of the total cost. Deterioration rates of items in the two warehouses may be different. In addition, we allow for shortages and complete backlogging. We then prove that the optimal replenishment policy not only exists but also is unique under some condition. Further, the result reveals that the reorder interval based on the average total cost, if it exists, must be longer than that derived using net present value. Finally, we use Yang’s [H.L. Yang, European Journal of Operational Research 157 (2004) 344–356] numerical example to illustrate the model and conclude the paper with suggestions for possible future research.     

Redesigning a warehouse network

To take advantage of economies of scale, a growing number of firms have begun to explore the possibility of integrating supply chain activities. The advent of such a possibility would necessitate the redesign of a warehouse network. Typically, a warehouse redesign problem involves the consolidation of regional warehouses into a fewer number of master stocking points and the subsequent phase-out of redundant or underutilized warehouses without deteriorating customer services. This paper develops a mixed-integer programming model to solve the warehouse redesign problem. The usefulness of the model was validated by its successful application to a real-world problem and by its sensitivity analyses when used with changing scenarios within a warehouse network configuration.     

Using a TSP heuristic for routing order pickers in warehouses

In this paper, we deal with the sequencing and routing problem of order pickers in conventional multi-parallel-aisle warehouse systems. For this NP-hard Steiner travelling salesman problem (TSP), exact algorithms only exist for warehouses with at most three cross aisles, while for other warehouse types literature provides a selection of dedicated construction heuristics. We evaluate to what extent reformulating and solving the problem as a classical TSP leads to performance improvements compared to existing dedicated heuristics. We report average savings in route distance of up to 47% when using the LKH (Lin–Kernighan–Helsgaun) TSP heuristic. Additionally, we examine if combining problem-specific solution concepts from dedicated heuristics with high-quality local search features could be useful. Lastly, we verify whether the sophistication of ‘state-of-the-art’ local search heuristics is necessary for routing order pickers in warehouses, or whether a subset of features suffices to generate high-quality solutions.     

Development of an Air Force Warehouse Logistics Index to continuously improve logistics capabilities

For the effective operation of air power in the modern war, the logistics systems of Air Force warehouses need to be well-maintained. The best logistics system can be established through continuous improvements in logistics capabilities. Although there have been some studies on key performance indicators for logistics capability, they have neither considered the structural relationship among various influential factors, nor the feedback mechanisms in warehouse logistics capabilities. In this study, we propose a structural equations model (SEM) to develop an Air Force Warehouse Logistics Index (WLI). The concept of a Customer Satisfaction Index is used to assess the WLI for strategic improvement plans for various warehouse groups. It is expected that our model can be used to evaluate the logistics support capability of ROKAF (Republic of Korea Air Force) warehouses and contribute to warehouse modernization plans.     

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

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

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.     

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.     

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.     

Integrated location and two-echelon inventory network design under uncertainty

In this paper, we propose a two-stage stochastic model to address the design of an integrated location and two-echelon inventory network under uncertainty. The central issue in this problem is to design and operate an effective and efficient multi-echelon supply chain distribution network and to minimize the expected system-wide cost of warehouse location, the allocation of warehouses to retailers, transportation, and two-echelon inventory over an infinite planning horizon. We structure this problem as a two-stage nonlinear discrete optimization problem. The first stage decides the warehouses to open and the second decides the warehouse-retailer assignments and two-echelon inventory replenishment strategies. Our modeling strategy incorporates various probable scenarios in the integrated multi-echelon supply chain distribution network design to identify solutions that minimize the first stage costs plus the expected second stage costs. The two-echelon inventory cost considerations result in a nonlinear objective which we linearize with an exponential number of variables. We solve the problem using column generation. Our computational study indicates that our approach can solve practical problems of moderate-size with up to twenty warehouse candidate locations, eighty retailers, and ten scenarios efficiently.     

Tabu search heuristics for the order batching problem in manual order picking systems

In a manual order picking system, order pickers walk or ride through a distribution warehouse in order to collect items requested by (internal or external) customers. In order to perform these operations efficiently, it is usually required that customer orders be combined into (more substantial) picking orders that are limited in size. The order batching problem considered in this paper deals with the question of how a given set of customer orders should be combined into picking orders such that the total length of all picker tours necessary for all of the requested items to be collected is minimized. For the solution of this problem the authors suggest two approaches based on the tabu search principle. The first is a (classic) tabu search (TS), and the second is the attribute-based hill climber (ABHC). In a series of extensive numerical experiments, these approaches are benchmarked against other solution methods put forward in the current literature. It is demonstrated that the proposed methods are superior to the existing methods and provide solutions which may allow distribution warehouses to operate more efficiently.     

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.     

A note on “Two-warehouse inventory model with deterioration under FIFO dispatch policy”

A recently published paper by Lee [C.C. Lee, Two-warehouse inventory model with deterioration under FIFO dispatching policy, European Journal of Operational Research 174 (2006) 861–873] considers different dispatching models for the two-warehouse inventory system with deteriorating items, in which Pakkala and Achary’s LIFO (last-in–first-out) model [T.P.M. Pakkala, K.K. Achary, A deterministic inventory model for deteriorating items with two warehouses and finite replenishment rate, European Journal of Operational Research 57 (1992) 71–76] is first modified, and then the author concludes that the modified LIFO model always has a lower cost than Pakkala and Achary’s LIFO model under a particular condition specified by him. The present note points out that this conclusion is incorrect and misleading. Alternatively, we provide a new sufficient condition such that the modified LIFO model always has a lower cost than Pakkala and Achary’s model. Besides, we also compare Pakkala and Achary’s original LIFO model with Lee’s FIFO (first-in–first-out) model for the special case where the two warehouses have the same deteriorating rates. Finally, numerical examples are provided to investigate and examine the impact of corresponding parameters on policy choice. The results in this note give a much clearer picture than those at Lee’s paper about the relationships between the different dispatching policies for the two-warehouse inventory system with deterioration items.     

Routing order pickers in a warehouse with a middle aisle

This paper considers a parallel aisle warehouse, where order pickers can change aisles at the ends of every aisle and also at a cross aisle halfway along the aisles. An algorithm is presented that can find shortest order picking tours in this type of warehouses. The algorithm is applicable in warehouse situations with up to three aisle changing possibilities. Average tour length is compared for warehouses with and without a middle aisle. It appears that in many cases the average order picking time can be decreased significantly by adding a middle aisle to the layout.     

Exact results for the order picking time distribution under return routing

This paper derives exact expressions for the Laplace-Stieltjes transform of the order picking time in single- and 2-block warehouses. We consider manual warehouses that deploy return routing and assume that order sizes follow a Poisson distribution. The results in this paper apply to a wide range of storage policies, including but not restricted to class-based and random storage. Furthermore, we compare the performance of the storage policies and warehouse lay-outs by using numerical inversion of the Laplace-Stieltjes transforms.