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.     

Optimizing inventory decisions in a two-level supply chain with order quantity constraints

A fundamental assumption in traditional inventory models is that all of the ordered items are of perfect quality. A two-level supply chain is considered consists of one retailer and a collection of suppliers that operate within a finite planning horizon, including multiple periods, and a model is formulated that simultaneously determines both supplier selection and inventory allocation problems in the supply chain. It is supposed that the ordered products dependent on the suppliers include a certain percentage of imperfect quality products and have different prices. In this paper, we study the impact of the retailer’s financial constraint. On the other hand, suppliers have restricted capacities and set minimum order quantity (MOQ) policy for the retailer’s order amount happened in each period. So, the problem is modeled as a mixed integer nonlinear programming. The purpose of this model is to maximize the total profit. The nutrients, fishery and fruitage industries give good examples for the proposed model. A numerical example is presented to indicate the efficiency of the proposed model. Considering the complexity of the model, a genetic algorithm (GA) is presented to solve the model. We demonstrate analytically that the proposed genetic algorithm is suitable in the feasible situations.     

An interactive method for inventory control with fuzzy lead-time and dynamic demand

Normally, the real-world inventory control problems are imprecisely defined and human interventions are often required to solve these decision-making problems. In this paper, a realistic inventory model with imprecise demand, lead-time and inventory costs have been formulated and an inventory policy is proposed to minimize the cost using man–machine interaction. Here, demand increases with time at a decreasing rate. The imprecise parameters of lead-time, inventory costs and demand are expressed through linear/non-linear membership functions. These are represented by different types of membership functions, linear or quadratic, depending upon the prevailing supply condition and marketing environment. The imprecise parameters are first transformed into corresponding interval numbers and then following the interval mathematics, the objective function for average cost is changed into respective multi-objective functions. These functions are minimized and solved for a Pareto-optimum solution by interactive fuzzy decision-making procedure. This process leads to man–machine interaction for optimum and appropriate decision acceptable to the decision maker’s firm. The model is illustrated numerically and the results are presented in tabular forms.     

Modeling inventory routing problems in supply chains of high consumption products

Given a distribution center and a set of sales-points with their demand rates, the objective of the inventory routing problem (IRP) is to determine a distribution plan that minimizes fleet operating and average total distribution and inventory holding costs without causing a stock-out at any of the sales-points during a given planning horizon. We propose a new model for the long-term IRP when demand rates are stable and economic order quantity-like policies are used to manage inventories of the sales-points. The proposed model extends the concept of vehicle routes (tours) to vehicle multi-tours. To solve the nonlinear mixed integer formulation of this problem, a column generation based approximation method is suggested. The resulting sub-problems are solved using a savings-based approximation method. The approach is tested on randomly generated problems with different settings of some critical factors to compare our model using multi-tours as basic constructs to the model using simple tours as basic constructs.     

Two storage inventory model in a mixed environment

Multi-item inventory models with two storage facility and bulk release pattern are developed with linearly time dependent demand in a finite time horizon under crisp, stochastic and fuzzy-stochastic environments. Here different inventory parameters—holding costs, ordering costs, purchase costs, etc.—are assumed as probabilistic or fuzzy in nature. In particular cases stochastic and crisp models are derived. Models are formulated as profit maximization principle and three different approaches are proposed for solution. In the first approach, fuzzy extension principle is used to find membership function of the objective function and then it’s Graded Mean Integration Value (GMIV) for different optimistic levels are taken as equivalent stochastic objectives. Then the stochastic model is transformed to a constraint multi-objective programming problem using Stochastic Non-linear Programming (SNLP) technique. The multi-objective problems are transferred to single objective problems using Interactive Fuzzy Satisfising (IFS) technique. Finally, a Region Reducing Genetic Algorithm (RRGA) based on entropy has been developed and implemented to solve the single objective problems. In the second approach, the above GMIV (which is stochastic in nature) is optimized with some degree of probability and using SNLP technique model is transferred to an equivalent single objective crisp problem and solved using RRGA. In the third approach, objective function is optimized with some degree of possibility/necessity and following this approach model is transformed to an equivalent constrained stochastic programming problem. Then it is transformed to an equivalent single objective crisp problem using SNLP technique and solved via RRGA. The models are illustrated with some numerical examples and some sensitivity analyses have been presented.     

