• Many real-world problems are multiobjective optimization problems, and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate the Pareto front, multiobjective optimization problems are considered as more difficult than single-objective problems. One should not forget that the fitness vector with respect to more than one objective contains more information that in principle can direct the search of evolutionary algorithms. Therefore, it is possible that a single-objective problem can be solved more efficiently via a generalized multiobjective model of the problem. That this is indeed the case is proved by investigating the single-source shortest paths problem and the computation of minimum spanning trees. ()
  • 25 ()
is ?:cites of
  • 2016-06-24 ()
  • 10.1007/978-3-540-72964-8_6 ()
  • 130 ()
  • 25 ()
is ?:hasCitedEntity of
  • en ()
  • 2008-01-01 ()
  • Springer, Berlin, Heidelberg ()
  • 20206 ()
  • 19 ()
  • 115 ()
  • Can Single-Objective Optimization Profit from Multiobjective Optimization? ()


expand all