Algorithm rules of interval grey numbers based on different “kernel” and the degree of greyness of grey numbers

Abstract

Purpose The purpose of this paper is to establish the algorithm rules of the interval grey numbers and propose a new ranking method of the interval grey numbers. Design/methodology/approach The definitions of “kernels” based on lower measure, upper measure or moderate measure are given according to the properties of the interval grey number problems. By means of the measurement error, the concept of the absolute degree of greyness and the relative degree of greyness corresponding to different “kernel” are given, and different simplified forms of the interval grey numbers are put forward. Findings The definitions of “kernel” and the degree of greyness in this paper not only take the upper limit, lower limit and the coverage of the interval grey numbers into account, but also avoid the inconsistency of the degree of greyness caused by the different universe of discourse. Research limitations/implications Though the method proposed in this paper has some deficiencies, such as the definition of relative degree of greyness is meaningless when the kernel of the interval grey number is 0, it provides a new idea for calculating and sorting the interval grey numbers and is conducive to the further development of the grey system theory. Originality/value The method proposed in this paper can not only distinguish interval grey numbers in different situations, but also avoid the inconsistency of the degree of greyness caused by the different universe of discourse. In this basis, the interval grey number algorithm is established and a new ranking method of interval grey numbers is given.