رویکرد مبتنی بر تقریب برای مشکل برنامه ریزی تولید چنددوره فازی با هدف اعتبار
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|5641||2010||14 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 9188 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
- تولید محتوا با مقالات ISI برای سایت یا وبلاگ شما
- تولید محتوا با مقالات ISI برای کتاب شما
- تولید محتوا با مقالات ISI برای نشریه یا رسانه شما
پیشنهاد می کنیم کیفیت محتوای سایت خود را با استفاده از منابع علمی، افزایش دهید.
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Applied Mathematical Modelling, Volume 34, Issue 11, November 2010, Pages 3202–3215
This paper develops a fuzzy multi-period production planning and sourcing problem with credibility objective, in which a manufacturer has a number of plants or subcontractors. According to the credibility service levels set by customers in advance, the manufacturer has to satisfy different product demands. In the proposed production problem, production cost, inventory cost and product demands are uncertain and characterized by fuzzy variables. The problem is to determine when and how many products are manufactured so as to maximize the credibility of the fuzzy costs not exceeding a given allowable invested capital, and this credibility can be regarded as the investment risk criteria in fuzzy decision systems. In the case when the fuzzy parameters are mutually independent gamma distributions, we can turn the service level constraints into their equivalent deterministic forms. However, in this situation the exact analytical expression for the credibility objective is unavailable, thus conventional optimization algorithms cannot be used to solve our production planning problems. To overcome this obstacle, we adopt an approximation scheme to compute the credibility objective, and deal with the convergence about the computational method. Furthermore, we develop two heuristic solution methods. The first is a combination of the approximation method and a particle swarm optimization (PSO) algorithm, and the second is a hybrid algorithm by integrating the approximation method, a neural network (NN), and the PSO algorithm. Finally, we consider one 6-product source, 6-period production planning problem, and compare the effectiveness of two algorithms via numerical experiments.
Production planning is viewed as the plans and arrangements of the production mission and progress in production scheduled time. In recent years, uncertain production planning has received much attention in the field of production planning management, where uncertainty can be present as randomness and fuzziness in the production environments. This uncertainty will result in more realistic production planning models. However, the inclusion of uncertainty in the production system parameters is a more difficult task in terms of modeling and solving. Over the years, there has been much research and many applications with the aim of modeling the uncertainty in the production planning problems, including material requirements planning models  and , hierarchical production planning models  and , aggregate production planning model , supply chain models  and , and other well-known production planning models in the literature . To handle probabilistic uncertainty in production decision systems, some meaningful stochastic production planning models have been documented in the literature. Bitran  dealt with a stochastic production planning problem with a service level requirement and provided non-sequential and deterministic equivalent formulations of the model; Schmidt  presented a Markov decision process model that combines features of engineering design models and aggregate production planning models to obtain a hybrid model that links biological and engineering parameters to optimize operations performance; Yildrim et al.  studied a stochastic multi-period production planning and sourcing problem of a manufacturer with a number of plants or subcontractors and presented a methodology that a manufacturer can utilize to make its production and sourcing decisions, and Kelly et al.  extended the economic lot scheduling problem for the single-machine multi-product case with random demands, their objective was to find the optimal length of production cycles that minimizes the sum of set-up costs and inventory holding costs per unit of time and satisfies the demand of products at the required service levels. On the other hand, with the development of fuzzy set and possibility theories ,  and , a number of researchers realized the importance to handle possibilistic uncertainty in decision systems, and applied the fuzzy theory to various production planning problems. Wang and Fang  presented a fuzzy linear programming model for solving the aggregate production planning problem with multiple objectives; Inuiguchi et al.  discussed the merits of possibilistic programming approach to production planning problems and applied a possibilistic programming based on possibility and necessity measures to solve the production planning problem. The reader who is interested in related issues in this field may refer to ,  and . Since the credibility of fuzzy event and the expected value of fuzzy variable was defined in , an axiomatic approach called credibility theory has been developed in recent years (see  and ). Some interesting applications about credibility in production decision systems have been studied in the literature such as  and . Maity et al.  proposed an optimal control approach to optimizing the production, recycling and disposal strategy so that the total expected profit is maximized, and Mandal et al.  developed an optimal production inventory model with fuzzy time period and fuzzy inventory costs for defective items and solved it under fuzzy space constraint. In the current development, we take credibility theory as the theoretical foundation of fuzzy optimization and formulate a novel class of multi-period production planning problems with credibility objective, in which product demands, production and inventory costs are uncertain and characterized by fuzzy variables. The objective of the problem is to maximize the credibility of the fuzzy costs not exceeding a given allowable invested capital, and this credibility can be regarded as the investment risk criteria under fuzzy environment. In general, the credibility functions in the service level constraints are difficult to compute, so we discuss the cases when demands are independent gamma fuzzy variables. In this situation, we can transform the credibility service level constraints to their equivalent deterministic forms. However, the analytical expression about the credibility objective is unavailable, and the equivalent production planning problem is neither linear nor convex, thus conventional optimization algorithms cannot be employed to solve it. Therefore, two heuristic solution methods are designed to solve the proposed production planning model. The first is the PSO algorithm (see  and ) combining with the approximation method , and the second is the hybrid PSO algorithm by integrating both the approximation method and an NN. One 6-product source, 6-period production planning problem is provided to compare the effectiveness of the designed algorithms. The plan of this paper is as follows. Section 2 formulates a new class of fuzzy production planning models. In Section 3, we discuss the computation for the credibility objective of the production planning model, and deal with the convergence of computational method. In addition, due to the complexity of the proposed production planning problem, two heuristic solution methods are designed in this section. The first is the PSO algorithm based on the approximation method, and the second is a hybrid algorithm by integrating the approximation method, an NN and the PSO algorithm. Section 4 presents one 6-product source, 6-period production planning problem to compare the effectiveness of two algorithms. Section 5 concludes the paper.
نتیجه گیری انگلیسی
When optimal production decisions must be reached in an environment beset with possibilistic uncertainty, not only the formulation of the decision model requires a deeper probing of the aspirations criteria in order to give to the optimization problem its appropriate form, but often significant computational obstacles must be overcome to find optimal production decisions. In these two aspects, the major new contributions of the current development are as follows. (i)Based on credibility criteria in the model formulation, we developed a new class of fuzzy production planning problems, in which the production cost, inventory cost and product demands were characterized by fuzzy variables. In addition, a manufacturer has a number of plants and subcontractors and has to meet the product demands according to various credibility service levels prescribed by its customers. (ii) When product demands are mutually independent gamma fuzzy variables, we have turned the credibility level constraints into their equivalent deterministic forms (see Theorem 1 and Theorem 2). However, in this situation, the analytical expression about the credibility objective of problem (2) is still unavailable. To overcome this obstacle, the approximation method is adopted to compute the credibility objective. The reasonableness about the method has also been discussed (see Theorem 3). (iii) Since production planning problem (14) is neither linear nor convex, conventional optimization algorithms cannot be employed to solve it. In this paper, two heuristic solution methods were designed to solve problem (14). Algorithm 1 is a combination of the approximation method and the PSO algorithm, while Algorithm 2 integrates the the approximation method, an NN and the PSO algorithm. The numerical experiments about problem (14) have been made to compare the effectiveness of two algorithms. The computational results demonstrated that the optimal objective values obtained by Algorithm 1 and Algorithm 2 have no obvious deviations, but Algorithm 2 can save much time compared with Algorithm 1. From the computational viewpoint, we concluded that Algorithm 2 is more effective than Algorithm 1 when we employed them to solve production planning problem (14).