Logarithmic Hybrid Aggregation Operators Based on Single Valued Neutrosophic Sets and Their Applications in Decision Support Systems
Next Article in Journal
Bernoulli Polynomials and Their Some New Congruence Properties
Next Article in Special Issue
Fuzzy Parameterized Complex Neutrosophic Soft Expert Set for Decision under Uncertainty
Previous Article in Journal
Questions of Mirror Symmetry at the Photoexcited and Ground States of Non-Rigid Luminophores Raised by Circularly Polarized Luminescence and Circular Dichroism Spectroscopy. Part 2: Perylenes, BODIPYs, Molecular Scintillators, Coumarins, Rhodamine B, and DCM
Previous Article in Special Issue
Application of Neutrosophic Logic to Evaluate Correlation between Prostate Cancer Mortality and Dietary Fat Assumption
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Logarithmic Hybrid Aggregation Operators Based on Single Valued Neutrosophic Sets and Their Applications in Decision Support Systems

1
Department of Mathematics, Abdul Wali Khan Uniersity, Mardan 23200, Pakistan
2
Department of Mathematics and Sciences, University of New Mexico, 705 Gurley Ave., Gallup, NM 87301, USA
3
Department of Information Technology, Hazara University, Mansehra 21300, Pakistan
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(3), 364; https://doi.org/10.3390/sym11030364
Submission received: 17 January 2019 / Revised: 6 March 2019 / Accepted: 7 March 2019 / Published: 11 March 2019

Abstract

:
Recently, neutrosophic sets are found to be more general and useful to express incomplete, indeterminate and inconsistent information. The purpose of this paper is to introduce new aggregation operators based on logarithmic operations and to develop a multi-criteria decision-making approach to study the interaction between the input argument under the single valued neutrosophic (SVN) environment. The main advantage of the proposed operator is that it can deal with the situations of the positive interaction, negative interaction or non-interaction among the criteria, during decision-making process. In this paper, we also defined some logarithmic operational rules on SVN sets, then we propose the single valued neutrosophic hybrid aggregation operators as a tool for multi-criteria decision-making (MCDM) under the neutrosophic environment and discussd some properties. Finally, the detailed decision-making steps for the single valued neutrosophic MCDM problems were developed, and a practical case was given to check the created approach and to illustrate its validity and superiority. Besides this, a systematic comparison analysis with other existent methods is conducted to reveal the advantages of our proposed method. Results indicate that the proposed method is suitable and effective for decision process to evaluate their best alternative.

1. Introduction

The information involves, in most of the real-life decision-making problems are often incomplete, indeterminate and inconsistent. Fuzzy set theory introduced by Zadeh [1] deals with imprecise, inconsistent information. Although fuzzy set information proved to be very handy but it cannot express the information about rejection. Atanassov [2] introduced the intuitionistic fuzzy set (IFS) to bring in non-membership. Non membership function represents degree of rejection. To incorporate indeterminate and inconsistent information, in addition to incomplete information, the concept of neutrosophic set (NS) proposed by Smarandache [3]. A NS generalizes the notion of the classic set, fuzzy set (FS) [1], IFS [2], paraconsistent set [4], dialetheist set, paradoxist set [4], and tautological set [4] to name a few. In NS, indeterminacy is quantified explicitly, and truth, indeterminacy, and falsity memberships are expressed independently. The NS generalizes different types of non-crisp sets but in real scientific and engineering applications the NS and the set-theoretic operators require to be specified. For a detailed study on NS we refer to [5,6,7,8,9,10,11,12,13,14,15,16,17].

Related Work

Most of the weighted aggregation operators consider situations in which criteria and preferences of experts are independent, which means that additivity is a main property of these operators. However, in real life decision-making problems, the criteria of the problems are often interdependent or interactive.
Most of the weighted average operators are based on the basic algebraic product and algebraic sum of single valued neutrosophic numbers (SVNNs) which are not the only operations available to model the intersection and union of SVNNs. The logarithmic algebraic product and sum are two good alternatives of algebraic operations which can be used the model intersection and union of SVNNs. Moreover, it is observed that in the literature there is little investigation on aggregation operators utilizing the logarithmic operations on SVNNs. For a detailed review on the applications of logarithmic operations, we refer to [10]. As already mentioned that the single valued neutrosophic set (SVNS) is an effective tool to describe the uncertain, incomplete and indeterminate information. The logarithmic single valued neutrosophic hybrid and logarithmic generalized single valued neutrosophic algebraic operators have the ability to express interactions among the criteria and it can replace the weighted average to aggregate dependent criteria for obtaining more accurate results. Motivated by these, we find it interesting to develop the logarithmic single valued neutrosophic hybrid aggregation operators for decision-making with neutrosophic information.
Also, we proposed the possibility of a degree-ranking technique for SVNNs from the probability point of view, since the ranking of SVNNs is very important for decision-making under the SVN environment. Furthermore, we proposed a multi-criteria decision-making model based on the logarithmic single valued neutrosophic hybrid weighted operators. Forstudy the multi-criteria decision-making models, we refer [18,19,20,21,22,23,24,25,26,27,28,29,30,31].
The aim of writing this paper is to introduce a decision-making method for MCDM problems in which there exist interrelationships among the criteria. The contributions of this research are:
(1) A novel logarithmic operations for neutrosophic information is defined, which can overcome the weaknesses of algebraic operations and obtain the relationship between various SVNNs.
(2) Logarithmic operators for IFSs are extended to logarithmic single-valued neutrosophic hybrid operators and logarithmic generalized single-valued neutrosophic operators, namely, logarithmic single valued neutrosophic hybrid weighted averaging (L-SVNHWA), logarithmic single valued neutrosophic hybrid weighted geometric (L-SVNHWG), logarithmic generalized single-valued neutrosophic weighted averaging (L-GSVNWA) and logarithmic single-valued neutrosophic weighted geometric (L-GSVNWG) to SVNSs, which can overcome the algebraic operators drawbacks.
(3) A decision-making approach to handle the MCDM problems under the neutrosophic informations is introduced.
To attain our research goals which are stated above, the arrangement of the paper is offered as: Section 2 concentrates on basic definitions and operations of existing extensions of fuzzy set theories. In Section 3, some novel logarithmic operational laws of SVNSs are presented. Section 4 defines the logarithmic hybrid aggregation operators for SVNNs. In Section 5, an algorithm for handling the neutrosophic MCDM problem based on the developed logarithmic operators is presented. In Section 5.1, an application to verify the novel method is given and Section 5.2 presents the comparison study about algebraic and logarithmic aggregation operators. Section 6 consists of the conclusion of the study.

2. Preliminaries

