<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Mathematical Support and Software of Visual Filtering of Alternatives in Multi-criteria Decision Making Problems</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>A.A. Zakharova</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Bryansk State Technical University</institution>
          ,
          <addr-line>Bryansk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Keldysh Institute of Applied Mathematics Russian Academy of Sciences</institution>
          ,
          <addr-line>Moscow</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The article deals with the problem of multi-criteria decision-making problems, which are characterized by a large number of options and alternatives. It is proposed to use visual filtering of graphic images describing the corresponding alternatives as one of the stages in decision-making in such tasks. The approaches and requirements for the construction of graphic images of alternatives are considered. Describes the steps and algorithms for constructing visual images of alternatives, based on the radial and pie charts, and include the normalization procedure. It describes software that implements the proposed algorithms, as well as providing interactive interaction with an expert for visual filtering of multi-criteria alternatives. Additionally, the capabilities of the developed software are described, which include filtering alternatives based on threshold values, as well as the possibility of conducting a series of experiments in order to obtain the union or intersection of filtered sets of alternatives. A synthetic test for filtering 201 alternatives is described, each of which is described by 15 criteria. As a result of a series of experiments, this choice set was reduced by about 28 times. A description is also given of an experiment on visual filtering of real alternatives that describe estimates of the accuracy of calculating inviscid flow around a cone using several OpenFoam solvers. Each solver is characterized by 288 criteria, and according to the results of visual filtering, the advantage in the accuracy of the calculations of two solvers over the others is clearly established.</p>
      </abstract>
      <kwd-group>
        <kwd>alternative visual image</kwd>
        <kwd>visual filtering</kwd>
        <kwd>multi-criteria alternatives</kwd>
        <kwd>decision making</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>At present, managers and other professionals in various
fields of activity are faced with the need to make decisions,
taking into account many factors. Often these decisions are made
intuitively and are based mainly on the experience and
knowledge of the decision maker (DM). However, this is not the
only way to make decisions. In modern science, a wide variety
of decision making methods based on special approaches and
algorithms are widely used [1]. At the same time, the solution of
multi-criteria decision making problems by means of these
methods can be not very effective when there are dozens and
hundreds of alternatives, and they all have more than a dozen
criteria. These situations are quite common when, for example,
the source of alternatives is multisensory systems, or when
initially many alternatives are formed by means of specialized
systems in the course of multiple simulation [2, 3].</p>
      <p>Therefore, in such cases, first the initial choice set is filtered,
and then decision making methods are used already on a filtered
selection of alternatives. Traditionally, statistical methods are
used for filtering. Taking into account the fact that during
decision making DM activates his mental activity, the same
factor can be used to solve the problem of filtering alternatives.
To do this, DM’s mental activity can be addressed to a
comparative analysis of alternative visual images. But it is
necessary to develop effective algorithms for visual filtering of
alternatives, so that the main DM’s efforts should be focused
exactly on intelligent visual selection, and not on accompanying
actions or calculations.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Algorithm of alternatives visualization in multi-criteria decision making problems</title>
      <p>In multi-criteria decision making problems, the criteria
determining alternatives can be set both as quantitative and
qualitative characteristics. In order to work with various criteria,
first it is necessary to reduce them to numeric variables.
A wide range of different algorithms and methods are used for
these purposes [1]. These methods and algorithms allow to
convert the initial values of the criteria into numerical values in
the form of the corresponding functions fi(k), where 1 ≤  ≤  ,
K is the number of criteria. Function fi(k) is usually nonlinear
and may contain additional conditions for different intervals of k
initial values of i-criterion. The dimension (i.e. range of possible
values) of fi(k) function for i different criteria may vary
significantly. For this reason, for further work with alternative
visual images having these criteria, it is necessary to normalize
fi(k) functions. One of the traditional approaches in this case is
normalization by interval [0; 1] based on the maximum and
minimum possible values of the function.
1.   ′( ) =   ( )−  , , if the maximum criterion value
  , −  ,
