TY - JOUR
AU - Fang, Shu-Cherng
AB - Abstract This paper considers solving a multi-objective optimization problem with sup-T equation constraints. A set covering-based technique for order of preference by similarity to the ideal solution is proposed for solving such a problem. It is shown that a compromise solution of the sup-T equation constrained multi-objective optimization problem can be obtained by solving an associated set covering problem. A surrogate heuristic is then applied to solve the resulting optimization problem. Numerical experiments on solving randomly generated multi-objective optimization problems with sup-T equation constraints are included. Our computational results confirm the efficiency of the proposed method and show its potential for solving large scale sup-T equation constrained multi-objective optimization problems.
TI - Set covering-based topsis method for sloving sup- T equation constrained multi-objective optimization problems
JF - "Journal of Systems Science and Systems Engineering"
DO - 10.1007/s11518-014-5261-x
DA - 2015-09-01
UR - https://www.deepdyve.com/lp/springer-journals/set-covering-based-topsis-method-for-sloving-sup-t-equation-K3U9eJwyDm
SP - 258
EP - 275
VL - 24
IS - 3
DP - DeepDyve
ER -