The aim of this paper is solving an intuitionistic fuzzy multi-objective linear programming problem containing intuitionistic fuzzy parameters, intuitionistic fuzzy maximization/minimization, and intuitionistic fuzzy ...
详细信息
The aim of this paper is solving an intuitionistic fuzzy multi-objective linear programming problem containing intuitionistic fuzzy parameters, intuitionistic fuzzy maximization/minimization, and intuitionistic fuzzy constraints. To do this, a linear ranking function is used to convert the intuitionistic fuzzy parameters to crisp ones first. Then, linear membership and non-membership functions are used to manipulate intuitionistic fuzzy maximization/minimization and intuitionistic fuzzy constraints. Then, a multi-objective optimization problem is formulated containing maximization of membership functions and minimization of non-membership functions. To solve this problem, the minimax and weighted sum methods are used. Then, the described procedure is summarized as an algorithm to solve the problem, and a numerical example is solved by the proposed method. Finally, to investigate the capability and performance of the model, a supplier selection problem, which is one of the important applications in supply chain management, is solved by the proposed algorithm.
This article considers linearmulti-objectiveprogramming problems with block angular structure, which are analogous to multi-disciplinary optimization environments where disciplines must collaborate to achieve a comm...
详细信息
This article considers linearmulti-objectiveprogramming problems with block angular structure, which are analogous to multi-disciplinary optimization environments where disciplines must collaborate to achieve a common overall goal. In this decentralized environment, a mechanism to guide locally optimized decision makers' solutions to a Pareto-optimal solution without sharing the entire local information is developed. The mechanism is based on an augmented Lagrangian approach to generate a solution and is separated into two phases: phase I determines an ideal point for each of the single objectives and phase II searches for a compromise solution starting from a single ideal point. Theoretical results show that the algorithm converges and the solution generated is Pareto optimal. The algorithm's effectiveness is demonstrated via an illustrative example and a real-world bi-objective re-entrant flow-shop production planning problem. The real-world experimental results showed that the decentralized method had an average 50% better performance compared to other centralized methods.
Classic linear assignment method is a multi-criteria decision-making approach in which criteria are weighted and each rank is assigned to a choice. In this study, to abandon the requirement of calculating the weight o...
详细信息
Classic linear assignment method is a multi-criteria decision-making approach in which criteria are weighted and each rank is assigned to a choice. In this study, to abandon the requirement of calculating the weight of criteria and use decision attributes prioritizing and also to be able to assign a rank to more than one choice, a multi-objective linear programming (MOLP) method is suggested. The objective function of MOLP is defined for each attribute and MOLP is solved based on absolute priority and comprehensive criteria methods. For solving the linearprogramming problems we apply a recurrent neural network (RNN). Indeed, the Lyapunov stability of the proposed model is proved. Results of comparing the proposed method with TOPSIS, VICOR, and MORA methods which are the most common multi-criteria decision schemes show that the proposed approach is more compatible with these methods.
Different industries compete to attract customers in different ways. In the field of production, group technology (GT) is defined by identifying and grouping similar parts based on their similarities in design and pro...
详细信息
Different industries compete to attract customers in different ways. In the field of production, group technology (GT) is defined by identifying and grouping similar parts based on their similarities in design and production. Cellular manufacturing (CM) is an application of GT to reconfigure the factory and job shop design. A manufacturing cell is a group of independent machines with different functions put together to produce a family of parts. Designing a cellular manufacturing system involves three major decisions: cell formation (CF), group layout (GL), and group scheduling (GS). Although these decisions are interrelated and can affect each other, they have been considered separately or sequentially in previous research. In this paper, CF, GL, and GS decisions are considered simultaneously. Accordingly, a multi-objective linear programming (MOLP) model is proposed to optimize weighted completion time, transportation cost, and machine idle time for a multi-product system. Finally, the model will be solved using the epsilon-constraint method, representing different scales solutions for decision-making. The proposed model is NP-hard. Therefore, a nondominated sorting genetic algorithm II (NSGA-II) is presented to solve it since GAMS software is unable to find optimal solutions for large-scale problems. Besides, to evaluate the performance of NSGA-II, the problem is solved by three metaheuristic algorithms.
In this paper, intuitionistic fuzzy multi-objectivelinear fractional programming problems (IFMOLFPs) with several fractional criteria, including profit/cost, profit/time, or profitability ratio maximization, are cons...
详细信息
In this paper, intuitionistic fuzzy multi-objectivelinear fractional programming problems (IFMOLFPs) with several fractional criteria, including profit/cost, profit/time, or profitability ratio maximization, are considered. Moreover, all parameters, with the exception of the decision variables, are characterized as triangular intuitionistic fuzzy numbers. The component-wise optimization method is employed to transform IFMOLFP into an equivalent crisp multi-objectivelinear fractional problem. Then, we use an iterative fuzzy methodology that integrates linearprogramming with a bisection approach. The proposed approach addresses single-objective and real-life multi-objective organizational planning problems, which are approached using various methods in the literature. It is used for non-linear membership functions in solving these problems. Furthermore, the values obtained using the ranking function are compared. Ultimately, the decision-maker selects the most appropriate solution technique based on the weights of the objective functions.
In the increasingly complex electromagnetic environment, a variety of new signal types are appearing;however, existing electromagnetic signal classification (ESC) models cannot handle new signal types. In this context...
详细信息
In the increasingly complex electromagnetic environment, a variety of new signal types are appearing;however, existing electromagnetic signal classification (ESC) models cannot handle new signal types. In this context, the emergence of class-incremental learning aims to incrementally update the classification model as new categories emerge. In this paper, an electromagnetic signal classification framework based on class exemplar selection and a multi-objective linear programming classifier (CES-MOLPC) is proposed in order to continuously learn new classes in an incremental manner. Specifically, our approach involves the adaptive selection of class exemplars considering normalized mutual information and a multi-objective linear programming classifier. The former is used to maintain the classification capability of the model for previous categories by selecting key samples, while the latter is used to allow the model to adapt quickly to new categories. Meanwhile, a weighted loss function based on cross-entropy and distillation loss is presented in order to fine-tune the model. We demonstrate the effectiveness of the proposed CES-MOLPC method through extensive experiments on the public RML2016.04c data set and the large-scale real-world ACARS signal data set. The results of the comparative experiments demonstrate that our method can achieve significant improvements over state-of-the-art methods.
Production of high volumes of wastewater by hydraulic fracturing operations is a challenging issue in the unconventional gas industry in North America. A scheduling-based solution is required to optimally manage the p...
详细信息
Production of high volumes of wastewater by hydraulic fracturing operations is a challenging issue in the unconventional gas industry in North America. A scheduling-based solution is required to optimally manage the produced wastewater. This study develops a novel, hybrid, multi-objective linear programming model to optimize hydraulic fracturing wastewater management alternatives. Minimizing overall wastewater treatment cost, environmental impacts, and undesirable deviations from different goals were simultaneously considered the main objectives of the system. The model used data from a case example operating for 31 weeks, and it determined the volume of wastewater and treated water over all periods. The results indicated that onsite treatment is the best possible alternative for reuse in subsequent fracking, in those weeks in which all constraints were satisfied. Offsite treatment was the second ranking alternative when the volume of wastewater was higher than the capacity of onsite treatment, and deep well injection was the result when no water was needed for subsequent fracking. A sensitivity analysis was conducted by weighting the objectives to express their importance levels. Compared to other objectives, environmental impact had greater effect on the selection of the optimal alternatives over each period. (C) 2020 Elsevier Ltd. All rights reserved.
This paper generalizes inverse optimization for multi-objective linear programming where we are looking for the least problem modifications to make a given feasible solution a weak efficient solution. This is a natura...
详细信息
This paper generalizes inverse optimization for multi-objective linear programming where we are looking for the least problem modifications to make a given feasible solution a weak efficient solution. This is a natural extension of inverse optimization for single-objectivelinearprogramming with regular optimality replaced by the Pareto optimality. This extension, however, leads to a non-convex optimization problem. We prove some special characteristics of the problem, allowing us to solve the non-convex problem by solving a series of convex problems.
Robust and resilient agri-food supply chain management (AFSCM) is paramount to agribusinesses, given the many challenges and risks that this increased demand will bring in the coming decades. Interruptions caused by v...
详细信息
Purpose The purpose of this paper is to propose a method for solving multi-objective linear programming (MOLP) with interval coefficients using positioned programming and interactive fuzzy programming approaches. Desi...
详细信息
Purpose The purpose of this paper is to propose a method for solving multi-objective linear programming (MOLP) with interval coefficients using positioned programming and interactive fuzzy programming approaches. Design/methodology/approach In the proposed algorithm, first, lower and upper bounds of each objective function in its feasible region will be determined. Afterwards using fuzzy approach, considering a membership function for each objective function and finally using grey linearprogramming, the solution for this problem will be obtained. Findings According to the presented example, in this paper, the proposed method is both simple in use and suitable for solving different problems. In the numerical example mentioned in this paper, the proposed method provides an acceptable solution for such problems. Practical implications As in most real-world situations, the coefficients of decision models are not known and exact. In this paper, the authors consider the model of MOLP with interval data, since one of the solutions to cover uncertainty is using interval theory. Originality/value Based on using grey theory and interactive fuzzy programming approaches, an appropriate method has been presented for solving MOLP problems with interval coefficients. The proposed method, against the complex methods, has less effort and offers acceptable solutions.
暂无评论