This section includes the concepts and basic operations of existing extensions of fuzzy sets to make the study self contained.
Definition 1.
[2] For a set, by an intuitionistic fuzzy set in , we have a structure
ζ = P σ r , N σ r | r ,
in which P σ : Θ and N σ : Θ indicate the membership and non-membership grades in , Θ = 0 , 1 be the unit interval. Also the following condition is satisfied by P σ and N σ , 0 P σ r + N σ r 1 ; r . Then ζ is said to be intuitionistic fuzzy set in .
Definition 2.
[32] For a set, by a neutrosophic set in , we have a structure
ζ = P σ r , I σ r , N σ r | r ,
in which P σ : Θ , I σ : Θ and N σ : Θ indicate the truth, indeterminacy and falsity memberships in , Θ = 0 , 1 + . Also the following condition is satisfied by P σ , I σ and N σ , 0 P σ r + I σ r + N σ r 3 + ; r . Then, ζ is said to be neutrosophic set in .
Definition 3.
[33] For a set, by a single valued neutrosophic set in , we mean a structure
ζ = P σ r , I σ r , N σ r | r ,
in which P σ : Θ , I σ : Θ and N σ : Θ indicate the truth, indeterminacy and falsity memberships in , Θ = 0 , 1 . Also the following condition is satisfied by P σ , I σ and N σ , 0 P σ r + I σ r + N σ r 3 ; r . Then, ζ is said to be a single valued neutrosophic set in . We denote this triplet ζ = P σ r , I σ r , N σ r , in whole study called SVNN.
Ye [14], Wang et al. [33] and [34] proposed the basic operations of SVNNs, which are as follows:
Definition 4.
[34] For any two SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r and ζ q = P ξ q r , I ξ q r , N ξ q r in. The union, intersection and compliment are proposed as:
(1) ζ p ζ q i f f r , P ξ p r P ξ q r , I ξ p r I ξ q r and N ξ p r N ξ q r ;
(2) ζ p = ζ q i f f ζ p ζ q and ζ q ζ p ;
(3) ζ p ζ q = max P ξ p , P ξ q , min I ξ p , I ξ q , min N ξ p , N ξ q ;
(4) ζ p ζ q = min P ξ p , P ξ q , max I ξ p , I ξ q , max N ξ p , N ξ q ;
(5) ζ p c = N ξ p , I ξ p , P ξ p .
Definition 5.
[13,15,33] For any two SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r and ζ q = P ξ q r , I ξ q r , N ξ q r inand β 0 . Then the operations of SVNNs are proposed as:
(1) ζ p ζ q = P ξ p + P ξ q P ξ p · P ξ q , I ξ p · I ξ q , N ξ p · N ξ q ;
(2) β · ζ p = 1 ( 1 P ξ p ) β , ( I ξ p ) β , ( N ξ p ) β ;
(3) ζ p ζ q = P ξ p · P ξ q , I ξ p + I ξ q I ξ p · I ξ q , N ξ p + N ξ q N ξ p · N ξ q ;
(4) ζ p β = ( P ξ p ) β , 1 ( 1 I ξ p ) β , 1 ( 1 N ξ p ) β .
(5) β ζ p = β 1 P ξ p , 1 β I ξ p , 1 β N ξ p i f β 0 , 1 1 β 1 P ξ p , 1 1 β I ξ p , 1 1 β N ξ p i f β 1
Definition 6.
[33] For any three SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r , ζ q = P ξ q r , I ξ q r , N ξ q r and ζ l = P σ l r , I σ l r , N σ l r inand β 1 , β 2 0 . Then, we have
(1) ζ p ζ q = ζ q ζ p ;
(2) ζ p ζ q = ζ q ζ p ;
(3) β 1 ( ζ p ζ q ) = β 1 ζ p β 1 ζ q , β 1 > 0 ;
(4) ( ζ p ζ q ) β 1 = ζ p β 1 ζ q β 1 , β 1 > 0 ;
(5) β 1 ζ p β 2 ζ p = ( β 1 + β 2 ) ζ p , β 1 > 0 , β 2 > 0 ;
(6) ζ p β 1 ζ p β 2 = ζ p β 1 + β 2 , β 1 > 0 , β 2 > 0 ;
(7) ( ζ p ζ q ) ζ l = ζ p ( ζ q ζ l ) ;
(8) ( ζ p ζ q ) ζ l = ζ p ( ζ q ζ l ) .
Definition 7.
[33] For any SVNN ζ p = P ξ p r , I ξ p r , N ξ p r in. Then score and accuracy values are defined as:
(1) S ˜ ( ζ p ) = P ξ p I ξ p N ξ p
(2) A ˜ ( ζ p ) = P ξ p + I ξ p + N ξ p
The above definitions of score and accuracy funtions suggest which SVNN is greater than other SVNNs. The comparison technique is defined in following definition.
Definition 8.
[33] For any SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , 2 in.
Then comparison techniques are proposed as:
(1) If S ˜ ( ζ 1 ) < S ˜ ( ζ 2 ) , then ζ 1 < ζ 2 ,
(2) If S ˜ ( ζ 1 ) > S ˜ ( ζ 2 ) , then ζ 1 > ζ 2 ,
(3) If S ˜ ( ζ 1 ) = S ˜ ( ζ 2 ) , and
(a) A ˜ ( ζ 1 ) < A ˜ ( ζ 2 ) , then ζ 1 < ζ 2 ,
(b) A ˜ ( ζ 1 ) > A ˜ ( ζ 2 ) , then ζ 1 > ζ 2 ,
(c) A ˜ ( ζ 1 ) = A ˜ ( ζ 2 ) , then ζ 1 ζ 2 .
Garg and Nancy [10] proposed some logarithmic-based aggregation operators, which are as follows:
Definition 9.
[10] For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , 2 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 . Then, the structure of logarithmic single valued neutrosophic weighted averaging (L-SVNWA) operator is defined as:
L S V N W A ζ 1 , ζ 2 , , ζ n = 1 p = 1 n o g σ p P ξ p β p , p = 1 n o g σ p 1 I ξ p β p , p = 1 n o g σ p 1 N ξ p β p ,
where β p p = 1 , 2 , , n are weight vectors with β p 0 and p = 1 n β p = 1 .
Definition 10.
[10] For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , 2 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 . Then, the structure of the logarithmic single-valued neutrosophic-ordered weighted averaging (L-SVNOWA) operator is defined as:
L S V N O W A ζ 1 , ζ 2 , , ζ n = 1 p = 1 n o g σ p P ζ η ( p ) β p , p = 1 n o g σ p 1 I ζ η ( p ) β p , p = 1 n o g σ p 1 N ζ η ( p ) β p ,
where β p p = 1 , 2 , , n are weighting vector with β p 0 , p = 1 n β p = 1 and p t h largest weighted value is ζ η ( p ) consequently by total order ζ η ( 1 ) ζ η ( 2 ) ζ η ( n ) .
Definition 11.
[10] For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , 2 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 . Then, the structure of logarithmic single-valued neutrosophic-weighted geometric (L-SVNWG) operator is defined as:
L S V N W G ζ 1 , ζ 2 , , ζ n = p = 1 n 1 o g σ p P ξ p β p , 1 p = 1 n 1 o g σ p 1 I ξ p β p , 1 p = 1 n 1 o g σ p 1 N ξ p β p ,
where β p p = 1 , 2 , , n are weight vectors with β p 0 and p = 1 n β p = 1 .
Definition 12.
[10] For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , 2 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 . Then, the structure of logarithmic single valued neutrosophic ordered weighted geometric (L-SVNOWG) operator is defined as:
L S V N O W G ζ 1 , ζ 2 , , ζ n = p = 1 n 1 o g σ p P ξ η ( p ) β p , 1 p = 1 n 1 o g σ p 1 I ξ η ( p ) β p , 1 p = 1 n 1 o g σ p 1 N ξ η ( p ) β p ,
where β p p = 1 , 2 , , n are weighting vector with β p 0 and p = 1 n β p = 1 and p t h are the largest weighted value is ζ η ( p ) consequently by total order ζ η ( 1 ) ζ η ( 2 ) ζ η ( n ) .

3. Logarithmic Operational Laws