A GA based penalty function technique for solving constrained redundancy allocation problem of series system with interval valued reliability of components

In this paper, we have considered the problem of constrained redundancy allocation of series system with interval valued reliability of components. For maximizing the overall system reliability under limited resource constraints, the problem is formulated as an unconstrained integer programming problem with interval coefficients by penalty function technique and solved by an advanced GA for integer variables with interval fitness function, tournament selection, uniform crossover, uniform mutation and elitism. As a special case, considering the lower and upper bounds of the interval valued reliabilities of the components to be the same, the corresponding problem has been solved. The model has been illustrated with some numerical examples and the results of the series redundancy allocation problem with fixed value of reliability of the components have been compared with the existing results available in the literature. Finally, sensitivity analyses have been shown graphically to study the stability of our developed GA with respect to the different GA parameters.     

Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph

In this paper a mixed integer set resulting from the intersection of a single constrained mixed 0–1 set with the vertex packing set is investigated. This set arises as a subproblem of more general mixed integer problems such as inventory routing and facility location problems. Families of strong valid inequalities that take into account the structure of the simple mixed integer set and that of the vertex packing set simultaneously are introduced. In particular, the well-known mixed integer rounding inequality is generalized to the case where incompatibilities between binary variables are present. Exact and heuristic algorithms are designed to solve the separation problems associated to the proposed valid inequalities. Preliminary computational experiments show that these inequalities can be useful to reduce the integrality gaps and to solve integer programming problems.     

Optimizing multi-item multi-period inventory control system with discounted cash flow and inflation: Two calibrated meta-heuristic algorithms

A mixed binary integer mathematical programming model is developed in this paper for ordering items in multi-item multi-period inventory control systems, in which unit and incremental quantity discounts as well as interest and inflation factors are considered. Although the demand rates are assumed deterministic, they may vary in different periods. The situation considered for the problem at hand is similar to a seasonal inventory control model in which orders and sales happen in a given season. To make the model more realistic, three types of constraints including storage space, budget, and order quantity are simultaneously considered. The goal is to find optimal order quantities of the products so that the net present value of total system cost over a finite planning horizon is minimized. Since the model is NP-hard, a genetic algorithm (GA) is presented to solve the proposed mathematical problem. Further, since no benchmarks can be found in the literature to assess the performance of the proposed algorithm, a branch and bound and a simulated annealing (SA) algorithm are employed to solve the problem as well. In addition, to make the algorithms more effective, the Taguchi method is utilized to tune different parameters of GA and SA algorithms. At the end, some numerical examples are generated to analyze and to statistically and graphically compare the performances of the proposed solving algorithms.     

Relief inventory modelling with stochastic lead-time and demand

The irregular demand and communication network disruption that are characteristics of situations demanding humanitarian logistics, particularly after large-scale earthquakes, present a unique challenge for relief inventory modelling. However, there are few quantitative inventory models in humanitarian logistics, and assumptions inherent in commercial logistics naturally have little applicability to humanitarian logistics. This paper develops a humanitarian disaster relief inventory model that assumes a uniformly distributed function in both lead-time and demand parameters, which is appropriate considering the limited historical data on relief operation. Furthermore, this paper presents different combinations of lead-time and demand scenarios to demonstrate the variability of the model. This is followed by the discussion of a case study wherein the decision variables are evaluated and sensitivity analysis is performed. The results reveal the presence of a unique reorder level in the inventory wherever the order quantity is insensitive to some lead-time demand values, providing valuable direction for humanitarian relief planning efforts and future research.     

An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem

We study a selective and periodic inventory routing problem (SPIRP) and develop an Adaptive Large Neighborhood Search (ALNS) algorithm for its solution. The problem concerns a biodiesel production facility collecting used vegetable oil from sources, such as restaurants, catering companies and hotels that produce waste vegetable oil in considerable amounts. The facility reuses the collected waste oil as raw material to produce biodiesel. It has to meet certain raw material requirements either from daily collection, or from its inventory, or by purchasing virgin oil. SPIRP involves decisions about which of the present source nodes to include in the collection program, and which periodic (weekly) routing schedule to repeat over an infinite planning horizon. The objective is to minimize the total collection, inventory and purchasing costs while meeting the raw material requirements and operational constraints. A single-commodity flow-based mixed integer linear programming (MILP) model was proposed for this problem in an earlier study. The model was solved with 25 source nodes on a 7-day cyclic planning horizon. In order to tackle larger instances, we develop an ALNS algorithm that is based on a rich neighborhood structure with 11 distinct moves tailored to this problem. We demonstrate the performance of the ALNS, and compare it with the MILP model on test instances containing up to 100 source nodes.     

