Abstract
Currently there exist various cost-assignment schemes that perform the necessary scalarization of the objective values when applied to a multi-objective optimization problem. Of course, the final decision depends highly on the nature of the problem but given the multiplicity of the schemes combined with the fact that what the user ultimately needs is a single compromise solution it is evident that elaborating the selection of the method is not a trivial task. This paper intends to address this problem by extending the benchmarks of optimality and reach time given in [1] to mutliobjective optimization problems. A number of existing cost-assignment schemes are evaluated using such benchmarks.
This is a preview of subscription content, log in via an institution to check access.
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
Benchmarks for testing evolutionary algorithms, The Third Asia-Pacific Conference on Measurement and Control, Dunhuang, China, 31 Aug.–4 Sept 1998, 134–138. (W. Feng, T. Brune, L. Chan, M. Chowdhury, C.K. Kuek and Y. Li).
Back T., Fogel D. B. and Michalewicz Z., Handbook of Evolutionary Computation (New York, Oxford: Oxford University Press, Bristol, Philadelphia: Institute Of Physics Publishing, 1997)
Michalewicz Z., Genetic Algorithms + Data structures = Evolution programs. (Berlin: Springer-Verlag, 1992)
Michalewicz Z., Nazhiyath G. and Michalewicz M, A note on the usefulness of geometrical crossover for numerical optimization problems, Proc 5th Ann. Conf. on Evolutionary Programming ed L. J. Fogel, P. J. Angeline and T. Back (Cambridge, MA: MIT Press, 1996)
Tan K.C., Evolutionary methods for Modelling and Control of Linear and Nonlinear Systems, Ph.D. thesis (Department of Electronics and Electrical Engineering, University of Glasgow, 1997)
Goldberg D. E., Genetic algorithms in Search, Optimization and Machine Learning (Reading, MA: Addison-Wesley, 1989)
Davis L., Adapting operator probabilities in genetic algorithms, Proc 3rd Int. Conf. on GAs (Fairfax, VA, June 1989) ed J. D. Schaffer (San Mateo, CA: Morgan Kaufmann) pp 61–69
Fonseca C. M. and Fleming P. J., Multiobjective genetic algorithms made easy: selection sharing and mating restriction (First Int. Conf. on GAs in Eng. Systems: Innovations and Applications, Sheffield, UK, 1995) pp 45–52
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koukoulakis, K., Li, Y. (2000). Benchmarking Cost-Assignment Schemes for Multi-objective Evolutionary Algorithms. In: Cagnoni, S. (eds) Real-World Applications of Evolutionary Computing. EvoWorkshops 2000. Lecture Notes in Computer Science, vol 1803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45561-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-45561-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67353-8
Online ISBN: 978-3-540-45561-5
eBook Packages: Springer Book Archive