Motivated by the well growing concept of SVNSs, we introduce some novel logarithmic operational laws for single valued neutrosophic numbers. As in real number systems o g σ 0 is meaningless and o g σ 1 is not defined therefore, in our study we take non-empty SVNSs and σ 1 , where σ is any real number.
Definition 13.
For any SVNN ζ p = P ξ p r , I ξ p r , N ξ p r in . The logarithmic SVNN is defined as:
o g σ ζ p = 1 o g σ P ξ p r , o g σ 1 I ξ p r , o g σ 1 N ξ p r | r ,
in which P σ : Θ , I σ : Θ and N σ : Θ are indicated the truth, indeterminacy and falsity memberships in , Θ = 0 , 1 be the unit interval. Also following condition is satisfied by P σ , I σ and N σ , 0 P σ r + I σ r + N σ r 3 ; r . Therefore the truth membership grade is
1 o g σ P ξ p r : Θ , such that 0 1 o g σ P ξ p r 1 , for all r
the indeterminacy membership is
o g σ 1 I ξ p r : Θ , such that 0 o g σ 1 I ξ p r 1 , for all r
and falsity membership is
o g σ 1 N ξ p r : Θ , such that 0 o g σ 1 N ξ p r 1 , for all r .
Therefore
o g σ ζ p = 1 o g σ P ξ p r , o g σ 1 I ξ p r , o g σ 1 N ξ p r | r 0 < σ min P ξ p , 1 I ξ p , 1 N ξ p 1 , σ 1
is SVNS.
Definition 14.
For any SVNN ζ p = P ξ p r , I ξ p r , N ξ p r in . If
o g σ ζ p = 1 o g σ P ξ p r , o g σ 1 I ξ p r , o g σ 1 N ξ p r 0 < σ min P ξ p , 1 I ξ p , 1 N ξ p < 1 1 o g 1 σ P ξ p r , o g 1 σ 1 I ξ p r , o g 1 σ 1 N ξ p r 0 < 1 σ min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1
then the function o g σ ζ p is known to be a logarithmic operator for SVNS, and its value is said to be logarithmic SVNN (L-SVNN). Here, we take o g σ 0 = 0 , σ > 0 , σ 1 .
Theorem 1.
[10] For any SVNN ζ p = P ξ p r , I ξ p r , N ξ p r in , then o g σ ζ p is also be SVNN.
Now, we give some discussion on the basic properties of the L-SVNN.
Definition 15.
For any two L-SVNNs o g σ ζ p = 1 o g σ P ξ p r , o g σ 1 I ξ p r , o g σ 1 N ξ p r and o g σ ζ q = 1 o g σ P ξ q r , o g σ 1 I ξ q r , o g σ 1 N ξ q r inand β 0 . Then the logarithmic operations of L-SVNNs are propose as
(1) o g σ ζ p o g σ ζ q = 1 o g σ P ξ p r · o g σ P ξ q r , o g σ 1 I ξ p r · o g σ 1 I ξ q r , o g σ 1 N ξ p r · o g σ 1 N ξ q r ;
(2) β · o g σ ζ p = 1 o g σ P ξ p r β , o g σ 1 I ξ p r β , o g σ 1 N ξ p r β ;
(3) o g σ ζ p o g σ ζ q = 1 o g σ P ξ p r · 1 o g σ P ξ q r , 1 1 o g σ 1 I ξ p r · 1 o g σ 1 I ξ q r , 1 1 o g σ 1 N ξ p r · 1 o g σ 1 N ξ q r ;
(4) o g σ ζ p β = 1 o g σ P ξ p r β , 1 1 o g σ 1 I ξ p r β , 1 1 o g σ 1 N ξ p r β .
Theorem 2.
[10] For any two L-SVNNs o g σ ζ p = 1 o g σ P ξ p r , o g σ 1 I ξ p r , o g σ 1 N ξ p r p = 1 , 2 in, with 0 < σ min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 , β , β 1 , β 2 > 0 be any real numbers. Then
(1) β o g σ ζ 1 o g σ ζ 2 = β o g σ ζ 1 β o g σ ζ 2 ;
(2) o g σ ζ 1 o g σ ζ 2 β = o g σ ζ 1 β o g σ ζ 2 β ;
(3) β 1 o g σ ζ 1 β 2 o g σ ζ 1 = β 1 + β 2 o g σ ζ 1 ;
(4) o g σ ζ 1 β 1 o g σ ζ 1 β 2 = o g σ ζ 1 β 1 + β 2 ;
(5) o g σ ζ 1 β 1 β 2 = o g σ ζ 1 β 1 β 2 .

Comparison Technique for L-SVNNs

Definition 16.
[10] For any L-SVNN o g σ ζ p = 1 o g σ P ξ p r , o g σ 1 I ξ p r , o g σ 1 N ξ p r in. Then score and accuracy values are define as
(1) S ˜ ( o g σ ζ p ) = 1 o g σ P ξ p r o g σ 1 I ξ p r o g σ 1 N ξ p r
(2) A ˜ ( o g σ ζ p ) = 1 o g σ P ξ p r + o g σ 1 I ξ p r + o g σ 1 N ξ p r
The above defined score and accuracy values suggest which L-SVNN are greater than other L-SVNNs. The comparison technique is defined in the following definition.
Definition 17.
For any L-SVNNs o g σ ζ p = 1 o g σ P ξ p r , o g σ 1 I ξ p r , o g σ 1 N ξ p r p = 1 , 2 in. Then, comparison technique is proposed as:
(1) If S ˜ ( o g σ ζ 1 ) < S ˜ ( o g σ ζ 2 ) then o g σ ζ 1 < o g σ ζ 2 ,
(2) If S ˜ ( o g σ ζ 1 ) > S ˜ ( o g σ ζ 2 ) then o g σ ζ 1 > o g σ ζ 2 ,
(3) If S ˜ ( o g σ ζ 1 ) = S ˜ ( o g σ ζ 2 ) then
(a) A ˜ ( o g σ ζ 1 ) < A ˜ ( o g σ ζ 2 ) then o g σ ζ 1 < o g σ ζ 2 ,
(b) A ˜ ( o g σ ζ 1 ) > A ˜ ( o g σ ζ 2 ) then o g σ ζ 1 > o g σ ζ 2 ,
(c) A ˜ ( o g σ ζ 1 ) = A ˜ ( o g σ ζ 2 ) then o g σ ζ 1 o g σ ζ 2 .

4. Logarithmic Aggregation Operators for L-SVNNs

Now, we propose novel logarithmic hybrid aggregation operators for L-SVNNs based on logarithmic operations laws as follows:

4.1. Logarithmic Hybrid Averaging Operator

Definition 18.
For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 . The structure of logarithmic single valued neutrosophic hybrid weighted averaging (L-SVNHWA) operator is
L S V N H W A ζ 1 , ζ 2 , , ζ n = p = 1 n ω p o g σ p ζ η p ,
where β p p = 1 , , n is the weighting vector with β p 0 and p = 1 n β p = 1 and p t h biggest weighted value is ζ η ( p ) ζ η ( p ) = n β p ζ η ( p ) , P N consequently by total order ζ η ( 1 ) ζ η ( 2 ) ζ η ( n ) . Also, the associated weights are ω = ( ω 1 , ω 2 , , ω n ) with ω p 0 , Σ p = 1 n ω p = 1 .
Theorem 3.
For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 . Then by using logarithmic operations and Definition 18, L S V N H W A is defined as
L S V N H W A ζ 1 , ζ 2 , , ζ n = 1 p = 1 n o g σ p P ξ η p ω p , p = 1 n o g σ p 1 I ξ η p ω p , p = 1 n o g σ p 1 N ξ η p ω p 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 1 p = 1 n o g 1 σ p P ξ η p ω p , p = 1 n o g 1 σ p 1 I ξ η p ω p , p = 1 n o g 1 σ p 1 N ξ η p ω p 0 < 1 σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1
where β p p = 1 , , n are weighting vector with β p 0 and p = 1 n β p = 1 and p t h biggest weighted value is ζ η ( p ) ζ η ( p ) = n β p ζ η ( p ) , P N consequently by total order ζ η ( 1 ) ζ η ( 2 ) ζ η ( n ) . Also the associated weights are ω = ( ω 1 , ω 2 , , ω n ) with ω p 0 , Σ p = 1 n ω p = 1 .
Proof. 
Using mathematical induction to prove Equation (3), we proceed as:
(a) For n = 2 , since
ω 1 o g σ 1 ζ η 1 = 1 o g σ 1 P ξ η 1 ω 1 , o g σ 1 1 I ξ η 1 ω 1 , o g σ 1 1 N ξ η 1 ω 1
and
ω 2 o g σ 2 ζ η 2 = 1 o g σ 2 P ξ η 2 ω 2 , o g σ 2 1 I ξ η 2 ω 2 , o g σ 2 1 N ξ η 2 ω 2
Then
L S V N H W A ζ 1 , ζ 2 = ω 1 o g σ 1 ζ η 1 ω 2 o g σ 2 ζ η 2 = 1 o g σ 1 P ξ η 1 ω 1 , o g σ 1 1 I ξ η 1 ω 1 , o g σ 1 1 N ξ η 1 ω 1 1 o g σ 2 P ξ η 2 ω 2 , o g σ 2 1 I ξ η 2 ω 2 , o g σ 2 1 N ξ η 2 ω 2 = 1 o g σ 1 P ξ η 1 ω 1 · o g σ 2 P ξ η 2 ω 2 , o g σ 1 1 I ξ η 1 ω 1 · o g σ 2 1 I ξ η 2 ω 2 , o g σ 1 1 N ξ η 1 ω 1 · o g σ 2 1 N ξ η 2 ω 2 = 1 p = 1 2 o g σ p P ξ η p ω p , p = 1 n o g σ p 1 I ξ η p ω p , p = 1 n o g σ p 1 N ξ η p ω p .
(b) Now Equation (3) is true for n = k ,
L S V N H W A ζ 1 , ζ 2 , , ζ k = 1 p = 1 k o g σ p P ξ η p ω p , p = 1 k o g σ p 1 I ξ η p ω p , p = 1 k o g σ p 1 N ξ η p ω p .
(c) Now, we prove that Equation (3) for n = k + 1 , that is
L S V N H W A ζ 1 , ζ 2 , , ζ k = p = 1 k ω p o g σ p ζ η p + ω k + 1 o g σ k + 1 ζ η k + 1
L S V N H W A ζ 1 , ζ 2 , , ζ k = 1 p = 1 k o g σ p P ξ η p ω p , p = 1 k o g σ p 1 I ξ η p ω p , p = 1 k o g σ p 1 N ξ η p ω p 1 o g σ k + 1 P ξ η k + 1 ω k + 1 , o g σ k + 1 1 I ξ η k + 1 ω k + 1 , o g σ k + 1 1 N ξ η k + 1 ω k + 1 = 1 p = 1 k + 1 o g σ p P ξ η p ω p , p = 1 k + 1 o g σ p 1 I ξ η p ω p , p = 1 k + 1 o g σ p 1 N ξ η p ω p
Thus Equation (3) is true for n = z + 1 . Hence its satisfies for whole n. Therefore
L S V N H W A ζ 1 , ζ 2 , , ζ n = 1 p = 1 n o g σ p P ξ η p ω p , p = 1 n o g σ p 1 I ξ η p ω p , p = 1 n o g σ p 1 N ξ η p ω p .
In a similarly way, if 0 < 1 σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 , we can also obtain
L S V N H W A ζ 1 , ζ 2 , , ζ n = 1 p = 1 n o g 1 σ p P ξ η p ω p , p = 1 n o g 1 σ p 1 I ξ η p ω p , p = 1 n o g 1 σ p 1 N ξ η p ω p
which completes the proof. □
Remark 1.
If σ 1 = σ 2 = σ 3 = = σ n = σ , that is 0 < σ min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 , then L S V N H W A operator is reduced as follows
L S V N H W A ζ 1 , ζ 2 , , ζ n = 1 p = 1 n o g σ P ξ η p ω p , p = 1 n o g σ 1 I ξ η p ω p , p = 1 n o g σ 1 N ξ η p ω p .

