| 摘要 |
The Invention concerns a Method for solving multidimensional optimization problems on a set of feasible solutions {S1,..., Sn} of a discrete combinatorial problem comprising steps of: - calculating optimization values for the set of feasible solutions {S1,..., Sn} by using a set of optimization functions {f1,..., fk} - calculating mean values µ(ƒ i ) to the set of optimization functions {f1,..., fk} according to Formula (I) - calculating standard deviation values s(ƒ i ) to the set of optimization functions {f1,..., fk} according to Formula (II) -normalize the optimization values for the set of feasible solutions {S1,..., Sn} according to Fomula (III) -accumulate the normalized optimization values normi(ƒ i(Sol)) according to ƒ(Sol) = Fomula (VI) -find a minimum/maximum for the accumulated normalized optimization values Fomula (V) or max Formula (VI). |
