Summary
This chapter considers a number of alternative methods for fitness assignment in evolutionary algorithms for multiobjective optimization. Most of the fitness assignment methods in the literature were designed to work for any number of objectives, in principle; but, in practice, some of the more popular methods (e.g. those in NSGA-II, IBEA and SPEA) do not perform well on problems with four or more objectives. We investigate why this is the case, considering two aspects of performance: convergence towards the Pareto front and drive towards a set of well spread solutions. The visualization of induced fitness surfaces is used to understand the effects of the different fitness assignment methods, and both Pareto- and non-Pareto-based methods are analysed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. J. Bentley and J. P. Wakefield. An analysis of multiobjective optimization within genetic algorithms. Technical Report ENGPJB96, University of Huddersfield, UK, 1996. Online: http://citeseer.ist.psu.edu/62443.html.
L. Bradstreet, L. Barone, and L. While. Maximising hypervolume for selection in multi-objective evolutionary algorithms. In IEEE Congress on Evolutionary Computation, CEC 2006, pages 1744–1751, Vancouver, Canada, July 2006. IEEE.
K. Deb. Multi-objective optimization using evolutionary algorithms. John Wiley & Sons, 2001. ISBN 0-471-87339-X.
E. J. Hughes. Multiple single objective pareto sampling. In Congress on Evolutionary Computation 2003, pages 2678–2684, Canberra, Australia, 8–12 December 2003. IEEE.
E. J. Hughes. Evolutionary many-objective optimisation: Many once or one many? In IEEE Congress on Evolutionary Computation, 2005, volume 1, pages 222–227, Sept. 2005.
B. Naujoks, N. Beume, and M. Emmerich. Multi-objective optimisation using S-metric selection: application to three-dimensional solution spaces. In IEEE Congress on Evolutionary Computation, CEC 2005, volume 2, pages 1282 – 1289, Edinburgh, UK, Sept. 2005. IEEE.
R. C. Purshouse. Evolutionary many-objective optimisation: An exploratory analysis. In The 2003 Congress on Evolutionary Computation (CEC 2003), volume 3, pages 2066–2073, Canberra, Australia, 8–12 December 2003. IEEE.
T. P. Runarsson and X. Yao. Stochastic ranking for constrained evolutionary optimisation. IEEE Transactions on Evolutionary Computation, 4(3):284–294, Sept. 2000.
M. Tanaka, H. Watanabe, Y. Furukawa, and T. Tanino. Ga-based decision support system for multicriteria optimization. In Conference on Systems, Man and Cybernetics: Intelligent Systems for the 21st Century, volume 2, pages 1556–1561. IEEE, 22–25 October 1995.
E. Zitzler. Evolutionary algorithms for Multiobjective Optimisation: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, Nov. 1999.
E. Zitzler and S. Knzli. Indicator-based selection in multiobjective search. In Parallel Problem Solving from Nature - PPSN VIII, volume LNCS 3242/2004, pages 832–842, Birmingham, UK, 2004. Springer.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hughes, E.J. (2008). Fitness Assignment Methods for Many-Objective Problems. In: Knowles, J., Corne, D., Deb, K. (eds) Multiobjective Problem Solving from Nature. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72964-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-72964-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72963-1
Online ISBN: 978-3-540-72964-8
eBook Packages: Computer ScienceComputer Science (R0)