دانلود مقاله ISI انگلیسی شماره 50445
ترجمه فارسی عنوان مقاله

سیستم کنترل موجودی را به چندین شانس محدود اضافه می کند.

عنوان انگلیسی
Replenish-up-to multi-chance-constraint inventory control system under fuzzy random lost-sale and backordered quantities
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی
50445 2013 10 صفحه PDF
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Knowledge-Based Systems, Volume 53, November 2013, Pages 147–156

ترجمه کلمات کلیدی
فواصل بازپرداخت تصادفی، کنترل انبار، جزئی برگشت شبیه سازی تصادفی، شبیه سازی فازی، بهینه سازی ذرات ذرات، الگوریتم ژنتیک
کلمات کلیدی انگلیسی
Stochastic replenishment intervals; Inventory control; Partial back-ordering; Stochastic simulation; Fuzzy simulation; Particle swarm optimization; Genetic algorithm

چکیده انگلیسی

In this paper, a multiproduct 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.