The Weighted Distance Measure Based Method to Neutrosophic Multiattribute Group Decision Making

Liu, Chunfang; Luo, YueSheng

doi:https://doi.org/10.1155/2016/3145341

Mathematical Problems in Engineering

On this page

Abstract Introduction Preliminaries Conclusion Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2016 | Article ID 3145341 | https://doi.org/10.1155/2016/3145341

The Weighted Distance Measure Based Method to Neutrosophic Multiattribute Group Decision Making

Chunfang Liu^1,2and YueSheng Luo^1,3

Academic Editor: Peide Liu

Received26 Mar 2016

Revised25 Apr 2016

Accepted05 May 2016

Published26 May 2016

Abstract

Neutrosophic set (NS) is a generalization of fuzzy set (FS) that is designed for some practical situations in which each element has different truth membership function, indeterminacy membership function, and falsity membership function. In this paper, we study the multiattribute group decision making (MAGDM) problems under neutrosophic environment with the incompletely known or completely unknown attribute weight. We first define the single-valued neutrosophic ideal solution (SVNIS) and the weighted distance measure and establish the program models to derive the attribute weights. Then, we give a practical application in the framework of SVNS; the result shows that our method is reasonable and effective in dealing with decision making (DM) problems. Furthermore, we extend the method to interval-valued neutrosophic set (IVNS).

1. Introduction

Fuzzy set was introduced by Zadeh, which has been widely used in many aspects [1, 2]. On the basis of Zadeh’s work, several high-order fuzzy sets have been proposed as an extension of fuzzy sets, including interval-valued fuzzy set, type-2 fuzzy set, type-n fuzzy set, soft set, rough set, intuitionistic fuzzy set, interval-valued intuitionistic fuzzy set, hesitant fuzzy set, and neutrosophic set (NS) [2–6]. So far, the proposed high-order fuzzy sets have been successfully utilized in dealing with different uncertain problems, such as decision making [7], and pattern recognition [8].

As a generalization of fuzzy set, the NS was proposed by Smarandache [5] not only to deal with the decision information which is often incomplete, indeterminate, and inconsistent but also to include the truth membership degree, the falsity membership degree, and the indeterminacy membership degree. For simplicity and practical application, Wang proposed the single-valued NS (SVNS) and the interval-valued NS (IVNS) which are the instances of NS and gave some operations on these sets [8, 9]. Since its appearance, many fruitful results have appeared [10, 11]. On one hand, many researchers have proposed some aggregation operators of SVNS and INS and applied them to MADM problems [12–16]. On the other hand, some researchers have also proposed entropy and similarity measure of the SVNS and IVNS and applied them to MADM and pattern recognition [17, 18]. The above problems that are related to the attribute weights are completely known. However, with the development of the information society and internet technology, the socioeconomic environment gets more complex in many decision areas, such as capital investment decision making, medical diagnosis, and personnel examination. Only one decision maker cannot deal with the complex problems. Accordingly, it is necessary to gather multiple decision makers with different knowledge structures and experiences to conduct a group decision making. In some circumstances, it is difficult for the decision makers to give the information of the attribute weights correctly, which makes the attribute weights incompletely known or completely unknown. How to derive the attribute weights from the given neutrosophic information is an important topic. In intuitionistic fuzzy environments, many researchers have proposed some program models to obtain the incompletely known attribute weights or the completely unknown attribute weights, such as Xu proposed the deviation-based method [19], the ideal solution-based method [20], and the group consensus-based method [21] and Li et al. proposed the consistency-based method [22]. Under the neutrosophic environment, Şahin and Liu proposed the maximizing deviation method [23]. Up to now, we found that there is no research of the weighted distance measure based method to neutrosophic multiattribute group decision making. In this paper, we investigate the MAGDM problems which the information expressed by SVNS or IVNS, and the attribute weights are incompletely known or completely unknown.

