Minimum spanning trees made easier via multi-objective optimization |
| |
Authors: | Frank Neumann Ingo Wegener |
| |
Affiliation: | (1) Inst. für Informatik und Prakt. Mathematik, Christian-Albrechts-Univ. zu Kiel, 24098 Kiel, Germany;(2) FB Informatik, LS 2, Univ. Dortmund, 44221 Dortmund, Germany |
| |
Abstract: | Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate the Pareto front, multi-objective 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 multi-objective model of the problem. That this is indeed the case is proved by investigating the computation of minimum spanning trees.This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center Computational Intelligence (SFB 531) and by the German-Israeli Foundation (GIF) in the project Robustness Aspects of Algorithms. |
| |
Keywords: | multi-objective optimization working principles of evolutionary computing running time analysis |
本文献已被 SpringerLink 等数据库收录! |
|