corresponds to the best option;
2.   ′( ) =   , −  ( ), if the minimum criterion value
  , −  ,
corresponds to the best option.</p>
      <p>Values fi,min and fi,max are defined in the given choice set  =
{  }, 1 ≤  ≤  ,   = {  (  , )},
where N is a number of alternatives either from valid
(anticipated) values, or according to the formulas:
  ,
  ,
= min (  (  , )),
= max (  (  , )).</p>
      <p>Various methods are currently used to visualize many
alternatives [4]: polyline criteria values (Fig. 1), bar diagrams
(Fig. 2), radar diagrams ([5], Fig. 3), pie charts (Fig. 4) and
others.</p>
      <p>Fig. 1. Alternatives visualization in the form of polyline criteria
values.</p>
      <p>Fig. 2. Alternatives visualization in the form of bar diagrams.
criteria (about 3-7) is not big. However, such visualization
methods are not suitable when you have to analyze dozens and
hundreds of alternatives, each of which can have more than 10
criteria, because the chart becomes too overloaded and complex
to analyze. A large number of alternatives can be visualized, for
example, by using a set of pie charts, each representing a
different alternative (Fig. 4). However, effective filtering of
alternatives requires a more holistic perception of their visual
image. Pie charts do not sufficiently provide such a perception
with a large number of criteria due to color diversity. Taking into
account the peculiarities considered we formulate the
main
criteria of constructing an algorithm for visualizing alternatives
in multi-criteria decision making problems in order to filter them.
1.</p>
      <p>Each alternative should be represented as a single image.
2. Since there may be too many alternatives, it is necessary to
provide a mechanism for focusing on a small sample of them
and the possibility of changing this focus.
3. To highlight equivalent criteria with a different color is
inappropriate, because the color can adversely affect DM’s
4. Color effect is useful when visualizing alternatives for
criteria values close to optimal in order to further focus DM’s
alternative.
attention on them.
subset.</p>
      <p>Based on these criteria, we develop an appropriate algorithm.
Within this algorithm, two main aspects can be distinguished.</p>
      <p>Visualization of one alternative.</p>
      <p>Allocation of alternatives and focusing method on their
The construction of a visual image will be based on pie charts
and radar diagrams (Fig. 3, 4). Their common feature is that the
value of the alternative by a separate criterion is located on a
separate beam (radar diagram) or a sector of the circle (pie chart).
However, moving away from a traditional representation of radar
diagrams, we will place each alternative on a separate circle (as
in pie charts).</p>
      <p>For an alternative to be represented as a single image, it is
advisable to use a single filling style for all criteria: for the pie
chart, the corresponding sectors are filled, and for the radar
diagram, the corresponding polygon is filled. Taking into
account that the sector radius in the pie chart and the position of
polygon points is determined by the proximity of the normalized
criterion value of the corresponding alternative to 1 (the closer to
one, the better), it is advisable to use a gradient radial fill: in the
center of the circle the color is neutral, and closer to the border it
is contrast (for example, red).
source of focusing and choice preferences among alternatives is
the area of the corresponding figure.</p>
      <p>1. For a pie chart, the shape area is defined as a sum of
sector areas:
where   , =
 ∙( 
′(  , ))</p>
      <p>2</p>
      <p>= ∑ =1   , ,
in the case, if all the sectors have the
same angle (this is usually the case where all criteria are equal).
If, however, there is some preference concerning criteria, then a
sector with a larger angle can be specified for the more preferred
criteria. Let us denote this angle as   (radian), then
  , =
(  ′(  , )) ∙</p>
      <p>2
2
.</p>
      <p>The value of   angle can be defined on the basis of ranking
algorithms or weighing criteria used in decision making methods
[1]. This approach has a peculiarity that the sector area is
proportional to the square of the alternative value by the criterion,
which may unnecessarily draw attention to the alternatives that
have the maximum value of one of the criteria. To reduce this
degree of influence, it is possible to establish not a quadratic, but
a linear dependence between the sector area and the alternative
value according to the corresponding criterion:   , =   ′(  , )∙ 
.</p>
      <p>Then the radius of the corresponding sector will be defined by