A Lagrangian relaxation approach to multi-period inventory/distribution planning

We consider a multi-period inventory/distribution planning problem (MPIDP) in a one-warehouse multiretailer distribution system where a fleet of heterogeneous vehicles delivers products from a warehouse to several retailers. The objective of the MPIDP is to minimise transportation costs for product delivery and inventory holding costs at retailers over the planning horizon. In this research, the problem is formulated as a mixed integer linear programme and solved by a Lagrangian relaxation approach. A subgradient optimisation method is employed to obtain lower bounds. We develop a Lagrangian heuristic algorithm to find a good feasible solution of the MPIDP. Computational experiments on randomly generated test problems showed that the suggested algorithm gave relatively good solutions in a reasonable amount of computation time.     

Fuzzy inventory model with two warehouses under possibility measure on fuzzy goal

Multi-item inventory model with stock-dependent demand and two-storage facilities is developed in fuzzy environment (purchase cost, investment amount and storehouse capacity are imprecise) under inflation and time value of money. Joint replenishment and simultaneous transfer of items from one warehouse to another is proposed using basic period (BP) policy. As some parameters are fuzzy in nature, objective (average profit) function as well as some constraints are imprecise in nature. Model is formulated as to optimize the possibility/necessity measure of the fuzzy goal of the objective function and constraints are satisfied with some pre-defined necessity. A genetic algorithm (GA) is developed with roulette wheel selection, binary crossover and mutation and is used to solve the model when the equivalent crisp form of the model is available. In other cases fuzzy simulation process is proposed to measure possibility/necessity of the fuzzy goal as well as to check the constraints of the problem and finally the model is solved using fuzzy simulation based genetic algorithm (FSGA). The models are illustrated with some numerical examples and some sensitivity analyses have been done.     

Two warehouse inventory models for single vendor multiple retailers with price and stock dependent demand

Here a single vendor multiple retailer inventory model of an item is developed where demand of the item at every retailer is linearly dependent on stock and inversely on some powers of selling price. Item is produced by the vendor and is distributed to the retailers following basic period policy. According to this policy item is replenished to the retailers at a regular time interval (T₁) called basic period (BP) and replenishment quantity is sufficient to last for the period T₁. Due to the scarcity of storage space at market places, every retailer uses a showroom at the market place and a warehouse to store the item, little away from the market place. Item is sold from the showroom and is filled up from the warehouse in a bulk release pattern. Some of the inventory parameters are considered as fuzzy in nature and model is formulated to maximize the average profit from the whole system. Imprecise objective is transformed to equivalent deterministic ones using possibility/necessity measure of fuzzy events with some degree of optimism/pessimism. A genetic algorithm (GA) is developed with roulette wheel selection, arithmetic crossover and random mutation and is used to solve the model. In some complex cases, with the help of above GA, fuzzy simulation process is used to derive the optimal decision. The model is illustrated through numerical examples and some sensitivity analyses are presented.     

An inventory model for a deteriorating item with displayed stock dependent demand under fuzzy inflation and time discounting over a random planning horizon

An inventory model for a deteriorating item (seasonal product) with linearly displayed stock dependent demand is developed in imprecise environment (involving both fuzzy and random parameters) under inflation and time value of money. It is assumed that time horizon, i.e., period of business is random and follows exponential distribution with a known mean. The resultant effect of inflation and time value of money is assumed as fuzzy in nature. The particular case, when resultant effect of inflation and time value is crisp in nature, is also analyzed. A genetic algorithm (GA) is developed with roulette wheel selection, arithmetic crossover, random mutation. For crisp inflation effect, the total expected profit for the planning horizon is maximized using the above GA to derive optimal inventory decision. On the other hand when inflationary effect is fuzzy then the above expected profit is fuzzy in nature too. Since optimization of fuzzy objective is not well defined, the optimistic/pessimistic return of the expected profit is obtained using possibility/necessity measure of fuzzy event. Fuzzy simulation process is proposed to determine this optimistic/pessimistic return. Finally a fuzzy simulation based GA is developed and is used to maximize the above optimistic/pessimistic return to get optimal decision. The models are illustrated with some numerical examples and some sensitivity analyses have been presented.     