Properties

L S V N H W A operator satisfies some properties are enlist below;
(1) Idempotency: For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. Then, if collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n are identical, that is
L S V N H W A ζ 1 , ζ 2 , , ζ n = ζ .
(2) Boundedness: for any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. ζ p = min p P ξ p , max p I ξ p , max p N ξ p and ζ p + = max p P ξ p , min p I ξ p , min p N ξ p p = 1 , , n in , therefore
ζ p L S V N H W A ζ 1 , ζ 2 , , ζ n ζ p + .
(3) Monotonically: for any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. If ζ η p ζ η p for p = 1 , , n , then
L S V N H W A ζ 1 , ζ 2 , , ζ n L S V N H W A ζ 1 , ζ 2 , , ζ n .

4.2. Logarithmic Hybrid Geometric Operators

Definition 19.
For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 . The structure of logarithmic single valued neutrosophic hybrid weighted geometric (L-SVNHWG) operator is
L S V N H W G ζ 1 , ζ 2 , , ζ n = p = 1 n o g σ p ζ η p ω p
where β p p = 1 , , n are weight vectors with β p 0 and p = 1 n β p = 1 and p t h biggest weighted value is ζ η ( p ) ζ η ( p ) = ζ η ( p ) n β p , P N consequently by total order ζ η ( 1 ) ζ η ( 2 ) ζ η ( n ) . Also associated weights are ω = ( ω 1 , ω 2 , , ω n ) with ω p 0 , Σ p = 1 n ω p = 1 .
Theorem 4.
For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 . Then by using logarithmic operations and Definition 19, L-SVNHWG define as
L S V N H W G ζ 1 , ζ 2 , , ζ n = p = 1 n 1 o g σ p P ξ η p β p 1 p = 1 n 1 o g σ p 1 I ξ η p β p 1 p = 1 n 1 o g σ p 1 n ξ η p β p 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 p = 1 n 1 o g 1 σ p P ξ η p β p 1 p = 1 n 1 o g 1 σ p 1 I ξ η p β p 1 p = 1 n 1 o g 1 σ p 1 n ξ η p β p 0 < 1 σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1
where β p p = 1 , , n are weight vectors with β p 0 and p = 1 n β p = 1 and p t h biggest weighted value is ζ η ( p ) ζ η ( p ) = ζ η ( p ) n β p , P N consequently by total order ζ η ( 1 ) ζ η ( 2 ) ζ η ( n ) . Also associated weights are ω = ( ω 1 , ω 2 , , ω n ) with ω p 0 , Σ p = 1 n ω p = 1 .
Proof. 
Using mathematical induction to prove Equation (4), we proceed as:
(a) For n = 2 , since
o g σ 1 ζ 1 ω 1 = 1 o g σ 1 P ξ 1 ω 1 1 1 o g σ 1 1 I ξ 1 ω 1 1 1 o g σ 1 1 N ξ 1 ω 1
and
o g σ 2 ζ 2 ω 2 = 1 o g σ 2 P ξ 2 ω 2 1 1 o g σ 2 1 I ξ 2 ω 2 1 1 o g σ 2 1 N ξ 2 ω 2 .
Then
L S V N H W G ζ 1 , ζ 2 = o g σ 1 ζ 1 ω 1 o g σ 2 ζ 2 ω 2 = 1 o g σ 1 P ξ 1 ω 1 1 1 o g σ 1 1 I ξ 1 ω 1 1 1 o g σ 1 1 N ξ 1 ω 1 1 o g σ 2 P ξ 2 ω 2 1 1 o g σ 2 1 I ξ 2 ω 2 1 1 o g σ 2 1 N ξ 2 ω 2 = 1 o g σ 1 P ξ 1 ω 1 · 1 o g σ 2 P ξ 2 ω 2 1 1 o g σ 1 1 I ξ 1 ω 1 · 1 o g σ 2 1 I ξ 2 ω 2 1 1 o g σ 1 1 N ξ 1 ω 1 · 1 o g σ 2 1 N ξ 2 ω 2 = p = 1 2 1 o g σ p P ξ p ω p , 1 p = 1 2 1 o g σ p 1 I ξ p ω p 1 p = 1 2 1 o g σ p 1 N ξ p ω p .
(b) Now Equation (4) is true for n = k ,
L S V N H W G ζ 1 , ζ 2 , , ζ k = p = 1 k 1 o g σ p P ξ p ω p 1 p = 1 k 1 o g σ p 1 I ξ p ω p 1 p = 1 k 1 o g σ p 1 N ξ p ω p ,
(c) Now, we prove that Equation (4) for n = k + 1 , that is
L S V N H W G ζ 1 , ζ 2 , , ζ k , ζ k + 1 = p = 1 k o g σ p ζ p ω p o g σ k + 1 ζ k + 1 ω k + 1
L S V N H W G ζ 1 , ζ 2 , , ζ k , ζ k + 1 = p = 1 k 1 o g σ p P ξ p ω p 1 p = 1 k 1 o g σ p 1 I ξ p ω p 1 p = 1 k 1 o g σ p 1 N ξ p ω p 1 o g σ p P ξ k + 1 ω k + 1 1 1 o g σ p 1 I ξ k + 1 ω k + 1 1 1 o g σ p 1 N ξ k + 1 ω k + 1 = p = 1 k + 1 1 o g σ p P ξ p ω p 1 p = 1 k + 1 1 o g σ p 1 I ξ p ω p 1 p = 1 k + 1 1 o g σ p 1 N ξ p ω p
Thus Equation (4) is true for n = z + 1 . Hence it is satisfied for all n. Therefore
L S V N H W G ζ 1 , ζ 2 , , ζ n = p = 1 n 1 o g σ p P ξ p ω p 1 p = 1 n 1 o g σ p 1 I ξ p ω p 1 p = 1 n 1 o g σ p 1 N ξ p ω p .
In a similar way, if 0 < 1 σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 , we can also obtain
L S V N H W G ζ 1 , ζ 2 , , ζ n = p = 1 n 1 o g 1 σ p P ξ p ω p 1 p = 1 n 1 o g 1 σ p 1 I ξ p ω p 1 p = 1 n 1 o g 1 σ p 1 N ξ p ω p
which completes the proof. □
Remark 2.
If σ 1 = σ 2 = σ 3 = = σ n = σ , that is 0 < σ min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 , then L S V N H W G operator reduced as follows
L S V N H W G ζ 1 , ζ 2 , , ζ n = p = 1 n 1 o g σ P ξ p ω p 1 p = 1 n 1 o g σ 1 I ξ p ω p 1 p = 1 n 1 o g σ 1 N ξ p ω p .