2
2. For a radar diagram, the area of a shape is defined as the
the formula:   , = √  ′(  , ).
sum of the areas of triangles:
where   , =   ′(  , )∙  ′+1(  +1, )∙
2</p>
      <p>= ∑ =1   , ,
(  ),  ′
 +1(  +1, ) =  1′( 1, ).
displayed alternatives;
displayed alternatives.</p>
      <p>The main peculiarity of calculating the area of the polygon
according to this formula is that its final value is in addition
affected by the order of criteria placement. In the case when the
criteria with large values   ′(  , ) are close to each other, then the
total area is larger, which means that such alternatives are more
visible than others. On the other hand, the focusing factor in this
case may also be a large number of sharp angles in the polygon.
Therefore, for this type of diagrams let us consider two
modifications of exchanging criteria:
• grouping a number of criteria with higher values for the
• alternation of criteria with higher and lower values for the
In both versions, we first calculate the mean value of mi for
each criterion in the set of displayed alternatives  ′ = {  },
where 1 ≤  ≤  , T is the number of displayed alternatives:</p>
      <p>Next, we sort descending mi with remembering the initial i
position. Let us present the result as a sequence</p>
      <p>= ∑ =1 
 ′(  , ).</p>
      <p>(  ),  

=</p>
      <p>(  ).</p>
      <p>0 = { 1, … ,   },</p>
      <p>For the first modification (grouping), p1 exchange is defined