The rest of the paper is organized as follows. In Section 2, we recall the concept of NS, SVNS, INS and their distance measures. In Section 3, we give the weighted distance measure based method to single-valued neutrosophic set (SVNS). Furthermore, we extend the method to interval-valued neutrosophic set (IVNS). Finally, a conclusion is given in Section 4.

2. Preliminaries

Definition 1 (see [5]). Assume that is a universe of discourse with a generic element in denoted by . A NS on is defined by a truth membership function , an indeterminacy membership function , and a falsity membership function . , , and are defined by where .

For similarity and practical application, Wang proposed the SVNS and IVNS which are the subclasses of NS and preserve all the operations on NS. In the following part, we recall SVNS, IVNS, and their distance measure, respectively.

Definition 2 (see [8]). Assume that is a universe of discourse with a generic element in denoted by . A single-valued neutrosophic set (SVNS) on is defined by a truth membership function , an indeterminacy membership function , and a falsity membership function . , , and are defined by where , , and are subsets of and satisfy .

For similarity, we utilize to denote a SVNS in the following part. If has only one element, for convenience, we call a single-valued neutrosophic number (SVNN) and denoted by .

Definition 3 (see [24]). Let , be two SVNNs; the normalized Hamming distance measure between and is defined by

Definition 4 (see [9]). Assume that is a universe of discourse with a generic element in denoted by , and is the set of all closed subsets of . An interval-valued neutrosophic set (IVNS) on is defined by a truth membership function , an indeterminacy membership function , and a falsity membership function . , , and are defined by with the condition .

Here, we denote , , . For convenience, we call an interval-valued neutrosophic number (IVNN) and it is denoted by .

Definition 5 (see [18]). Let = , , , = , , be two IVNNs; the normalized Hamming distance measure between and is defined by

3. The Weighted Distance Measure Based Method to Neutrosophic Set

3.1. The Weighted Distance Measure Based Method to Single-Valued Neutrosophic Set

Let be a set of alternatives, let be a set of attributes, let and be the weight vector of the attribute with and . Suppose that there are decision makers , whose corresponding weighted vector is . Let be single-valued neutrosophic decision matrix, where is the value of the attribute, expressed by SVNNs.

In MADM environments, the ideal point is used to help the identification of the best alternative in the decision set. Although the ideal point does not exist in real world, it does provide an effective way to evaluate the best alternative. Now, we suppose that the ideal SVNN is . Based on the ideal SVNN, we define the single-valued neutrosophic positive ideal solution (SVNPIS).

Definition 6. Let be ideal SVNNs; then, a SVNPIS is defined by

Definition 7. Let be the th alternative of the th decision makers , and let be the SVNPIS; then, the weighted Hamming distance measure (WHDM) between and is defined by

3.1.1. Incompletely Known Attribute Weights

In the decision making process, the incomplete information of the attribute weight provided by the decision makers can usually be constructed using several basic ranking forms [25]. Let be the set of information about the incompletely known attribute weights, which may be constructed in the following forms [26], for :(a)A weak ranking: .(b)A strict ranking: .(c)A ranking with multiples: .(d)An interval form: .(e)A ranking of differences: , for We now establish the following single-objective programming model based on the weighted distance measure method:where is the weight of the decision maker and where represents the weighted distance measure between the attribute value and the SVNPIS . The desirable weight vector should make the sum of all weighted distance measures (7) small. So we construct this model to make the overall distance small.

By solving the model with Matlab software, we get the optimal solution , which is considered as the weight of the attributes . Then, we utilize to rank all the alternatives. The smaller the weighted distance measure, the better the alternative.

3.1.2. Completely Unknown Attribute Weights

If the information about the attribute weight is completely unknown, we establish the following programming model: To solve this model, we construct the Lagrange function as follows: where is the Lagrange multiplier.

Differentiating (9) with respect to and , setting these partial derivatives equal to zero, the following set of the equations are obtained: By solving (10), we obtain the weight and normalize it with ; then, we get We get the optimal solution , which is considered as the weight of the attributes . Later, we calculate the distance measure (7) and get the most desirable one.

3.1.3. Illustrative Example

