The presence of multiple objectives in a problem gives solutions rise to a set of optimal
solutions (largely known as single optimal Pareto-optimal solutions), instead of a single optimal solution. In the absence of any further information, one of these Pareto-optimal solutions cannot be said to be better than the other. This demands a user to find as many Pareto-optimal solutions as possible. Classical optimization methods (including the multi criterion decision-making methods) suggest converting the multi-objective optimization problem to a single-objective optimization problem by emphasizing one particular Pareto-optimal solution at a time[1] When such a method is to be used for finding multiple solutions, it has to be applied many times, hopefully finding a different solution in each simulation run. Over the past decade, a number of evolutionary algorithms have been suggested[2,3].
The presence of multiple objectives in a problem gives solutions rise to a set of optimalsolutions (largely known as single optimal Pareto-optimal solutions), instead of a single optimal solution. In the absence of any further information, one of these Pareto-optimal solutions cannot be said to be better than the other. This demands a user to find as many Pareto-optimal solutions as possible. Classical optimization methods (including the multi criterion decision-making methods) suggest converting the multi-objective optimization problem to a single-objective optimization problem by emphasizing one particular Pareto-optimal solution at a time[1] When such a method is to be used for finding multiple solutions, it has to be applied many times, hopefully finding a different solution in each simulation run. Over the past decade, a number of evolutionary algorithms have been suggested[2,3].
การแปล กรุณารอสักครู่..