Properties

L S V N H W G operator satisfies some properties are enlist below;
(1) Idempotency: for any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. Then, if collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n are identical, that is
L S V N H W G ζ 1 , ζ 2 , , ζ n = ζ .
(2) Boundedness: for any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. ζ p = min p P ξ p , max p I ξ p , max p N ξ p and ζ p + = max p P ξ p , min p I ξ p , min p N ξ p p = 1 , , n in , therefore
ζ p L S V N H W G ζ 1 , ζ 2 , , ζ n ζ p + .
(3) Monotonically: for any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. If ζ p ζ p for p = 1 , , n , then
L S V N H W G ζ 1 , ζ 2 , , ζ n L S V N H W G ζ 1 , ζ 2 , , ζ n .

4.3. Generalized Logarithmic Averaging Operator

Definition 20.
For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 . The structure of logarithmic generalized single-valued neutrosophic weighted averaging (L-GSVNWA) operator is
L G S V N W A ζ 1 , ζ 2 , , ζ n = p = 1 n β p o g σ p ζ p γ 1 γ
where β p p = 1 , , n are weighting vector with β p 0 and p = 1 n β p = 1 .
Theorem 5.
For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 , γ 1 . Then by using logarithmic operations and Definition 20, L G S V N W A define as
L G S V N W A ζ 1 , ζ 2 , , ζ n 1 p = 1 n 1 1 o g σ p P ξ p γ β p 1 γ , 1 1 p = 1 n 1 1 o g σ p 1 I ξ p γ β p 1 γ 1 1 p = 1 n 1 1 o g σ p 1 N ξ p γ β p 1 γ 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 1 p = 1 n 1 1 o g 1 σ p P ξ p γ β p 1 γ , 1 1 p = 1 n 1 1 o g 1 σ p 1 I ξ p γ β p 1 γ 1 1 p = 1 n 1 1 o g 1 σ p 1 N ξ p γ β p 1 γ 0 < 1 σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1
where β p p = 1 , , n are weighting vector with β p 0 and p = 1 n β p = 1 .
Apparently, if we use γ = 1 , then the L G S V N W A operator is becomes into L S V N W A operator.
Proof. 
Theorem 5 take the form by utilized the technique of mathematical induction and procedure is eliminate here. □
Remark 3.
If σ 1 = σ 2 = σ 3 = = σ n = σ , that is 0 < σ min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 , then L G S V N W A operator reduced as follows
L G S V N W A ζ 1 , ζ 2 , , ζ n = 1 p = 1 n 1 1 o g σ P ξ p γ β p 1 γ , 1 1 p = 1 n 1 1 o g σ 1 I ξ p γ β p 1 γ 1 1 p = 1 n 1 1 o g σ 1 N ξ p γ β p 1 γ .

Properties

L G S V N W A operator satisfies some properties are enlist below;
(1) Idempotency: For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. Then, if collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n are identical, that is
L G S V N W A ζ 1 , ζ 2 , , ζ n = ζ .
(2) Boundedness: for any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. ζ p = min p P ξ p , max p I ξ p , max p N ξ p and ζ p + = max p P ξ p , min p I ξ p , min p N ξ p p = 1 , , n in , therefore
ζ p L G S V N W A ζ 1 , ζ 2 , , ζ n ζ p + .
(3) Monotonically: for any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. If ζ p ζ p for p = 1 , , n , then
L G S V N W A ζ 1 , ζ 2 , , ζ n L G S V N W A ζ 1 , ζ 2 , , ζ n .

4.4. Generalized Logarithmic Geometric Operator

Definition 21.
For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 . The structure of logarithmic generalized single valued neutrosophic weighted geometric (L-GSVNWG) operator is
L G S V N W G ζ 1 , ζ 2 , , ζ n = p = 1 n o g σ p ζ p γ β p 1 γ
where β p p = 1 , , n are weighting vector with β p 0 and p = 1 n β p = 1 .
Theorem 6.
For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in, with 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 , γ 1 . Then by using logarithmic operations and definition (21), L G S V N W G define as
L G S V N W G ζ 1 , ζ 2 , , ζ n 1 1 p = 1 n 1 o g σ p P ξ p γ β p 1 γ , 1 p = 1 n 1 o g σ p 1 I ξ p γ β p 1 γ 1 p = 1 n 1 o g σ p 1 N ξ p γ β p 1 γ 0 < σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 1 1 p = 1 n 1 o g 1 σ p P ξ p γ β p 1 γ , 1 p = 1 n 1 o g 1 σ p 1 I ξ p γ β p 1 γ 1 p = 1 n 1 o g 1 σ p 1 N ξ p γ β p 1 γ 0 < 1 σ p min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1
where β p p = 1 , , n is the weighting vector with β p 0 and p = 1 n β p = 1 .
Apparently, if we use γ = 1 , then the L G S V N W G operator is becomes into L S V N W G operator.
Proof. 
Theorem 6 takes the form by utilizing the technique of mathematical induction and the procedure is eliminated here. □
Remark 4.
If σ 1 = σ 2 = σ 3 = = σ n = σ , that is 0 < σ min P ξ p , 1 I ξ p , 1 N ξ p < 1 , σ 1 , then L G S V N W G operator reduced as follows
L G S V N W G ζ 1 , ζ 2 , , ζ n = 1 1 p = 1 n 1 o g σ P ξ p γ β p 1 γ , 1 p = 1 n 1 o g σ 1 I ξ p γ β p 1 γ 1 p = 1 n 1 o g σ 1 N ξ p γ β p 1 γ .

Properties

L G S V N W G operator satisfies some properties are enlist below;
(1) Idempotency: For any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. Then, if collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n are identical, that is
L G S V N W G ζ 1 , ζ 2 , , ζ n = ζ .
(2) Boundedness: for any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. ζ p = min p P ξ p , max p I ξ p , max p N ξ p and ζ p + = max p P ξ p , min p I ξ p , min p N ξ p p = 1 , , n in , therefore
ζ p L G S V N W G ζ 1 , ζ 2 , , ζ n ζ p + .
(3) Monotonically: for any collection of SVNNs ζ p = P ξ p r , I ξ p r , N ξ p r p = 1 , , n in ℜ. If ζ p ζ p for p = 1 , , n , then
L G S V N W G ζ 1 , ζ 2 , , ζ n L G S V N W G ζ 1 , ζ 2 , , ζ n .

5. Proposed Technique for Solving Decision-Making Problems

This section includes the new approach to decision-making based on the single-valued neutrosophic sets, and we will propose a decision-making matrix as indicated below.
Let H = ( h 1 , h 2 , , h m ) be a distinct collection of m probable alternatives and Y = ( y 1 , y 2 , , y n ) be a finite collection of n criteria, where h i indicate the i-th alternatives and y j indicate the j-th criteria. Let D = ( d 1 , d 2 , , d t ) be a finite set of t experts, where d k indicate the k-th expert. The expert d k supply her appraisal of an alternative h i on an attribute y j as a SVNNs ( i = 1 , , m ; j = 1 , , n ) . The expert’s information is represented by the SVNS decision-making matrix D s = E i p s m × n . Assume that β p ( p = 1 , , m ) is the weight vector of the attribute y j , where 0 β p 1 , p = 1 n β p = 1 and ψ = ( ψ 1 , ψ 2 , , ψ m ) be the weights of the decision makers d k such that ψ k 1 , k = 1 n ψ k = 1 .
When we construct the SVNS decision-making matrices, D s = E i p s m × n for decision. Basically, criteria have two types, one is benefit criteria and other one is cost criteria. If the SVNS decision matrices have cost-type criteria metrics D s = E i p s m × n can be converted into the normalized SVNS decision matrices, R s = r i p s m × n , where r i p s = E i p s , for benefit criteria A p E ¯ i p s , for cos t criteria A p , j = 1 , , n , and E ¯ i p s is the complement of E i p s . The normalization is not required, if the criteria have the same type.
Step 1: In this step, we get the neutrosophic information, using the all proposed logarithmic aggregation operators to evolute the alternative preference values with associated weights, which are ω = ( ω 1 , ω 2 , , ω n ) with ω p 0 , Σ p = 1 n ω p = 1 .
Step 2: We find the score value S ˜ ( o g σ ζ p ) and the accuracy value A ˜ ( o g σ ζ p ) of the cumulative total preference value h i ( i = 1 , , m ) .
Step 3: By definition, we give ranking to the alternatives h i ( i = 1 , , m ) and choose the best alternative which has the maximum score value.

