Solving the multiobjective transportation decision-making problem based on improved S-type membership function (Q2052075)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7433538
Language Label Description Also known as
default for all languages
No label defined
    English
    Solving the multiobjective transportation decision-making problem based on improved S-type membership function
    scientific article; zbMATH DE number 7433538

      Statements

      Solving the multiobjective transportation decision-making problem based on improved S-type membership function (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      25 November 2021
      0 references
      Summary: Aiming at the problem of multiobjective transportation decision-making, a fuzzy compromise method with an improved S-type membership function is proposed. This method not only considers a single objective and evaluates it marginally but also evaluates the overall objective as a whole. First of all, a multiobjective transportation decision-making model is established. Then, each objective function is mapped to a function on the interval [0,1] through the S-type membership function, thereby transforming the multiobjective transportation linear programming model into a multiobjective transportation fuzzy compromise programming model, and its satisfaction is expressed by the global utility function. Finally, through two examples, the results of the example algorithm are compared with the results in the literature, highlighting the superiority of the method. The experimental results show that in the multiobjective transportation decision-making problem, the fuzzy compromise method of the S-type membership function has better flexibility and effectiveness.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references