20 research outputs found
Transportation Management in a Distributed Logistic Consumption System Under Uncertainty Conditions
The problem of supply management in the supplier-to-consumer logistics transport system has been formed and solved. The novelty of the formulation of the problem consists in the integrated accounting of costs in the logistic system, which takes into account at the same time the cost of transporting products from suppliers to consumers, as well as the costs for each of the consumers to store the unsold product and losses due to possible shortages. The resulting optimization problem is no longer a standard linear programming problem. In addition, the work assumes that the solution of the problem should be sought taking into account the fact that the initial data of the problem are not deterministic. The analysis of traditional methods of describing the uncertainty of the source data. It is concluded that, given the rapidly changing conditions for the implementation of the delivery process in a distributed supplier-to-consumer system, it is advisable to move from a theoretical probability representation of the source data to their description in terms of fuzzy mathematics. At the same time, in particular, the fuzzy values of the demand for the delivered product for each consumer are determined by their membership functions.Distribution of supplies in the system is described by solving a mathematical programming problem with a nonlinear objective function and a set of linear constraints of the transport type. In forming the criterion, a technology is used to transform the membership functions of fuzzy parameters of the problem to its theoretical probabilistic counterparts – density distribution of demand values. The task is reduced to finding for each consumer the value of the ordered product, minimizing the average total cost of storing the unrealized product and losses from the deficit. The initial problem is reduced to solving a set of integral equations solved, in general, numerically. It is shown that in particular, important for practice, particular cases, this solution is achieved analytically.The paper states the insufficient adequacy of the traditionally used mathematical models for describing fuzzy parameters of the problem, in particular, the demand. Statistical processing of real data on demand shows that the parameters of the membership functions of the corresponding fuzzy numbers are themselves fuzzy numbers. Acceptable mathematical models of the corresponding fuzzy numbers are formulated in terms of bifuzzy mathematics. The relations describing the membership functions of the bifuzzy numbers are given. A formula is obtained for calculating the total losses to storage and from the deficit, taking into account the bifuzzy of demand. In this case, the initial task is reduced to finding the distribution of supplies, at which the maximum value of the total losses does not exceed the permissible value
Performing Arithmetic Operations Over the (L–R)-type Fuzzy Numbers
The issue of constructing a system of rules to perform binary operations over fuzzy numbers has been formulated and considered. The set problem has been solved regarding the (L–R)-type fuzzy numbers with a compact carrier. Such a problem statement is predetermined by the simplicity of the analytical notation of these numbers, thereby making it possible to unambiguously set a fuzzy number by a set of values of its parameters. This makes it possible, as regards the (L–R)-type numbers, to reduce the desired execution rules for fuzzy numbers to the rules for simple arithmetic operations over their parameters. It has been established that many cited works provide ratios that describe the rules for performing operations over the (L–R)-type fuzzy numbers that contain errors. In addition, there is no justification for these rules in all cases.In order to build a correct system of fuzzy arithmetic rules, a set of metarules has been proposed, which determine the principles of construction and the structure of rules for operation execution. Using this set of metarules has enabled the development and description of the system of rules for performing basic arithmetic operations (addition, subtraction, multiplication, division). In this case, different rules are given for the multiplication and division rules, depending on the position of the number carriers involved in the operation, relative to zero. The proposed rule system makes it possible to correctly solve many practical problems whose raw data are not clearly defined. This system of rules for fuzzy numbers with a compact carrier has been expanded to the case involving a non-finite carrier. The relevant approach has been implemented by a two-step procedure. The advantages and drawbacks of this approach have been identified
Construction of the Fractional-nonlinear Optimization Method
A method for solving the fractional nonlinear optimization problem has been proposed. It is shown that numerous inventory management tasks, on the rational allocation of limited resources, on finding the optimal paths in a graph, on the rational organization of transportation, on control over dynamical systems, as well as other tasks, are reduced exactly to such a problem in cases when the source data of a problem are described in terms of a probability theory or fuzzy math. We have analyzed known methods for solving the fractional nonlinear optimization problems. The most efficient among them is based on the iterative procedure that sequentially improves the original solution to a problem. In this case, every step involves solving the problem of mathematical programming. The method converges if the region of permissible solutions is compact. The obvious disadvantage of the method is the uncontrolled rate of convergence. The current paper has proposed a method to solve the problem, whose concept echoes the known method of fractional-linear optimization. The proposed technique transforms an original problem with a fractional-rational criterion to the typical problem of mathematical programming. The main advantage of the method, as well its difference from known ones, is the fact that the method is implemented using a single-step procedure for obtaining a solution. In this case, the dimensionality of a problem is not a limiting factor. The requirements to a mathematical model of the problem, which narrow the region of possible applications of the devised procedure, imply:1) the components of the objective function must be separable functions;2) the indicators for the power of all nonlinear terms of component functions should be the same.Another important advantage of the method is the possibility of using it to solve the problem on unconditional and conditional optimization. The examples have been considered
Development of Methods for Extension of the Conceptual and Analytical Framework of the Fuzzy Set Theory
Fuzzy set theory is an effective alternative to probability theory in solving many problems of studying processes and systems under conditions of uncertainty. The application of this theory is especially in demand in situations where the system under study operates under conditions of rapidly changing influencing parameters or characteristics of the environment. In these cases, the use of solutions obtained by standard methods of the probability theory is not quite correct. At the same time, the conceptual, methodological and hardware base of the alternative fuzzy set theory is not sufficiently developed. The paper attempts to fill existing gaps in the fuzzy set theory in some important areas. For continuous fuzzy quantities, the concept of distribution density of these quantities is introduced. Using this concept, a method for calculating the main numerical characteristics of fuzzy quantities, as well as a technology for calculating membership functions for fuzzy values of functions from these fuzzy quantities and their moments is proposed. The introduction of these formalisms significantly extends the capabilities of the fuzzy set theory for solving many real problems of computational mathematics. Using these formalisms, a large number of practical problems can be solved: fuzzy regression and clustering, fuzzy multivariate discriminant analysis, differentiation and integration of functions of fuzzy arguments, state diagnostics in a situation where the initial data are fuzzy, methods for solving problems of unconditional and conditional optimization, etc. The proof of the central limit theorem for the sum of a large number of fuzzy quantities is obtained. This proof is based on the characteristic functions of fuzzy quantities introduced in the work and described at the formal level. The concepts of independence and dependence for fuzzy quantities are introduced. The method for calculating the correlation coefficient for fuzzy numbers is proposed. Examples of problem solving are considere
Devising Methods for Planning A Multifactorial Multilevel Experiment with High Dimensionality
This paper considers the task of planning a multifactorial multilevel experiment for problems with high dimensionality. Planning an experiment is a combinatorial task. At the same time, the catastrophically rapid growth in the number of possible variants of experiment plans with an increase in the dimensionality of the problem excludes the possibility of solving it using accurate algorithms. On the other hand, approximate methods of finding the optimal plan have fundamental drawbacks. Of these, the main one is the lack of the capability to assess the proximity of the resulting solution to the optimal one. In these circumstances, searching for methods to obtain an accurate solution to the problem remains a relevant task.
Two different approaches to obtaining the optimal plan for a multifactorial multilevel experiment have been considered. The first of these is based on the idea of decomposition. In this case, the initial problem with high dimensionality is reduced to a sequence of problems of smaller dimensionality, solving each of which is possible by using precise algorithms. The decomposition procedure, which is usually implemented empirically, in the considered problem of planning the experiment is solved by employing a strictly formally justified technique. The exact solutions to the problems obtained during the decomposition are combined into the desired solution to the original problem. The second approach directly leads to an accurate solution to the task of planning a multifactorial multilevel experiment for an important special case where the costs of implementing the experiment plan are proportional to the total number of single-level transitions performed by all factors. At the same time, it has been proven that the proposed procedure for forming a route that implements the experiment plan minimizes the total number of one-level changes in the values of factors. Examples of problem solving are give
Fuzzy Models of Rough Mathematics
The study shows that the introduced known formal description of rough sets can be interpreted in terms of fuzzy sets. This makes it possible to solve many problems of rough mathematics by the developed apparatus of fuzzy mathematics. The authors suggest a way of describing rough numbers with the help of membership functions of fuzzy numbers. The study specifies the chosen type of membership functions and the method of calculating their parameters. The algebra of fuzzy numbers is adapted to perform operations with numbers that are described roughly. The obtained elements are formulae for calculating the expected values and variations of rough numbers. These correlations are simplified for the most realistic special cases. A possibility is considered for solving roughly given optimization problems. A procedure is described for reducing an optimization problem with rough parameters to a usual problem of mathematical programming. An example is given on solving a linear programming problem whose parameters are determined roughly. The rough problem parameters are described with functions of an (L-R) type. It is suggested that the problem should be solved on the basis of the introduced complex criterion. The numerical value of the criterion takes into account the extent of closeness of the obtained result to the modal solution as well as the level of compactness of the membership function of the resulting value of the objective function
Calculation of Throughputs of Intermediate Centers in Three-index Transportation Problems
A transportation problem of linear programming with intermediate centers was considered. For cases where throughputs of intermediate centers are not specified, a problem of calculating rational distribution of the total throughput in order to minimize the average value of total transportation costs has been stated. Several options of constructing the method for solving the problem were proposed. The first option implements the iterative procedure of successive improvement of the initial distribution of throughputs of the centers by the Nelder-Mead method. Increase in speed of this method was achieved using the duality theory. The second option is based on a preliminary solution of the problem of finding optimal routes for all pairs "supplier-consumer" taking into account a possible intermediate center. In this case, the usual two-index transportation problem of delivering products from the system of suppliers to the system of consumers arises. The optimal plan of this task contains necessary data to calculate required throughput for each of the intermediate centers. Advantage of this method consists in the possibility of its effective propagation for solving problems with a multilayered structure of intermediate center
Analysis and Development of Compromise Solutions in Multicriteria Transport Tasks
The object of research is the multicriteria transport problem of linear programming. Simultaneous consideration of several criteria is a problematic problem, since the optimal solutions for different criteria do not coincide. The possible solution of the problem is investigated – finding a way to obtain a compromise solution. Based on the results of the analysis of known methods for solving multicriteria problems (Pareto-set formation, scalarization of the vector criterion, concessions method), the last is justified. To implement the method, an iterative procedure is suggested, in which the initial plan is optimal according to the main criterion. At subsequent iterations, an assignment is made to the main criterion in order to improve the values of the additional criteria. The solution of the problem is continued until a compromise solution is obtained, ensuring the best value for the main criterion, provided that the values for the remaining criteria are no worse than those given. Important advantages of the proposed method: the simplicity of the computational procedure, the grounded technology of forming a new solution at each iteration, realizing the concept of assignment, quality control of the solution obtained at each step. The application of the proposed method opens the prospect of its generalization to the case when the initial data for the solution of the problem contain uncertainty