5.1. Numerical Example

Assume that there is a committee which selects five applicable emerging technology enterprises H g ( g = 1 , , 5 ) , which are given as follows.
(1)
Augmented reality ( H 1 ) ,
(2)
Personalized medicine H 2 ,
(3)
Artificial intelligence H 3 ,
(4)
Gene drive H 4 and
(5)
Quantum computing H 5 .
They assess the possible rising technology enterprises according to the five attributes, which are
(1)
Advancement D 1 ,
(2)
Market risk D 2 ,
(3)
Financial investments D 3 ,
(4)
Progress of science and technology D 4 and
(5)
Designs D 5 .
To avoid the conflict between them, the decision makers take the attribute weights as β = ( 0.15 , 0.28 , 0.20 , 0.22 , 0.15 ) T . They construct the SVNS decision-making matrix given in Table 1.
Since D 1 , D 3 are benefit-type criteria and D 2 , D 4 is cost type criteria, the normalization is required for these decision matrices. Normalized decision matrices are shown in Table 2.
Step 1: Now, we apply all the proposed logarithmic aggregation operators to collective neutrosophic information as follows.
Case 1: Using logarithmic single-valued neutrosophic hybrid weighted averaging aggregation operator, we obtained the results shown in Table 3.
Case 2: Using Logarithmic single valued neutrosophic hybrid weighted geometric aggregation operator, we obtainedthe results shown in Table 4.
Step 2: We find the score index S ˜ ( o g σ ζ p ) and the accuracy index A ˜ ( o g σ ζ p ) of the cumulative overall preference value h i ( i = 1 , 2 , 3 , 4 , 5 ) .
Case 1: Using the score of aggregated information for L-SVNHWA operator, we obtained the results shown in Table 5.
Case 2: Score of Aggregated information for L-SVNHWG Operator, we obtained the results shown in Table 6.
Step 3: We find the best (suitable) alternative which has the maximum score value from the set of alternatives h i ( i = 1 , 2 , 3 , 4 , 5 ) . Overall preference value and ranking of the alternatives are summarized in Table 7.

5.2. Comparison with Existing Methods

This section consists of the comparative analysis of several existing aggregation operators of neutrosophic information with the proposed logarithmic single valued hybrid weighted aggregation operators. Existing methods for aggregated neutrosophic information are shown in Table 8, Table 9, Table 10 and Table 11.
Now, we analyze the ranking of the alternatives according to their aggregated information (in Table 12).
The bast alternative was H 2 . The obtained results utilizing logarithmic single valued neutrosophic hybrid weighted operators and logarithmic generalized single valued neutrosophic weighted operators were same as results shows existing methods. Hence, this study proposed novel logarithmic aggregation operators to aggregate the neutrosophic information more effectively and efficiently. Utilizing the proposed logarithmic aggregation operators, we sound the best alternative from a set of alternatives given by the decision maker. Hence the proposed MCDM technique based on logarithmic operators lets us find the best alternative as an applications in decision support systems.

6. Conclusions

In this work, an attempt has been made to present different kinds of logarithmic weighted averaging and geometric aggregation operators based on the single-valued neutrosophic set environment. Earlier, it has been observed that the various aggregation operators are defined under the SVNSs environment where the aggregation operators based on the algebraic or Einstein t-norm and t-conorm. In this paper, we proposed novel logarithmic hybrid aggregation operators and also logarithmic generalized averaging and geometric aggregation operators. Aggregation operators, namely L-SVNHWA, L-SVNHWG, L-GSVNWA and L-GSVNWA are developed under the SVNSs environment and we have studied their properties in detail. Further, depending on the standardization of the decision matrix and the proposed aggregation operators, a decision-making approach is presented to find the best alternative to the SVNSs environment. An illustrative example is taken for illustrating the developed approach, and their results are compared with some of the existing approaches of the SVNSs environment to show the validity of it. From the studies, we conclude that the proposed approach is more generic and suitable for solving the stated problem.
In the future, we shall link the proposed operators with some novel fuzzy sets, like as type 2 fuzzy sets, neutrosophic sets, and so on. Moreover, we may examine if our constructed approach can also be applied in different areas, such as personal evaluation, medical artificial intelligence, energy management and supplier selection evaluation.

Author Contributions

Conceptualization, S.A. (Shahzaib Ashraf) and S.A. (Saleem Abdullah); methodology, S.A. (Shahzaib Ashraf); software, S.A. (Shahzaib Ashraf); validation, S.A. (Shahzaib Ashraf), S.A. (Saleem Abdullah), F.S. and N.u.A.; formal analysis, F.S. and N.u.A.; investigation, S.A. (Shahzaib Ashraf); writing–original draft preparation, S.A.; writing–review and editing, S.A. (Shahzaib Ashraf); visualization, F.S.; supervision, S.A. (Saleem Abdullah); funding acquisition, F.S.

Funding

This research received no external funding.

Acknowledgments

