الگوریتم ژنتیک ترکیبی و روش جستجوی خطی برای برنامه ریزی تولید صنعتی با تابع غیر خطی
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|26828||2009||11 صفحه PDF||سفارش دهید||6296 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Engineering Applications of Artificial Intelligence, Volume 22, Issues 4–5, June 2009, Pages 767–777
Many engineering, science, information technology and management optimization problems can be considered as non-linear programming real-world problems where all or some of the parameters and variables involved are uncertain in nature. These can only be quantified using intelligent computational techniques such as evolutionary computation and fuzzy logic. The main objective of this research paper is to solve non-linear fuzzy optimization problem where the technological coefficient in the constraints involved are fuzzy numbers, which was represented by logistic membership functions using the hybrid evolutionary optimization approach. To explore the applicability of the present study, a numerical example is considered to determine the production planning for the decision variables and profit of the company.
It is well known that optimization problems arise in a variety of situations. Particularly interesting are those concerning management problems as decision makers usually state their data in a vague way: “high benefits”, “as low as possible”, “important savings”, etc. Because of this vagueness, managers prefer to have not just one solution but as many of them, so that the most suitable solution can be applied according to the state of existing decision of the production process at a given time and without increasing delay. In these situations fuzzy optimization is an ideal methodology, since it allows us to represent the underlying uncertainty of the optimization problem, while finding optimal solutions that reflect such uncertainty and then applying them to possible instances, once the uncertainty has been solved. This allows us to obtain a model of the behavior of the solutions based on the uncertainty of the optimization problem. Fuzzy constrained optimization problems have been extensively studied since the seventies. In the linear case, the first approaches to solve the so-called fuzzy linear programming problem appeared in Bellman and Zadeh (1970), Tanaka et al. (1974) and Zimmermann (1976). Since then, important contributions solving different linear models have been made and these models have been the subject of a substantial amount of work. In the non-linear case (Ali, 1998; Ekel et al., 1998; Ramik and Vlach, 2002) the situation is quite different, as there is a wide variety of specific and both practically and theoretically relevant non-linear problems, with each having a different solution method. In this paper, the new methodology of modified S-curve membership function using fuzzy linear programming in production planning and their applications to decision making are carried out. Especially, fuzzy non-linear programming (NPL) based on vagueness in the fuzzy parameters such as objective coefficients, technical coefficients and resource variables given by a decision maker is analyzed. Various types of membership functions were used in fuzzy linear programming problem and its application such as a linear membership function (Zimmermann, 1976 and Zimmermann, 1978), a tangent type of a membership function (Leberling, 1981), an interval linear membership function (Hannan, 1981), an exponential membership function (Carlsson and Korhonen, 1986), inverse tangent membership function (Sakawa, 1983), logistic type of membership function (Watada, 1997), concave piecewise linear membership function (Inuiguchi et al., 1990) and piecewise linear membership function (Hu and Fang, 1999). As a tangent type, of a membership function, an exponential membership function, and hyperbolic membership function are non-linear function; a fuzzy mathematical programming defined with a non-linear membership function results in a non-linear programming. Usually a linear membership function is employed in order to avoid non-linearity. Nevertheless, there are some difficulties in selecting the solution of a problem written in a linear membership function. Therefore, in this paper a modified S-curve membership function is employed to overcome such deficits, which a linear membership function has. Furthermore, the S-curve membership function is more flexible enough to describe the vagueness in the fuzzy parameters for the production planning problems (Vasant, 2006 and Vasant, 2003). Due to limitations in resources for manufacturing a product and the need to satisfy certain conditions in manufacturing and demand, a problem of fuzziness occurs in industrial production planning systems. This problem occurs also in chocolate manufacturing when deciding a mixed selection of raw materials to produce varieties of products. This is referred to here as the Product-mix Selection Problem (Tabucanon, 1996). The objective of the company is to maximize its profit, which is, alternatively, equivalent to maximizing the gross contribution to the company in terms of US$. That is, to find the optimal product mix under uncertain constraints in the technical, raw material and market consideration. Furthermore, it is possible to show the relationship between the optimal profits and the corresponding membership values (Zimmermann, 1978). According to this relationship, the decision maker can then obtain his optimal solution with a trade-off under a pre-determined allowable imprecision.
نتیجه گیری انگلیسی
The hybrid genetic algorithm with the line search approach has improved the fitness value obtained by genetic algorithms alone. The proposed hybrid optimization approach proved to be an extremely robust and excellent efficient method for non-linear industrial production planning problems. Both GA and LS manage to converge to better realistic solutions than those achieved by GA or LS alone at a reduced computational effort compared to the LS procedure. The combination of GA with LS is particularly promising in bad initial solutions due the speedy convergence of GA towards the neighborhood of the optimum and the property of LS to compute quickly the nearest optimum once in the neighborhood of the solution. However, the best optimal fitness function value obtained by the hybrid genetic algorithms approach is similar to the line search approach. The advantage of the GA–LS approach is on the speedy computational time for the profit objective function and feasible decision variable solutions. There is no improvement on the value of the decision variables in the hybrid genetic algorithm approach compared to the line search approach. Therefore, the authors strongly believe that there should be another hybrid approach to improve the solution for the decision variables in real-world situation. Further research will investigate these real-world solutions.