where   1 = 
as follows:
 1, = {</p>
      <p>0, ∙2−1,   ≤ ⌈ ⌉ ;
 0,( +1− )∙2,   &gt; ⌈ ⌉ .</p>
      <p>2

2</p>
      <p>For the second modification (grouping), p2 exchange is
defined as follows:
 2, = {</p>
      <p>, if  is even.
 0,( +1)/2, if  is odd;</p>
      <p>2
0, +⌈ ⌉</p>
      <p>2</p>
      <p>Building a visual image of alternatives in the case of using
radar diagrams will start with the use of one of the two considered
exchanges of criteria: p1 or p2.</p>
      <p>When placing visual images of alternatives on the screen, we
will follow these principles:
1. It is necessary to visualize all alternatives in a simplified
form on a smaller part of the screen within a rectangle
(simplified display). In this part of the screen you need to
place the selection area of alternatives (it is also advisable to
do this in the form of a rectangle). This area must be
movable.
2. When you change the position of the selection area on the
simplified display, you need to define a list of alternatives
completely being inside it. These alternatives are displayed
in the focus area, which is also a rectangular portion of the
screen that takes up significantly more space than the
simplified display area.</p>
      <p>The position of alternatives in these areas will be determined
by the grid consisting of rows and columns (Fig. 5). The
alternatives themselves will be placed at the nodes of this grid.
In this case, for a more uniform distribution of alternatives, the
grid is not orthogonal, but with an offset in even rows by the
circle radius in which the alternative is visualized.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Description of software for visual filtering of alternatives</title>
      <p>The algorithms described above were implemented in a
special program. The developed software allows to load from the
table view a list of alternatives with a numerical representation
of values according to the relevant criteria, as well as to filter
them in the rendering mode (Fig. 6).</p>
      <p>Fig. 6. Interface of software for visual filtering of</p>
      <p>alternatives.</p>
      <p>For filtering the program provides two approaches – manual
filtering by hiding or displaying alternatives (the central part of
the form in Fig. 6), as well as filtering based on the threshold
values of the criteria (the right part of the form in Fig. 6) – all
alternatives that do not meet the thresholds are hidden.</p>
      <p>At the bottom of the form there is a simplified area of
alternatives visualization where the user can select a range of
alternatives to be displayed in the main area by moving the
corresponding rectangular block. Using the toolbar buttons, the
user can enter the hide or show alternatives mode. Hiding or
displaying is done by clicking the mouse button on the
corresponding alternative on the main visualization area.</p>
      <p>The program supports all 4 visualization options considered
in the paper:</p>
      <p>• sectors with radii proportional to the criteria for the
alternative;
• sectors with radii proportional to the roots of the criteria
values for the alternative;
• radar diagram with p1 criteria exchange;
• radar diagram with p2 criteria exchange.</p>
      <p>Working with the program, the user can perform several
experiments on filtering alternatives by means of different ways
of their visualization. The results are summarized in a table.</p>
      <p>In addition, on the basis of the table obtained, the program
analyzes the results and displays the numbers of alternatives that
the user has chosen in all experiments in a separate list. This
approach allows you to reduce the resulting set of filtered
alternatives further, leaving only those that the DM has preferred
for all visualization methods.</p>
      <p>With the help of the developed program, an experiment was
conducted. A choice set (200 alternatives) with 15 criteria was
randomly generated. An alternative with maximum values for all
criteria out of all 200 generated was added to this set (in order to
verify that this alternative will not be filtered). Thus, there were
201 alternatives in total. The problem of filtering alternatives was
solved 5 times using different methods: 4 methods of different
visualization options and one method – setting low threshold
values for all criteria in order to reduce the number of displayed
alternatives by an order of magnitude. The results of the
experiments are presented in table 1.
this subset using other methods of decision making, designed for
a small number of alternatives.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Experiment</title>
      <p>With the help of the developed software, there was also an
experiment conducted for real alternatives. We got estimations
according to 144 criteria for norms L1 and L2 for the
computational problem of evaluating the accuracy of the
calculations of inviscid flow around a cone by means of several
OpenFoam solvers (rhoCentralFoam, pisoCentralFoam,
sonicFoam, rhoPimpleFoam, QGDFoam) [6, 7].</p>
      <p>After preliminary processing of the initial data according to
norm L1, only 88 criteria were left (as for the rest of the criteria,
the data were incomplete). Having constructed and analyzed
visual images for different algorithms, we determined that the
alternative corresponding to pisoCentralFoam solver is almost
always occupies a large area and is more contrast by using the
red fill on the border of the corresponding visual image, so we
can conclude that this algorithm is the most preferable.</p>
      <p>176 criteria were selected when comparing the alternatives
according to two norms, and one of the alternatives was excluded
from consideration, as there were no its data on L2 norm. As a
result of visual filtering, it was determined that the two
alternatives have a large area, as well as more contrast (due to the
use of red color at the borders of the visual image): they are
rhoCentralFoam and pisoCentralFoam solver. However,
preference can again be given to pisoCentralFoam solver,
because in almost all images it visually occupies a slightly larger
area than the visual images of rhoCentralFoam solver.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>The approaches and algorithms of constructing visual images
for multi-criteria alternatives considered in the paper have shown
that visual filtering can be quite an effective method in
decreasing the initial choice set. As a result of several
experiments on filtration by means of the developed software an
initial set of 201 alternatives has been reduced to 27-50
alternatives. Identifying a subset from the results of different
experiments, which is common for the results of all experiments,
allowed us to decrease this set to only 7 alternatives, i.e., to
reduce the number by about 28 times.</p>
      <p>4 ways of constructing visual images are considered in the
paper. However, it is possible to expand these options further
through the use of additional visualization techniques: 3D
visualization, other types of diagrams, other types of defining
criteria exchange, etc.</p>
      <p>Also, an experiment was conducted on the visual selection of
the best alternative (solver) according to the known criteria
characterizing the accuracy of calculations. Comparison was
made for 5 alternatives and the number of criteria was 176.
According to the comparative visual analysis it was clearly seen
that pisoCentralFoam solver gives more accurate calculation
results.</p>
      <p>An additional feature of the developed mathematical support
and software is that it is suitable for using by a group of experts,
each of whom can conduct a series of experiments with different
types of constructing visual images, and then the results can be
summarized together.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Acknowledgments</title>
    </sec>
    <sec id="sec-7">
      <title>7. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          grant №
          <fpage>18</fpage>
          -
          <lpage>11</lpage>
          -00215. [1]
          <string-name>
            <surname>Figuera</surname>
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Greco</surname>
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Ehrgott</surname>
            <given-names>M.</given-names>
          </string-name>
          (Eds). Multiple Criteria
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>Springer</surname>
          </string-name>
          ,
          <year>2005</year>
          . - DOI: 10.1007/b100605. [2]
          <string-name>
            <surname>Isaev</surname>
            <given-names>R.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Podvesovskii</surname>
            <given-names>A.G.</given-names>
          </string-name>
          <string-name>
            <surname>Generalized Model</surname>
          </string-name>
          of Pulse
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <source>2017)</source>
          , Vol.
          <year>1904</year>
          . - P.
          <fpage>57</fpage>
          -
          <lpage>63</lpage>
          . - DOI: 10.18287/
          <fpage>1613</fpage>
          -0073-
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          2017-1904-57-
          <issue>63</issue>
          [3]
          <string-name>
            <surname>Podvesovskii</surname>
            <given-names>A.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Isaev</surname>
            <given-names>R.A</given-names>
          </string-name>
          . Visualization Metaphors for
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Fuzzy</surname>
          </string-name>
          Cognitive Maps // Scientific Visualization,
          <year>2018</year>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          Vol.
          <volume>10</volume>
          ,
          <string-name>
            <surname>Num</surname>
            . 4,
            <given-names>P.</given-names>
          </string-name>
          13-
          <fpage>29</fpage>
          . - DOI: 10.26583/sv.10.4.
          <issue>02</issue>
          [4]
          <string-name>
            <surname>Pomerol</surname>
            <given-names>J-C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Romero</surname>
            <given-names>S</given-names>
          </string-name>
          . Multicriterion Decision in
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          Publishers: Boston,
          <year>2000</year>
          . - DOI: 10.1007/978-1-
          <fpage>4615</fpage>
          -
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          4459-
          <fpage>3</fpage>
          . [5]
          <string-name>
            <surname>Morris</surname>
            <given-names>M.F.</given-names>
          </string-name>
          <article-title>Kiviat graphs: Conventions and “figures of</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Review</surname>
            . - V. 3,
            <given-names>N.</given-names>
          </string-name>
          <year>3</year>
          . - P.
          <fpage>2</fpage>
          -
          <lpage>8</lpage>
          . - New York: ACM,
          <year>1974</year>
          . -
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <source>DOI: 10.1145/1041691</source>
          .1041692. [6]
          <string-name>
            <surname>Bondarev</surname>
            <given-names>A.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuvshinnikov</surname>
            <given-names>A.E.</given-names>
          </string-name>
          <article-title>Analysis of the</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>Supersonic</given-names>
            <surname>Flow Around</surname>
          </string-name>
          a Cone // ICCS 2018, Lecture
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          Notes in Computer Science (LNCS)
          <fpage>10862</fpage>
          . - P.
          <fpage>221</fpage>
          -
          <lpage>230</lpage>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <year>2018</year>
          . - DOI:10.1007/978-3-
          <fpage>319</fpage>
          -93713-7_
          <fpage>18</fpage>
          . [7]
          <string-name>
            <surname>Bondarev</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuvshinnikov</surname>
            <given-names>A</given-names>
          </string-name>
          . Comparative Estimation of
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <source>Cone // IEEE The Proceedings of the 2018 Ivannikov</source>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>ISPRAS Open Conference (ISPRAS-2018)</surname>
          </string-name>
          . - P.
          <fpage>82</fpage>
          -
          <lpage>87</lpage>
          ,
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <year>2018</year>
          . - DOI: 10.1109/ISPRAS.
          <year>2018</year>
          .
          <volume>00019</volume>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>