یک کلاس از برنامه ریزی خطی محدود چندهدفه احتمالی با ضرایب تصادفی دوطرفه و کاربرد آن در انتخاب فروشندگان
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|25247||2014||12 صفحه PDF||سفارش دهید||محاسبه نشده|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : International Journal of Production Economics, Volume 131, Issue 2, June 2011, Pages 709–720
In this paper, a class of chance constrained multiobjective linear programming model with birandom coefficients is considered for vendor selection problem. Firstly we present a crisp equivalent model for a special case and give a traditional method for crisp model. Then, the technique of birandom simulation is applied to deal with general birandom objective functions and birandom constraints which are usually difficult to be converted into their crisp equivalents. Furthermore, a genetic algorithm based on birandom simulation is designed for solving a birandom multiobjective vendor selection problem. Finally, a real numbers example is given. The paper makes certain contribution in both theoretical and application research related to multiobjective chance constrained programming, as well as in the study of vendor selection problem under uncertain environment.
Vendor selection (also called supplier selection) is a key process of supply chain management. The success of a supply chain is highly dependent on selection of good suppliers. The supplier selection problem has received considerable attention in academic research and literature. The first related papers can be traced back to the 1950s when applications of linear programming and scientific computations were at their beginning. The first recorded supplier selection model was used by the National Bureau of Standards in the United States of America to find the minimum cost way for awarding procurement contracts in the Department of Defense (Stanley et al., 1954 and Gainen, 1955). The existent literature surveys focused on papers starting from the mid 1960s. The earliest review was by Moore and Fearon (1973) where they focused on industry applications of computer-assisted supplier selection models. Weber et al. (1991) annotated and classified 74 articles with regard to the particular criteria mentioned in the study, the purchasing environment and the decision technique used. A review by De Boer et al. (2001) discussed a framework for supplier selection. The authors recognized the prior steps leading to the theoretical solution and presented the main published works that deal with all the supplier selection process. Aissaoui et al. (2007) presented a most comprehensive literature review that covered the entire purchasing process, considered both parts and services outsourcing activities, and covered internet-based procurement environments such as electronic marketplaces auctions, finally analyzed and exposed the main decision's features, and proposed different classifications of the published models. Gheidar-Kheljani et al. (2009) considered the issue of coordination between one buyer and multiple potential suppliers, and made the total cost of the supply chain minimized rather than only the buyer's cost. However, the majority of this research in the literature assumed the parameters to be deterministic. Characteristically, real-world situations are often not deterministic, and some factors such as demands, item price and allocations are usually changing, hence we must consider the vendor selection problem under uncertainty. Horowitz (1986) considered a two-source purchasing problem with one source's price uncertain. Kasilingam and Lee (1996) considered a normally distributed demand in a multiple item single period model. Bonser and Wu (2001) developed a stochastic program to model a multi-source fuel procurement for an electrical utilities firm considering both demand and price uncertainty. Yang et al. (2007) provided a newsvendor approach to decide ordering quantities from a set of vendors with random yields and prices while facing stochastic demand. Liao and Rittscher (2007) developed a comprehensive multiobjective supplier selection model under stochastic demand conditions considering demand quantity and timing uncertainties. Awasthi et al. (2009) considered a supplier selection problem for a single manufacturer/retailer who faced a random demand. Zhang and Zhang (2011) addressed the supplier selection and purchase problem with fixed selection cost and limitation on minimum and maximum order sizes under stochastic demand. Also, the vendor selection problem under fuzzy environment has been studied by some scholars. Kumar et al., 2004 and Kumar et al., 2006 developed a fuzzy goal programming and a fuzzy multiobjective integer programming approach to handle the vagueness and imprecision in vendor selection model. Amid et al. (2006) applied an asymmetric fuzzy-decision-making technique to assign different weights to various criteria in a fuzzy vendor selection problem, and formulated a weighted additive fuzzy multiobjective model for vendor selection problem under price breaks (Amid et al., 2009). Faez et al. (2009) introduced an integrated model based on the CBR method in a fuzzy environment and mathematical programming for a single item vendor selection problem. Wang et al. (2008) proposed a fuzzy vendor selection expected value model and a fuzzy vendor selection chance constrained programming model by characterizing quality, budget, and demand as fuzzy variables. Awasthi et al. (2010) presented a fuzzy multicriteria approach which consisted of three steps for evaluating environmental performance of suppliers. Bai and Sarkis (2010) utilized gray system and rough set theory and integrated sustainability discussion into the supplier selection modeling. However, in a practical decision-making process, we often face a hybrid uncertain environment where linguistic and frequent nature coexist. Several research works dealing with this twofold uncertainty have been published in recent years (Liu, 2004, Li et al., 2006 and Xu et al., 2008; Xu and Yao, 2009). However, in this paper, the amount of demand on the items is normally distributed variable N(μ,σ2)N(μ,σ2) from the view point of probability theory, and the values of μμ is another random variable because of some stochastic data, therefore, twofold random parameters appear. In this case, birandom variable, which was presented by Peng and Liu (2007) can be used to deal with this kind of dual uncertainty. How to model and solve the problem of vendor selection in birandom environment is a new area of research interest. To the best of the authors knowledge, so far there is little research in this area. In this paper, a birandom CCMOLP model is developed based on chance measure of birandom event (Peng and Liu, 2007 and Liu, 2002) for the vendor selection problem. The rest of this paper is organized as follows. In Section 2, we state the vendor selection problem. Making some assumptions for this problem, based on recalling some definitions about birandom variables, a birandom chance constrained multiobjective model is proposed. Section 3 studies pr–pr constrained multiobjective programming model. We converted it into its crisp equivalent model for a special case. After discussed the convexity of the model, we give an interactive random satisfying method to obtain the decision maker's satisfactory solution. In Section 4, we apply the technique of birandom simulation to check the complex functions and develop a birandom simulation-based genetic algorithm. In Section 5, a VSP is given in order to show the application of the proposed model and algorithm. Finally concluding remarks are outlined in Section 6.
نتیجه گیری انگلیسی
In this paper, based on birandom environment, we develop a chance constrained multiobjective linear programming model with birandom coefficients for a vendor selection problem, and propose an approach of birandom simulation-based genetic algorithm to solve this problem. Here, for the first time, we have supposed the demand, the selling price and some other parameters to be birandom variables. In the model, three objectives are considered: (1) minimization of total monetary cost, (2) minimization of total rejected purchased items, (3) minimization of total late delivery. By chance constrained programming technique, this model is reduced to a deterministic model. Then the birandom simulation-based genetic algorithm is developed to get the optimal solution for common problems. After comparing the results using different methods for a special example, we draw the conclusion that the genetic algorithm is more effective for this class of problems. The problem considered in this paper is under some assumptions, and the example was also specially formulated, because vendor selection in real world is more complex, and the real environment is also more uncertain. Although the model and technique constructed in this paper should be helpful for solving some real-world problems, detailed analysis and further research are necessary to concentrate on the more complicated hybrid uncertainty and other new solution approaches.