Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/67353
Citations | ||
Scopus | Web of ScienceĀ® | Altmetric |
---|---|---|
?
|
?
|
Type: | Book chapter |
Title: | Can single-objective optimization profit from multipleobjective optimization? |
Author: | Neumann, F. Wegener, I. |
Citation: | Multi-objective problem solving from nature: from concepts to applications, 2008 / Knowles, J., Corne, D., Deb, K. (ed./s), pp.115-130 |
Publisher: | Springer |
Publisher Place: | Berlin |
Issue Date: | 2008 |
Series/Report no.: | Natural Computing Series |
ISBN: | 9783540729631 |
Editor: | Knowles, J. Corne, D. Deb, K. |
Statement of Responsibility: | Frank Neumann and Ingo Wegener |
Abstract: | 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. |
Rights: | Copyright 2008 Springer-Verlag Berlin Heidelberg 2008 |
DOI: | 10.1007/978-3-540-72964-8_6 |
Published version: | http://dx.doi.org/10.1007/978-3-540-72964-8_6 |
Appears in Collections: | Aurora harvest 5 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.