Skip to main content
. 2020 Jul 14;118:102667. doi: 10.1016/j.trc.2020.102667
Input: Set of acceptable options L, and attributes associated with each option vl,m
Output: Set of sorted options: L
Procedure:
0: L¯=// Initialization
1: Fori = 1 to m // Compare from the most important to the least important attributes
2:   Qi=lvl,i-minlLvl,i>βiJNDminlLvl,i // Generate the noticeable set of (line) options
3:   Q¯i=sort(Qi,i) // Sort Qi in ascending order based on the value of the ith attribute
4:   L¯=Q¯iL¯ // Insert Q¯i into setS¯
5:   L=L-Qi // Update the remaining choice set to be sorted.
6:  If L=:
7:    break // Stop if all the options have been added to the ordered set