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.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.
[Show abstract][Hide abstract] ABSTRACT: In this study, a multi-item economic order quantity model with shortage under vendor managed inventory policy in a single vendor single buyer supply chain is developed. This model explicitly includes warehouse capacity and delivery constraints, bounds order quantity, and limits the number of pallets. Not only the demands are considered imprecise, but also resources such as available storage and total order quantity of all items can be vaguely defined in different ways. An ant colony optimization is employed to find a near-optimum solution of the fuzzy nonlinear integer-programming problem with the objective of minimizing the total cost of the supply chain. Since no benchmark is available in the literature, a genetic algorithm is developed as well to validate the result obtained. Furthermore, the applicability of the proposed methodology along with a sensitivity analysis on its parameter is shown by four numerical examples containing different numbers of items.
International Journal of Production Economics 09/2014; 155(C):259-271. DOI:10.1016/j.ijpe.2013.07.017 · 2.75 Impact Factor
"Meta-heuristic algorithms have been suggested to solve some of the existing developed inventory problems in the literature. Some of these algorithms are: Tabu search   , genetic algorithms (GA)    , simulating annealing (SA)   , evolutionary algorithm  , threshold accepting , neural networks , ant colony optimization , fuzzy simulation , and harmony search [34 35, 36, 37, 38]. "
[Show abstract][Hide abstract] ABSTRACT: In this paper, a multi-item multi-period inventory control model is developed for known-deterministic variable demands under limited available budget. Assuming the order quantity is more than the shortage quantity in each period, the shortage in combination of backorder and lost sale is considered. The orders are placed in batch sizes and the decision variables are assumed integer. Moreover, all unit discount for a number of products and incremental quantity discount for some other items are considered. While the objectives are to minimize both the total inventory cost and the required storage space, the model is formulated into a fuzzy multi-criteria decision making (FMCDM) framework and is shown to be a mixed integer nonlinear programming type. In order to solve the model, a multi-objective particle swarm optimization (MOPSO) approach is applied. A set of compromise solution including optimum and near optimum ones via MOPSO has been derived for some numerical illustration, where the results are compared with those obtained using a weighting approach. To assess the efficiency of the proposed MOPSO, the model is solved using multi-objective genetic algorithm (MOGA) as well. A large number of numerical examples are generated at the end, where graphical and statistical approaches show more efficiency of MOPSO compared with MOGA.
The Scientific World Journal 06/2014; 2014(ID 136047):17. DOI:10.1155/2014/136047 · 1.73 Impact Factor
"Sale representatives visiting grocery stores randomly to advertize his/her goods and receiving orders is an example of this situation. In this regard, Taleizadeh et al. (2008a) considered a multi-product system in which the space and the service level for each product were constraints and a combination of backorders and lost sales was allowed. They modeled the problem and employed a simulated annealing approach to solve it. "
[Show abstract][Hide abstract] ABSTRACT: In this paper, a multi-product multi-chance constraint stochastic inventory control problem is considered, in which the time-periods between two replenishments are assumed independent and identically distributed random variables. For the problem at hand, the decision variables are of integer-type, the service-level is a chance constraint for each product, and the space limitation is another constraint of the problem. Furthermore, shortages are allowed in the forms of fuzzy random quantities of lost sale that are backordered. The developed mathematical formulation of the problem is shown to be a fuzzy random integer-nonlinear programming model. The aim is to determine the maximum level of inventory for each product such that the total profit under budget and service level constraints is maximized. In order to solve the model, a hybrid method of fuzzy simulation, stochastic simulation, and particle swarm optimization approach (Hybrid FS-SS-PSO) is used. At the end, several numerical illustrations are given to demonstrate the applicability of the proposed methodology and to compare its performances with the ones of another hybrid algorithm as a combination of fuzzy simulation, stochastic simulation, and genetic algorithm (FS-SS-GA). The results of the numerical illustrations show that FS-SS-PSO performs better than FS-SS-GA in terms of both objective functions and CPU time.
Knowledge-Based Systems 11/2013; 53(C):147-156. DOI:10.1016/j.knosys.2013.08.027 · 2.95 Impact Factor