The authors would like to thank the editor in chief, associate editor and the anonymous referees for detailed and valuable comments which helped to improve this manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Smarandache, F. A unifying field in logics: Neutrosophic logic. Am. Res. Press Rehoboth 1999, 1–141. [Google Scholar]
  4. Soria Frisch, A.; Koppen, M.; Sy, T. Is she gonna like it? automated inspection system using fuzzy aggregation. In Intelligent Systems for Information Processing; Elsevier: Amsterdam, The Netherlands, 2003; pp. 465–476. [Google Scholar]
  5. Broumi, S.; Bakal, A.; Talea, M.; Smarandache, F.; Vladareanu, L. Applying Dijkstra algorithm for solving neutrosophic shortest path problem. In Proceedings of the 2016 International Conference on Advanced Mechatronic Systems (ICAMechS), Melbourne, VIC, Australia, 30 November–3 December 2016; IEEE: Piscataway, NJ, USA, 2016; pp. 412–416. [Google Scholar]
  6. Broumi, S.; Bakal, A.; Talea, M.; Smarandache, F.; ALi, M. Shortest path problem under bipolar neutrosphic setting. Appl. Mech. Mater. 2017, 859, 59–66. [Google Scholar] [CrossRef]
  7. Broumi, S.; Bakal, A.; Talea, M.; Smarandache, F.; Vladareanu, L. Computation of shortest path problem in a network with sv-trapezoidal neutrosophic numbers. In Proceedings of the 2016 International Conference on Advanced Mechatronic Systems (ICAMechS), Melbourne, VIC, Australia, 30 November–3 December 2016; IEEE: Piscataway, NJ, USA, 2016; pp. 417–422. [Google Scholar]
  8. Broumi, S.; Smarandache, F. Correlation coefficient of interval neutrosophic set. In Applied Mechanics and Materials; Trans Tech Publications: Zurich, Switzerland, 2013; Volume 436, pp. 511–517. [Google Scholar]
  9. Broumi, S.; Talea, M.; Smarandache, F.; Bakali, A. Decision-making method based on the interval valued neutrosophic graph. In Proceedings of the Future Technologies Conference (FTC), San Francisco, CA, USA, 6–7 December 2016; pp. 44–50. [Google Scholar]
  10. Garg, H. New logarithmic operational laws and their applications to multiattribute decision making for single-valued neutrosophic numbers. Cognit. Syst. Res. 2018, 52, 931–946. [Google Scholar] [CrossRef]
  11. Liu, P.; Chu, Y.; Li, Y.; Chen, Y. Some generalized neutrosophic number hamacher aggregation operators and their application to group decision making. Int. J. Fuzzy Syst. 2014, 16, 242–255. [Google Scholar]
  12. Nancy, G.H.; Garg, H. Novel single-valued neutrosophic decision making operators under frank norm operations and its application. Int. J. Uncertain. Quant. 2016, 6, 361–375. [Google Scholar] [CrossRef]
  13. Ye, J. Single valued neutrosophic cross-entropy for multicriteria decision making problems. Appl. Math. Model. 2014, 38, 1170–1175. [Google Scholar] [CrossRef]
  14. Ye, J. Subtraction and division operations of simplified neutrosophic sets. Information 2017, 8, 51. [Google Scholar] [CrossRef]
  15. Ye, J. Exponential operations and aggregation operators of interval neutrosophic sets and their decision making methods. SpringerPlus 2016, 5, 1488. [Google Scholar] [CrossRef] [PubMed]
  16. Garg, H.; Nancy, G.H. Multi-Criteria Decision-Making Method Based on Prioritized Muirhead Mean Aggregation Operator under Neutrosophic Set Environment. Symmetry 2018, 10, 280. [Google Scholar] [CrossRef]
  17. Khan, Q.; Hassan, N.; Mahmood, T. Neutrosophic Cubic Power Muirhead Mean Operators with Uncertain Data for Multi-Attribute Decision-Making. Symmetry 2018, 10, 444. [Google Scholar] [CrossRef]
  18. Adlassnig, K.P. Fuzzy set theory in medical diagnosis. IEEE Trans. Syst. Man Cybern. 1986, 16, 260–265. [Google Scholar] [CrossRef]
  19. Ashraf, S.; Mahmood, T.; Abdullah, S.; Khan, Q. Different Approaches to Multi-Criteria Group Decision Making Problems for Picture Fuzzy Environment. Bull. Braz. Math. Soc. New Ser. 2018, 1–25. [Google Scholar] [CrossRef]
  20. Ashraf, S.; Mehmood, T.; Abdullah, S.; Khan, Q. Picture Fuzzy Linguistic Sets and Their Applications for Multi-Attribute Group. Nucleus 2018, 55, 66–73. [Google Scholar]
  21. Zeng, S.; Asharf, S.; Arif, M.; Abdullah, S. Application of Exponential Jensen Picture Fuzzy Divergence Measure in Multi-Criteria Group Decision Making. Mathematics 2019, 7, 191. [Google Scholar] [CrossRef]
  22. Ashraf, S.; Abdullah, S. Spherical aggregation operators and their application in multi attribute group decision making. Int. J. Intell. Syst. 2019, 34, 493–523. [Google Scholar] [CrossRef]
  23. Ashraf, S.; Abdullah, S.; Mahmood, T.; Ghani, F.; Mahmood, T. Spherical fuzzy sets and their applications in multi-attribute decision making problems. J. Intell. Fuzzy Syst. 2019, 1–16. [Google Scholar] [CrossRef]
  24. Wang, R.; Wang, J.; Gao, H.; Wei, G. Methods for MADM with Picture Fuzzy Muirhead Mean Operators and Their Application for Evaluating the Financial Investment Risk. Symmetry 2019, 11, 6. [Google Scholar] [CrossRef]
  25. Xu, Z. Intuitionistic fuzzy aggregation operators. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  26. Zhang, H.; Zhang, R.; Huang, H.; Wang, J. Some Picture Fuzzy Dombi Heronian Mean Operators with Their Application to Multi-Attribute Decision-Making. Symmetry 2018, 10, 593. [Google Scholar] [CrossRef]
  27. Ashraf, S.; Abdullah, S.; Mahmood, T. GRA method based on spherical linguistic fuzzy Choquet integral environment and its application in multi attribute decision making problems. Math. Sci. 2018, 12, 263–275. [Google Scholar] [CrossRef]
  28. Cuong, B.C. Picture Fuzzy Sets—First Results. Part 1, Seminar Neuro-Fuzzy Systems with Applications; Technical Report; Institute of Mathematics: Hanoi, Vietnam, 2013. [Google Scholar]
  29. Deschrijver, G.; Cornelis, C.; Kerre, E.E. On the representation of intuitionistic fuzzy t-norms and t-conorms. IEEE Trans. Fuzzy Syst. 2004, 12, 45–61. [Google Scholar] [CrossRef]
  30. Li, L.; Zhang, R.; Wang, J.; Shang, X.; Bai, K. A Novel Approach to Multi-Attribute Group Decision-Making with q-Rung Picture Linguistic Information. Symmetry 2018, 10, 172. [Google Scholar] [CrossRef]
  31. Xu, Z.; Yager, R.R. Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gen. Syst. 2006, 35, 417–433. [Google Scholar] [CrossRef]
  32. Smarandache, F. Neutrosophy. Neutrosophic Probability, Set, and Logic; ProQuest Information & Learning: Ann Arbor, MI, USA, 1998. [Google Scholar]
  33. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets. Multispace Multistruct. 2010, 4, 410–413. [Google Scholar]
  34. Zhang, X.; Bo, C.; Smarandache, F.; Dai, J. New inclusion relation of neutrosophic sets with applications and related lattice structure. Int. J. Mach. Learn. Cybern. 2018, 9, 1753–1763. [Google Scholar] [CrossRef]
  35. Peng, J.J.; Wang, J.Q.; Wang, J.; Zhang, H.Y.; Chen, Z.H. Simplified neutrosophic sets and their applications in multi-criteria group decision-making problems. Int. J. Syst. Sci. 2016, 47, 2342–2358. [Google Scholar] [CrossRef]