A deterministic,multi-item inventory model with supplier selection and imperfect quality

This paper considers the scenario of supply chain with multiple products and multiple suppliers, all of which have limited capacity. We assume that received items from suppliers are not of perfect quality. Items of imperfect quality, not necessarily defective, could be used in another inventory situation. Imperfect items are sold as a single batch, prior to receiving the next shipment, at a discounted price. The demand over a finite planning horizon is known, and an optimal procurement strategy for this multi-period horizon is to be determined. Each of products can be sourced from a set of approved suppliers, a supplier-dependent transaction cost applies for each period in which an order is placed on a supplier. A product-dependent holding cost per period applies for each product in the inventory that is carried across a period in the planning horizon. Also a maximum storage space for the buyer in each period is considered. The decision maker, the buyer, needs to decide what products to order, in what quantities, with which suppliers, and in which periods. Finally, a genetic algorithm (GA) is used to solve the model.     

模糊环境下动态供应商选择的混合整数非线性规划模型

基于供应商选择问题的动态性和模糊性,考虑在每个周期内生产商的需求能力及供应商的供应能力为模糊变量,本文将一个多阶段多商品多渠道的供应商选择问题视为一个0-1混合整数模糊动态非线性规划问题,目标函数为总成本最小化。然后建立了0-1混合整数模糊动态非线性规划模型。为了求解该模型,通过可信性理论把模型中模糊机会约束清晰化,将该模型转化为一个确定型的0-1混合整数动态非线性规划模型。最后给出了一个数值算例验证了模型的可行性。     

Optimal policies for inventory systems with discretionary sales, random yield and lost sales

We determine replenishment and sales decisions jointly for an inventory system with random demand, lost sales and random yield. Demands in consecutive periods are independent random variables and their distributions are known. We incorporate discretionary sales, when inventory may be set aside to satisfy future demand even if some present demand may be lost. Our objective is to minimize the total discounted cost over the problem horizon by choosing an optimal replenishment and discretionary sales policy. We obtain the structure of the optimal replenishment and discretionary sales policy and show that the optimal policy for finite horizon problem converges to that of the infinite horizon problem. Moreover, we compare the optimal policy under random yield with that under certain yield, and show that the optimal order quantity （sales quantity） under random yield is more （less） than that under certain yield.     

Optimal policy for a two-facility inventory problem with storage constraints and two freight modes

This paper considers a two-facility supply chain for a single product in which facility 1 orders the product from facility 2 and facility 2 orders the product from a supplier in each period. The orders placed by each facility are delivered in two possible nonnegative integer numbers of periods. The difference between them is one period. Random demands in each period arise only at facility 1. There are physical storage constraints at both facilities in each period. The objective of the supply chain is to find an ordering policy that minimizes the expected cost over a finite horizon and the discounted stationary expected cost over an infinite horizon. We characterize the structure of the minimum expected cost and the optimal ordering policy for both the finite and the discounted stationary infinite horizon problems.     

Stability analysis of constrained inventory systems with transportation delay

Stability is a fundamental design property of inventory systems. However, the often exploited linearity assumptions in the current literature create a major gap between theory and practice. In this paper the stability of a constrained production and inventory system with a Forbidden Returns constraint (that is, a non-negative order rate) is studied via a piecewise linear model, an eigenvalue analysis and a simulation investigation. The APVIOBPCS (Automatic Pipeline, Variable Inventory and Order Based Production Control System) and EPVIOBPCS (Estimated Pipeline, Variable Inventory and Order Based Production Control System) replenishment policies are adopted. Surprisingly, all kinds of non-linear dynamical behaviours of systems can be observed in these simple models. Exact expressions of the asymptotic stability boundaries and Lyapunovian stability boundaries are derived when actual and perceived transportation lead-time is 1 and 2 periods long respectively. Asymptotically stable regions in the non-linear Forbidden Return systems are identical to the stable regions in its unconstrained counterpart. However, regions of bounded fluctuations that continue forever, including both periodicity and chaos, exist in the parametrical plane outside the asymptotically stable region. Simulation shows a complex and delicate structure in these regions. The results suggest that accurate lead-time information is essential to eliminate inventory drift and instability and that ordering policies have to be designed properly in accordance with the actual lead-time to avoid these fluctuations and divergence.