Example 1. Here, we choose the decision making problem adapted from [23]. An automotive company is desired to select the most appropriate supplier for one of the key elements in its manufacturing process. After preevaluation, four suppliers have remained as alternatives for further evaluation. In order to evaluate alternative suppliers, a committee composed of four decision makers has been formed. The committee selects four attributes to evaluate the alternatives: () : product quality, () : relationship closeness, () : delivery performance, and () : price. Suppose that there are four decision makers, denoted by , whose corresponding weight vector is . The four possible alternatives are to be evaluated under these four attributes and are in the form of SVNNs for each decision maker, as shown in the following single-valued neutrosophic decision matrix:

Case 1 (incompletely known attribute weights). Suppose that the incompletely known information of the attribute weight is given as follows:

Step 1. By model , we establish the following model:

Step 2. By solving this model with Matlab software, we get the weight vector:

Step 3. Using the distance measure (7), we have

Step 4 (rank the alternatives). Since is the biggest, and is the smallest, we rank the alternatives as follows: and is the best alternative.

Case 2 (completely unknown attribute weights).

Step 1. By model , we establish the following model:

Step 2. Use (11) to obtain the weight vector of attributes:

Step 3. Using the distance measure (8) and (9), we have

Step 4. Rank the alternatives. Since is the biggest, and is the smallest, we rank the alternatives as follows: and is the best alternative.

3.2. The Weighted Distance Measure Based Method to Interval-Valued Neutrosophic Set

Let be a set of alternatives, let be a set of attributes, and let be the weight vector of the attribute with and . Suppose that there are decision makers , whose corresponding weighted vector is . Let be interval-valued neutrosophic decision matrix, where is the value of the attribute, expressed by IVNNs.

Now, we suppose that the ideal IVNN is . Based on the ideal IVNN, we define the interval-valued neutrosophic positive ideal solution (IVNPIS).

Definition 8. Let be ideal IVNNs; then, a IVNPIS is defined by

Definition 9. Let be the th alternative, and let be the IVNPIS; then, the weighted Hamming distance measure (WHDM) between and is defined by

3.2.1. Incompletely Known Attribute Weights

We now establish the following single-objective programming model based on the weighted distance measure method: where is the weight of the decision maker and where represents the distance measure between the attribute value and the IVNPIS . The desirable weight vector should make the sum of all weighted distances (23) small. So we construct this model to make the overall distances small. The smaller the WHD, the better the alternative. We use (23) to rank the alternative.

By solving the model with Matlab software, we get the optimal solution , which is considered as the weight of the attributes . Then, we utilize to rank all the alternatives. The smaller the distance, the better the alternative.

3.2.2. Completely Unknown Attribute Weights

If the information about the attribute weight is completely unknown, we establish the following programming model: By Lagrange multiple method, we get the completely unknown weight and normalize it with as follows:which is considered as the weight of the attributes Later, we calculate the distance measure and then get the most desirable one.

3.2.3. Illustrative Example

Example 2. The decision making problem is adapted from [23]. Suppose that an organization plans to implement ERP system. The first step is to form a project team that consists of CIO and two senior representatives from user departments. By collecting all information about ERP vendors and systems, project team chooses four potential ERP systems as candidates. The company employs some external professional organizations (experts) to aid this decision making. The project team selects four attributes to evaluate the alternatives: () : function and technology, () : strategic fitness, () : vendors ability, and () : vendors reputation. Suppose that there are three decision makers, denoted by , whose corresponding weight vector is . The four possible alternatives are to be evaluated under these four attributes and are in the form of IVNNs for each decision maker, as shown in the following interval-valued neutrosophic decision matrix:

Case 1 (incompletely known attribute weights). Suppose that the incompletely known information of the attribute weight is given as follows:

Step 1. By model , we establish the following model:

Step 2. By solving this model with Matlab software, we get the weight vector:

Step 3. Using the distance measure (24) and (25), we have

Step 4 (rank the alternatives). Since is the biggest, and is the smallest, we rank the alternatives as follows: and is the best alternative.

Case 2 (completely unknown attribute weights).

Step 1. By model , we establish the following model:

Step 2. Use (25) to obtain the weight vector of attributes:

Step 3. Using the distance measure (24) and (25), we have

Step 4 (rank the alternatives). Since is the biggest, and is the smallest, we rank the alternatives as follows: and is the best alternative.

3.3. Comparative Analysis

Considering the proposed method and the maximizing deviation method proposed by Şahin, there exsit some differences. In Şahin’s method, they calculated the distance measure of all the attributes and assign a small weight to the attribute which has a similar effect among the alternatives; then, they used the weighted aggregation operators and the score functions to rank the alternatives; while, the proposed method calculates the distance measure between the attributes and the ideal solution and obtains the weight that make the weighted distance measure small, we then use the weighted distance measure to rank the alternatives which avoid the complex calculation of aggregation operators processing. The two methods are all effective to deal with the incompletely known or completely unknown attribute weight by solve the program models. The advantage of the proposed method is that calculation is simple and convenient, which can deal with the MAGDM problem effectively.

4. Conclusion

In this paper, we investigate the multiattribute group decision making problems expressed with neutrosophic set and the attribute weights are incompletely known or completely unknown. We first define the single-valued neutrosophic ideal solution (SVNIS) and then establish the optimal models to derive the attribute weight. Furthermore, an approach to MAGDM within the framework of SVNS is developed, and the result shows that our approach is reasonable and effective in dealing with decision making problems. Finally, we extend the method to IVNS.

Competing Interests

The authors declare that there are no competing interests regarding the publication of this paper.

Acknowledgments

This work was financially supported by the Fundamental Research Funds for the Central Universities (2572014BB19) and China Natural Science Fund under Grant (11401084).

References

L. A. Zadeh, “Fuzzy sets,” Information and Control, vol. 8, pp. 338–353, 1965.
View at: Google Scholar
L. A. Zadeh, “Is there a need for fuzzy logic?” Information Sciences, vol. 178, no. 13, pp. 2751–2779, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
K. T. Atanassov, “Intuitionistic fuzzy sets,” Fuzzy Sets and Systems. An International Journal in Information Science and Engineering, vol. 20, no. 1, pp. 87–96, 1986.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
V. Torra, “Hesitant fuzzy sets,” International Journal of Intelligent Systems, vol. 25, no. 6, pp. 529–539, 2010.
View at: Publisher Site | Google Scholar | Zentralblatt MATH
F. Smarandache, Neutrosophy. Neutrosophic Probability, Set, and Logic, ProQuest Information and Learning, Ann Arbor, Mich, USA, 1998.
Y. Zhang, P. Li, Y. Wang, P. Ma, and X. Su, “Multiattribute decision making based on entropy under interval-valued intuitionistic fuzzy environment,” Mathematical Problems in Engineering, vol. 2013, Article ID 526871, 8 pages, 2013.
View at: Publisher Site | Google Scholar | MathSciNet
H. L. Larsen and R. R. Yager, “A framework for fuzzy recognition technology,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 30, no. 1, pp. 65–76, 2000.
View at: Publisher Site | Google Scholar
H. Wang, F. Smarandache, Y.-Q. Zhang, and R. Sunderraman, Interval Neutrosophic Sets and Logic: Theory and Applications in Computing, Hexis, Phoenix, Ariz, USA, 2005.
View at: MathSciNet
H. Wang, F. Smarandache, Y. Q. Zhang, and R. Sunderraman, “Single valued neutrosophic sets,” Multispace and Multistructure, no. 4, pp. 410–413, 2010.
View at: Google Scholar
S. Broumi, M. Talea, A. Bakali, and F. Smarandache, “Single valued neutro-sophic graphs,” Journal of New Theory, vol. 10, pp. 86–101, 2016.
View at: Google Scholar
S. Broumi, M. Talea, A. Bakali, and F. Smarandache, “On bipolar single valued neutrosophic graphs,” Journal of New Theory, no. 11, pp. 84–102, 2016.
View at: Google Scholar
P. Liu and Y. Wang, “Interval neutrosophic prioritized OWA operator and its application to multiple attribute decision making,” Journal of Systems Science and Complexity, pp. 1–17, 2015.
View at: Publisher Site | Google Scholar
S. Broumi and F. Smarandache, “Single valued neutrosophic trapezoid linguistic aggregation operators based multi-attribute decision making,” Bulletin of Pure & Applied Sciences- Mathematics and Statistics, vol. 33, no. 2, pp. 135–155, 2014.
View at: Publisher Site | Google Scholar
C. F. Liu and Y. S. Luo, “Correlated aggregation operators for simplified neutrosophic set and their application in multi-attribute group decision making,” Journal of Intelligent and Fuzzy Systems, vol. 30, no. 3, pp. 1755–1761, 2016.
View at: Publisher Site | Google Scholar
P. D. Liu, Y. C. Chu, Y. W. Li, and Y. B. Chen, “Some generalized neutrosophic number hamacher aggregation operators and their application to group decision making,” International Journal of Fuzzy Systems, vol. 16, no. 2, pp. 242–255, 2014.
View at: Google Scholar
P. D. Liu and Y. M. Wang, “Multiple attribute decision-making method based on single-valued neutrosophic normalized weighted Bonferroni mean,” Neural Computing and Applications, vol. 25, no. 7-8, pp. 2001–2010, 2014.
View at: Publisher Site | Google Scholar
Z. S. Xu and M. M. Xia, “Distance and similarity measures for hesitant fuzzy sets,” Information Sciences, vol. 181, no. 11, pp. 2128–2138, 2011.
View at: Publisher Site | Google Scholar | MathSciNet
J. Ye, “Similarity measures between interval neutrosophic sets and their applications in multicriteria decision-making,” Journal of Intelligent and Fuzzy Systems, vol. 26, no. 1, pp. 165–172, 2014.
View at: Publisher Site | Google Scholar | Zentralblatt MATH
Z. S. Xu, “A deviation-based approach to intuitionistic fuzzy multiple attribute group decision making,” Group Decision and Negotiation, vol. 19, no. 1, pp. 57–76, 2010.
View at: Publisher Site | Google Scholar
Z. S. Xu, “Models for multiple attribute decision making with intuitionistic fuzzy information,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 15, no. 3, pp. 285–297, 2007.
View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet
Z. S. Xu and X. Q. Cai, “Nonlinear optimization models for multiple attribute group decision making with intuitionistic fuzzy information,” International Journal of Intelligent Systems, vol. 25, no. 6, pp. 489–513, 2010.
View at: Publisher Site | Google Scholar
D.-F. Li, G.-H. Chen, and Z.-G. Huang, “Linear programming method for multiattribute group decision making using IF sets,” Information Sciences, vol. 180, no. 9, pp. 1591–1609, 2010.
View at: Publisher Site | Google Scholar | MathSciNet
R. Şahin and P. Liu, “Maximizing deviation method for neutrosophic multiple attribute decision making with incomplete weight information,” Neural Computing and Applications, pp. 1–13, 2015.
View at: Publisher Site | Google Scholar
P. Majumdar and S. K. Samanta, “On similarity and entropy of neutrosophic sets,” Journal of Intelligent and Fuzzy Systems, vol. 26, no. 3, pp. 1245–1252, 2014.
View at: Publisher Site | Google Scholar | Zentralblatt MATH
S. H. Kim, S. H. Choi, and J. K. Kim, “Interactive procedure for multiple attribute group decision making with incomplete information: range-based approach,” European Journal of Operational Research, vol. 118, no. 1, pp. 139–152, 1999.
View at: Publisher Site | Google Scholar
K. S. Park, “Mathematical programming models for characterizing dominance and potential optimality when multicriteria alternative values and weights are simultaneously incomplete,” IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans., vol. 34, no. 5, pp. 601–614, 2004.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2016 Chunfang Liu and YueSheng Luo. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

1502

Downloads

914

Citations