Optimizing multi-product multi-constraint inventory control systems with stochastic replenishments

Journal of Applied Sciences 07/2008; 8(7):1228-1234. DOI: 10.3923/jas.2008.1228.1234
Source: DOAJ

ABSTRACT Multi-periodic inventory control problems are mainly studied employing two assumptions. The first is the continuous review, where depending on the inventory level orders can happen at any time and the other is the periodic review, where orders can only happen at the beginning of each period. In this study, we relax these assumptions and assume that the periodic replenishments are stochastic in nature. Furthermore, we assume that the periods between two replenishments are independent and identically random variables. For the problem at hand, the decision variables are of integer-type and there are two kinds of space and service level constraints for each product. We develop a model of the problem in which a combination of back-order and lost-sales are considered for the shortages. Then, we show that the model is of an integer-nonlinear-programming type and in order to solve it, a search algorithm can be utilized. We employ a simulated annealing approach and provide a numerical example to demonstrate the applicability of the proposed methodology.


Available from: Seyed Taghi Akhavan Niaki, Jun 12, 2015
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, a multi-product continuous review inventory control problem within batch arrival queuing approach (MQr /M/1) is developed to find the optimal quantities of maximum inventory. The objective function is to minimise summation of ordering, holding and shortage costs under warehouse space, service level and expected lost-sales shortage cost constraints from retailer and warehouse viewpoints. Since the proposed model is Non-deterministic Polynomial-time hard, an efficient imperialist competitive algorithm (ICA) is proposed to solve the model. To justify proposed ICA, both ganetic algorithm and simulated annealing algorithm are utilised. In order to determine the best value of algorithm parameters that result in a better solution, a fine-tuning procedure is executed. Finally, the performance of the proposed ICA is analysed using some numerical illustrations
    International Journal of Systems Science 06/2013; DOI:10.1080/00207721.2013.809614 · 1.58 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The purpose of this paper is to develop a multi-item economic order quantity (EOQ) model with shortage for a single-buyer single-supplier supply chain under green vendor managed inventory (VMI) policy. This model explicitly includes the VMI contractual agreement between the vendor and the buyer such as warehouse capacity and delivery constraints, bounds for each order, and limits on the number of pallets. To create a kind of green supply chain, tax cost of greenhouse gas (GHG) emissions and limitation on total Emissions of all items are considered in the model. A hybrid genetic and imperialist competitive algorithm (HGA) is employed to find a near-optimum solution of a nonlinear integer-programming (NIP) with the objective of minimizing the total cost of the supply chain. Since no benchmark is available in the literature, a genetic algorithm (GA) is developed as well to validate the result obtained. For further validation, the outcomes are also compared to lower bounds that are found using a relaxed model in which all variables are treated continuous. At the end, numerical examples are presented to demonstrate the application of the proposed methodology. Our results proved that the proposed hybrid procedure was able to find better and nearer optimal solutions.
    Applied Soft Computing 05/2015; 30(C):353-364. DOI:10.1016/j.asoc.2015.02.004 · 2.68 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: There are two main assumptions in multiperiodic inventory control problems. The first is the continuous review, where, depending on the inventory level, orders can happen at any time, and the other is the periodic review, where orders can only happen at the beginning of each period. In this paper, these assumptions are relaxed, and the periods between two replenishments are assumed independent and identically distributed random variables. Furthermore, the decision variables are assumed integer-type and that there are two kinds of space and budget constraints. The incremental discounts to purchase products are considered, and a combination of backorder and lost sales are taken into account for the shortages. The model of this problem is shown to be a mixed integer-nonlinear programming type, and in order to solve it, both genetic algorithm and simulated annealing approaches are employed. At the end, two numerical examples are given to demonstrate the applicability of the proposed methodologies in which genetic algorithm method performs better than simulated annealing in terms of objective function values.
    International Journal of Advanced Manufacturing Technology 11/2010; 51(1):311-323. DOI:10.1007/s00170-010-2604-8 · 1.78 Impact Factor