Table 1. Emerging Technology Enterprises D 1 .
Table 1. Emerging Technology Enterprises D 1 .
D 1 D 2 D 3 D 4 D 5
H 1 0.5 , 0.3 , 0.4 0.3 , 0.2 , 0.5 0.2 , 0.2 , 0.6 0.4 , 0.2 , 0.3 0.3 , 0.3 , 0.4
H 2 0.7 , 0.1 , 0.3 0.3 , 0.2 , 0.7 0.6 , 0.3 , 0.2 0.2 , 0.4 , 0.6 0.7 , 0.1 , 0.2
H 3 0.5 , 0.3 , 0.4 0.4 , 0.2 , 0.6 0.6 , 0.1 , 0.2 0.3 , 0.1 , 0.5 0.6 , 0.4 , 0.3
H 4 0.7 , 0.3 , 0.2 0.2 , 0.2 , 0.7 0.4 , 0.5 , 0.2 0.2 , 0.2 , 0.5 0.4 , 0.5 , 0.4
H 5 0.4 , 0.1 , 0.3 0.2 , 0.1 , 0.5 0.4 , 0.1 , 0.5 0.6 , 0.3 , 0.4 0.3 , 0.2 , 0.4
Table 2. Emerging Technology Enterprises R 1 .
Table 2. Emerging Technology Enterprises R 1 .
D 1 D 2 D 3 D 4 D 5
H 1 0.5 , 0.3 , 0.4 0.5 , 0.2 , 0.3 0.2 , 0.2 , 0.6 0.3 , 0.2 , 0.4 0.3 , 0.3 , 0.4
H 2 0.7 , 0.1 , 0.3 0.7 , 0.2 , 0.3 0.6 , 0.3 , 0.2 0.6 , 0.4 , 0.2 0.7 , 0.1 , 0.2
H 3 0.5 , 0.3 , 0.4 0.6 , 0.2 , 0.4 0.6 , 0.1 , 0.2 0.5 , 0.1 , 0.3 0.6 , 0.4 , 0.3
H 4 0.7 , 0.3 , 0.2 0.7 , 0.2 , 0.2 0.4 , 0.5 , 0.2 0.5 , 0.2 , 0.2 0.4 , 0.5 , 0.4
H 5 0.4 , 0.1 , 0.3 0.5 , 0.1 , 0.2 0.4 , 0.1 , 0.5 0.4 , 0.3 , 0.6 0.3 , 0.2 , 0.4
Table 3. Aggregated information using the logarithmic single valued neutrosophic hybrid weighted averaging (L-SVNHWA) operator for σ = 0.3 .
Table 3. Aggregated information using the logarithmic single valued neutrosophic hybrid weighted averaging (L-SVNHWA) operator for σ = 0.3 .
H 1 0.17624 , 0.23432 , 0.43885
H 2 0.66164 , 0.16229 , 0.21840
H 3 0.52788 , 0.18347 , 0.32224
H 4 0.49410 , 0.30962 , 0.20985
H 5 0.22496 , 0.12393 , 0.39318
Table 4. Aggregated information using logarithmic single valued neutrosophic hybrid weighted geometric (L-SVNHWG) operator for σ = 0.1 .
Table 4. Aggregated information using logarithmic single valued neutrosophic hybrid weighted geometric (L-SVNHWG) operator for σ = 0.1 .
H 1 0.52472 , 0.12638 , 0.24189
H 2 0.81968 , 0.10633 , 0.11764
H 3 0.74946 , 0.11782 , 0.17620
H 4 0.70685 , 0.18942 , 0.11685
H 5 0.58497 , 0.07427 , 0.23305
Table 5. Score of aggregated information for L-SVNHWA operator.
Table 5. Score of aggregated information for L-SVNHWA operator.
S ˜ ( o g 0.3 H 1 ) 1.14345 A ˜ ( o g 0.3 H 1 ) 0.25985
S ˜ ( o g 0.3 H 2 ) 0.30519 A ˜ ( o g 0.3 H 2 ) 1.0087
S ˜ ( o g 0.3 H 3 ) 0.02207 A ˜ ( o g 0.3 H 3 ) 0.96078
S ˜ ( o g 0.3 H 4 ) 0.08895 A ˜ ( o g 0.3 H 4 ) 0.91781
S ˜ ( o g 0.3 H 5 ) 0.76389 A ˜ ( o g 0.3 H 5 ) 0.28571
Table 6. Score of aggregated information for L-SVNHWG operator.
Table 6. Score of aggregated information for L-SVNHWG operator.
S ˜ ( o g 0.1 H 1 ) 0.540979 A ˜ ( o g 0.1 H 1 ) 0.89888
S ˜ ( o g 0.1 H 2 ) 0.810463 A ˜ ( o g 0.1 H 2 ) 1.01683
S ˜ ( o g 0.1 H 3 ) 0.736126 A ˜ ( o g 0.1 H 3 ) 1.01338
S ˜ ( o g 0.1 H 4 ) 0.704159 A ˜ ( o g 0.1 H 4 ) 0.994506
S ˜ ( o g 0.1 H 5 ) 0.618387 A ˜ ( o g 0.1 H 5 ) 0.903179
Table 7. Overall preference value and ranking of the alternatives.
Table 7. Overall preference value and ranking of the alternatives.
S ˜ ( H 1 ) S ˜ ( H 2 ) S ˜ ( H 3 ) S ˜ ( H 4 ) S ˜ ( H 5 ) Ranking
L-SVNHWA 1.143 0.305 0.022 0.088 0.763 H 2 > H 3 > H 4 > H 5 > H 1
L-SVNHWG 0.540 0.810 0.736 0.704 0.618 H 2 > H 3 > H 4 > H 5 > H 1
Table 8. Average aggregated SVN information.
Table 8. Average aggregated SVN information.
SVNWA [35]SVNOWA [35]NWA [14]
H 1 0.3779 , 0.2259 , 0.4002 0.3820 , 0.2449 , 0.4071 0.3779 , 0.2314 , 0.4223
H 2 0.6615 , 0.2052 , 0.2381 0.6663 , 0.1801 , 0.2430 0.6615 , 0.2426 , 0.2446
H 3 0.5656 , 0.1763 , 0.3131 0.5597 , 0.1838 , 0.3122 0.5656 , 0.2109 , 0.3272
H 4 0.5722 , 0.2929 , 0.2219 0.5706 , 0.3145 , 0.2219 0.5722 , 0.3348 , 0.2338
H 5 0.4165 , 0.1413 , 0.3607 0.3960 , 0.1373 , 0.3696 0.4165 , 0.1633 , 0.4131
Table 9. Average aggregated SVN information.
Table 9. Average aggregated SVN information.
SVNFWA [12]SVNHWA [11] γ = 2
H 1 0.3755 , 0.2262 , 0.4018 0.3725 , 0.2264 , 0.4033
H 2 0.6611 , 0.2072 , 0.2385 0.6608 , 0.2086 , 0.2388
H 3 0.5652 , 0.1779 , 0.3141 0.5648 , 0.1790 , 0.3149
H 4 0.5692 , 0.2956 , 0.2225 0.5663 , 0.2978 , 0.2230
H 5 0.4159 , 0.1422 , 0.3646 0.4151 , 0.1427 , 0.3680
Table 10. Average aggregated SVN information.
Table 10. Average aggregated SVN information.
SVNHWA [11] γ = 3 L-SVNWA [10]
H 1 0.3693 , 0.2266 , 0.4048 0.3130 , 0.1753 , 0.3544
H 2 0.6604 , 0.2099 , 0.2390 0.6486 , 0.1989 , 0.2313
H 3 0.5645 , 0.1800 , 0.3157 0.4989 , 0.1733 , 0.3321
H 4 0.5635 , 0.3000 , 0.2234 0.5585 , 0.2736 , 0.1942
H 5 0.4143 , 0.1432 , 0.3714 0.2849 , 0.1249 , 0.3758
Table 11. Average aggregated SVN information.
Table 11. Average aggregated SVN information.
L-SVNOWA [10]
H 1 0.3229 , 0.1926 , 0.3607
H 2 0.6549 , 0.1719 , 0.2368
H 3 0.4896 , 0.1823 , 0.3303
H 4 0.5561 , 0.2975 , 0.1942
H 5 0.2442 , 0.1209 , 0.3834
Table 12. Overall ranking of the alternatives.
Table 12. Overall ranking of the alternatives.
Existing OperatorsRanking
NWA [14] H 2 > H 3 > H 4 > H 5 > H 1
SVNWA [35] H 2 > H 3 > H 4 > H 5 > H 1
SVNOWA [35] H 2 > H 3 > H 4 > H 5 > H 1
SVNWG [35] H 2 > H 3 > H 4 > H 5 > H 1
SVNOWG [35] H 2 > H 3 > H 4 > H 5 > H 1
SVNFWA [12] H 2 > H 3 > H 4 > H 5 > H 1
SVNHWA [11] γ = 2 H 2 > H 3 > H 4 > H 5 > H 1
SVNHWA [11] γ = 3 H 2 > H 3 > H 4 > H 5 > H 1
NWG [14] H 2 > H 3 > H 4 > H 5 > H 1
SVNFWG [12] H 2 > H 3 > H 4 > H 5 > H 1
SVNHWG [11] γ = 2 H 2 > H 3 > H 4 > H 5 > H 1
SVNHWG [11] γ = 3 H 2 > H 3 > H 4 > H 5 > H 1
SNWEA [15] H 2 > H 3 > H 5 > H 4 > H 1
L-SVNWA [10] H 2 > H 4 > H 3 > H 5 > H 1
L-SVNOWA [10] H 2 > H 4 > H 3 > H 5 > H 1
L-SVNWG [10] H 2 > H 4 > H 3 > H 1 > H 5
L-SVNOWG [10] H 2 > H 3 > H 4 > H 5 > H 1
Proposed OperatorsRanking
L-SVNHWA H 2 > H 3 > H 4 > H 5 > H 1
L-SVNHWG H 2 > H 3 > H 4 > H 5 > H 1
L-GSVNWA H 2 > H 4 > H 3 > H 5 > H 1
L-GSVNWG H 2 > H 4 > H 3 > H 1 > H 5

Share and Cite

MDPI and ACS Style

Ashraf, S.; Abdullah, S.; Smarandache, F.; Amin, N.u. Logarithmic Hybrid Aggregation Operators Based on Single Valued Neutrosophic Sets and Their Applications in Decision Support Systems. Symmetry 2019, 11, 364. https://doi.org/10.3390/sym11030364

AMA Style

Ashraf S, Abdullah S, Smarandache F, Amin Nu. Logarithmic Hybrid Aggregation Operators Based on Single Valued Neutrosophic Sets and Their Applications in Decision Support Systems. Symmetry. 2019; 11(3):364. https://doi.org/10.3390/sym11030364

Chicago/Turabian Style

Ashraf, Shahzaib, Saleem Abdullah, Florentin Smarandache, and Noor ul Amin. 2019. "Logarithmic Hybrid Aggregation Operators Based on Single Valued Neutrosophic Sets and Their Applications in Decision Support Systems" Symmetry 11, no. 3: 364. https://doi.org/10.3390/sym11030364

APA Style

Ashraf, S., Abdullah, S., Smarandache, F., & Amin, N. u. (2019). Logarithmic Hybrid Aggregation Operators Based on Single Valued Neutrosophic Sets and Their Applications in Decision Support Systems. Symmetry, 11(3), 364. https://doi.org/10.3390/sym11030364

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop