Extension card · Neutrosophic
Neutrosophic CODAS
N-CODAS is the form of CODAS that works with single-valued neutrosophic numbers for situations where the degrees of truth, indeterminacy and falsity in criterion assessment are given separately. It computes two distinct distance measures through a score function and ranks the result with a single assessment score.
Base method
CODAS →
Philosophy, mechanics, strengths and weaknesses are on the base method card; this card describes only the difference.
Data type (family)
Neutrosophic →
What this data type is, when to use it, how to write it in a cell: the family's full account is here.
What Changes from the Base Method?
Four things change; the two-distance comparison logic does not.
Cells. In crisp CODAS every cell is a single number. Here every cell has three components: truth (T), indeterminacy (I) and falsity (F). Each lies between 0 and 1 and is independent of the others. Their sum can exceed 1. Criterion weights remain crisp here too. Indeterminacy is carried only in the criterion values.
Scale equalisation. Crisp CODAS divides a benefit criterion's value by the column's largest value. For a cost criterion, it takes the ratio of the column's smallest value to the value itself. In the neutrosophic cell, the cost direction is handled not by division but by complementing: the triple (T, I, F) is reversed to (F, I, T). The reason is that in neutrosophic algebra, a judgement's "less is better" status is expressed by swapping truth and falsity. Numerical ratio-taking is not defined here. Beyond this complementing, there is no further normalisation step; the neutrosophic components already lie in the 0–1 range.
Weighting and the negative-ideal. Every neutrosophic cell is combined with its criterion weight by the weighted neutrosophic summation rule (SVNWA). The negative-ideal is built, component by component, from the worst neutrosophic value at each criterion (smallest T, largest I, largest F). As in crisp CODAS, a single "worst" reference is used here too.
Score function and distance. Before the Euclidean and taxicab distances are computed, every neutrosophic value is reduced to a single number by a score function, (T − F + 1)/2. The negative-ideal is reduced by the same function. The distances are then computed between these scores in the same way as in crisp CODAS.
The assessment score and the pairwise comparison rule (threshold τ=0.02, Euclidean first, taxicab only if the difference does not exceed it) are identical to crisp CODAS. DecisionMind keeps this score function and threshold fixed for classical N-CODAS.
How to Read the Output
The assessment score is read exactly as in crisp CODAS: a relative position measure, not a percentage, rebuilt whenever the alternative set changes. The difference is here: the score function uses T and F but does not feed the indeterminacy (I) component into the score directly. The score is affected by I only indirectly: whether T+I+F exceeds 1 can change the result. This means an alternative with high indeterminacy (large I) can receive the same score as another alternative with low T and F. The score alone does not answer the question "how much incomplete information underlies this assessment"; the I component must be examined separately for that.
Thus instead of writing:
"The N-CODAS score came out high, so there is strong evidence for this alternative"
the report should read:
"This score is derived from T and F; without separately checking the I component, one cannot know how incompletely this alternative was assessed"
When to Prefer This over the Base Method
When criterion assessment rests on incomplete, contradictory or inconsistent evidence, and this matters for the decision. Measured criteria should not be carried into this extension. If the matrix must be of a single type, a measured value with satisfaction degree t is written using the honest embedding (t, 0, 1−t). The base CODAS's exit condition applies here in exactly the same way: if no compromise is acceptable on one criterion, a compensatory method is not suitable.
Mistakes Specific to This Extension
Defuzzifying with the score function first, then running crisp CODAS. Reducing the T-I-F triple to the (T−F+1)/2 score at the outset and then running crisp CODAS can look the same as N-CODAS. But the difference lies here: whether neutrosophic weighting and cost-complementing are applied before or after the score is exactly what distinguishes N-CODAS from crisp CODAS. In the illustrative example below, taking the score first and then running crisp CODAS preserves the ranking (A3, A1, A2), but shifts the scores to 0.1456 / -0.3334 / 0.1878. Genuine N-CODAS gives 0.3632 / 0.1020 / -0.4652 instead. Both the magnitudes and the relative gaps in the ranking are distorted.
Deriving indeterminacy (I) from truth and falsity. Writing I = 1 − T − F reduces the neutrosophic structure to crisp data. Each component must come from its own body of evidence (see the neutrosophic data-type card).
Forcing the three components to sum to 1. Fixing the sum at 1 reduces the structure to a dependent triple and removes the entire rationale for using a neutrosophic structure.
Changing the score function without stating it in the report. Score functions other than (T−F+1)/2 also exist in the literature. Which one is used affects the magnitude of the score.
The governing principle is this:
N-CODAS exists to preserve, through the T-I-F triple, situations where evidence is incomplete or contradictory. Any shortcut that derives I from T and F, or applies the score function before normalisation and weighting, erases the structure's one contribution: not confusing the unknown with negative evidence.
Cases
The first case is DecisionMind's validation example. It uses a small, three-alternative, three-criterion SVN table generated by the engine itself, faithful to the formulas. The manifest's own record states that this family (SVN-CODAS) has no single validated literature source, and that an anchor reference named "Yüksel 2020" could not be verified. For this reason, no author-year is used in the card title (see the approval notes). The second case is an illustrative construction.
1. Illustrative example: Three alternatives, three criteria (DecisionMind validation example)
This example is not drawn from the literature. It is a small table built to make N-CODAS's formulas traceable by hand. Three alternatives are assessed on three criteria with neutrosophic T-I-F triples. All three criteria are "higher is better." There is no cost criterion. The threshold is τ=0.02.
| Alternative | C1 | C2 | C3 |
|---|---|---|---|
| A1 | T0.70 I0.20 F0.10 | T0.60 I0.30 F0.20 | T0.50 I0.40 F0.30 |
| A2 | T0.50 I0.30 F0.40 | T0.70 I0.20 F0.20 | T0.60 I0.30 F0.30 |
| A3 | T0.80 I0.10 F0.20 | T0.50 I0.40 F0.30 | T0.70 I0.30 F0.20 |
| Direction | higher is better | higher is better | higher is better |
| Weight | 0.40 | 0.30 | 0.30 |
The method combines the cells by the weighted neutrosophic summation rule. It builds the negative-ideal from the worst value, component by component, at each criterion. It then reduces every cell and the negative-ideal to a single number with the (T−F+1)/2 score, and computes the Euclidean and taxicab distances from these scores. Because every pairwise Euclidean difference between the three alternatives exceeds the threshold (0.02), the taxicab distance does not come into play in any comparison in this example.
| Alternative | Assessment score | Rank |
|---|---|---|
| A3 | 0.3632 | 1 |
| A1 | 0.1020 | 2 |
| A2 | -0.4652 | 3 |
The result reads as follows. A3 has the highest truth (T=0.80) and the lowest falsity (F=0.20) on C1, the most heavily weighted criterion. A2 carries both low truth (T=0.50) and high falsity (F=0.40) on C1, and drops to last place. A1 sits in between.
When the criterion weights are changed from C1=0.40/C2=0.30/C3=0.30 to C1=0.30/C2=0.48/C3=0.22, A1 moves ahead (0.1332) and A3 drops to second (0.1289). This means A3's first place is only moderately robust: if the weight on C2, the criterion where A3 is weakest, rises markedly above C1's, this first place is overturned.
In the report: "With the given weights (C1=0.40, C2=0.30, C3=0.30) and threshold τ=0.02, A3 has the highest assessment score (0.3632); when C2's weight is raised to 0.48 and C1's lowered to 0.30, A1 moves ahead (0.1332 / 0.1289), so A3's first place is moderately sensitive to C2's weight."
Source: DecisionMind's validation fixture for the N-CODAS engine; the steps follow the manifest's SVN-CODAS algorithm (SVNWA weighting + neutrosophic negative-ideal + score-based Euclidean/taxicab distance). Every number was independently recomputed by this card's author with the same algorithm, and confirmed against the engine's output.
2. Agriculture: A cooperative's choice of a new drought-resistant seed variety
An agricultural cooperative, in a region of rising drought risk, will choose one of three new seed varieties to recommend to its members. Criteria: drought tolerance, unit yield potential and disease resistance. For each variety, the evidence comes from different sources and conflicts with itself: some trial plots have given positive results, others negative, and climate data is missing for some regions. For this reason, truth (favourable trial results), falsity (unfavourable trial results) and unknown (missing data) are recorded separately for each criterion.
The method weights and combines the three varieties' neutrosophic triples, builds the negative-ideal, reduces with the score function, and computes the two distances. Suppose the variety with the highest yield potential also carries the most contradictory evidence: both high truth and high falsity. The score function averages this contradiction, and the variety still comes second, because the strong, consistent evidence on drought tolerance carries more weight.
The cooperative has a hesitation here. The variety with the highest score has missing climate data in some regions, that is, a high I component. This must not be forgotten, because the score does not directly penalise this gap. The cooperative has decided not to roll out its recommendation widely without a further season of observation in the regions where data is missing.
In the report: "With consistent evidence on drought tolerance, one variety reaches the highest assessment score; this variety's missing data in some regions (a high unknown share) is not directly reflected in the score and must be tracked separately."
3. What Not to Do
The first mistake is to reduce the illustrative example's T-I-F triples to the (T−F+1)/2 score at the outset and run crisp CODAS. The ranking comes out the same (A3, A1, A2), but the scores shift from 0.3632/0.1020/−0.4652 to 0.1456/−0.3334/0.1878. The relative gaps between them are distorted, and the difference between A1 and A3 is artificially narrowed. The second mistake, as in the agriculture example, is to report a variety carrying high I (missing data) at the same confidence as another variety with the same score but low I. The I component must be checked separately. The third mistake is to force the three components to sum to 1 and present this as "more consistent." This reduces the neutrosophic structure to crisp data and prevents I from carrying independent information.
Sources
For the formulas behind each step, the intermediate tables and citation formats, see the DecisionMind method page: decisionmind.app/library/n-codas
Keshavarz Ghorabaee, M., Zavadskas, E. K., Turskis, Z., & Antucheviciene, J. (2016). A new combinative distance-based assessment (CODAS) method for multi-criteria decision-making. Economic Computation and Economic Cybernetics Studies and Research, 50(3), 25–44. (no DOI; not registered on Crossref. See the base CODAS card's Sources section.)
Smarandache, F. (1998). Neutrosophy: Neutrosophic Probability, Set, and Logic. American Research Press, Rehoboth. (no DOI)
Wang, H., Smarandache, F., Zhang, Y., & Sunderraman, R. (2010). Single valued neutrosophic sets. Multispace and Multistructure, 4, 410–413. (no DOI)
Sahmutoglu, I., Taskin, A., & Ayyildiz, E. (2023). Assembly area risk assessment methodology for post-flood evacuation by integrated neutrosophic AHP-CODAS. Natural Hazards, 116, 1071–1103. DOI: 10.1007/s11069-022-05712-1