Finding stable subassemblies with backtracking divide and conquer on strongly connected components

Author(s):  
A. Hoehmann
2021 ◽  
Vol 1 ◽  
pp. 122-133
Author(s):  
Alexey V. Oletsky ◽  
◽  
Mikhail F. Makhno ◽  
◽  

A problem of automated assessing of students’ study projects is regarded. A heuristic algorithm based on fuzzy estimating of projects and on pairwise comparisons among them is proposed. For improving adequacy and naturalness of grades, an approach based on introducing a parameter named relaxation parameter was suggested in the paper. This enables to reduce the spread between maximum and minimum values of projects in comparison with the one in the standard scale suggested by T. Saati. Reasonable values of this parameter were selected experimentally. For estimating the best alternative, a center of mass of a fuzzy max-min composition should be calculated. An estimation algorithm for a case of non-transitive preferences based on getting strongly connected components and on pairwise comparisons between them is also suggested. In this case, relaxation parameters should be chosen separately for each subtask. So the combined technique of evaluating alternatives proposed in the paper depends of the following parameters: relaxation parameters for pairwise comparisons matrices within each strongly connected components; relaxation parameter for pairwise comparisons matrices among strongly connected components; membership function for describing the best alternative.


Sign in / Sign up

Export Citation Format

Share Document