An ensemble framework for assessing solutions of interval programming problems

In this paper, we develop an ensemble framework for assessing solutions of interval programming problems. At the start, interval dominance rules are defined, and their correlations are described via exclusion, inclusion and equivalence; then, a rule reduction strategy is developed through inspecting the impact of different rules on the sorting of solutions, and a novel ensemble dominance relation for interval programming is proposed to evaluate solutions; furthermore, their complexities are analyzed; finally, the experimental results empirically validate the correctness and effectiveness of the proposed framework.