Abstract
Dynamic multi-objective optimisation problems have more than one objective, at least two objectives that are in conflict with one another and at least one objective that changes over time. These kinds of problems do not have a single optimum due to the conflict between the objectives. Therefore, a new approach is required to determine the quality of a solution. Traditionally in multi-objective optimisation (MOO) Pareto-dominance have been used to compare the quality of two solutions. However, in order to increase the speed of convergence and the diversity of the found solutions, \(\epsilon \)-dominance has been proposed. This study investigates the effect of using \(\epsilon \)-dominance for two aspects of the dynamic vector evaluated particle swarm optimisation (DVEPSO) algorithm, namely: updating the global best and managing the archive solutions. The results indicate that applying \(\epsilon \)-dominance instead of Pareto-dominance to either both of these aspects of the algorithm, or only to the global best update, does improve the performance of DVEPSO.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesly, Reading (1989)
Laumanns, M., Thiele, L., Deb, K., Zitzler, E.: Combining convergence and diversity in evoluationary multiobjective optimization. Evol. Comput. 10(3), 263–282 (2002)
Fonseca, C., Fleming, P.: An overview of evolutionary algorithms in multiobjective optimization. Evol. Comput. 3(1), 1–16 (1995)
Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)
Parsopoulos, K., Vrahatis, M.: Recent approaches to global optimization problems through particle swarm optimization. Nat. Comput. 1(2–3), 235–306 (2002)
Greeff, M., Engelbrecht, A.: Dynamic multi-objective optimisation using PSO. In: Nedjah, N., dos Santos Coelho, L., de Macedo Mourelle, L. (eds.) Multi-Objective Swarm Intelligent Systems. Studies in Computational Intelligence, vol. 261, pp. 105–123. Springer, Berlin (2010)
Greeff, M., Engelbrecht, A.: Solving dynamic multi-objective problems with vector evaluated particle swarm optimisation. In: Proceedings of World Congress on Computational Intelligence (WCCI): Congress on Evoluationary Computation, pp. 2917–2924. Hong Kong (June 2008)
van den Bergh, F.: An analysis of particle swarm optimizers. Ph.D. thesis, Department of Computer Science University of Pretoria (2002)
Pampará, G., Engelbrecht, A., Cloete, T.: CIlib: a collaborative framework for computational intelligence algorithms—Part I. In: Proceedings of World Congress on Computational Intelligence, pp. 1750–1757. Hong Kong 1-8 June 2008. http://www.cilib.net, Last accessed on: 10 December 2013
Helbig, M., Engelbrecht, A.: Benchmarks of dynamic multi-objective optimisation algorithms. ACM Comput. Surv. 46(3), 37 (2014)
Farina, M., Deb, K., Amato, P.: Dynamic multiobjective optimization problems: test cases, approximations, and applications. IEEE Trans. Evol. Comput. 8(5), 425–442 (2004)
Koo, W., Goh, C., Tan, K.: A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment. Memet. Comput. 2(2), 87–110 (2010)
Goh, C.K., Tan, K.: A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization. IEEE Trans. Evol. Comput. 13(1), 103–127 (2009)
Helbig, M., Engelbrecht, A.: Issues with performance measures for dynamic multi-objective optimisation. In: Proceedings of IEEE Symposium Series on Computational Intelligence, pp. 17–24. Singapore (April 2013)
Helbig, M., Engelbrecht, A.: Performance measures for dynamic multi-objective optimisation algorithms. Inf. Sci. 250, 61–81 (2013)
Cámara, M., Ortega, J., de Toro, F.: A single front genetic algorithm for parallel multi-objective optimization in dynamic environments. Neurocomputing 72(16–18), 3570–3579 (2007)
Fonseca, C., Paquete, L., Lopez-Ibanez, M.: An improved dimension-sweep algorithm for the hypervolume indicator. In: Proceedings of Congress on Evolutionary Computation, pp. 1157–1163 (July 2006)
Helbig, M., Engelbrecht, A.: Analysing the performance of dynamic multi-objective optimisation algorithms. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1531–1539. Cancún, Mexico (June 2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Helbig, M. (2016). Updating the Global Best and Archive Solutions of the Dynamic Vector-Evaluated PSO Algorithm Using \(\epsilon \)-dominance. In: Pillay, N., Engelbrecht, A., Abraham, A., du Plessis, M., Snášel, V., Muda, A. (eds) Advances in Nature and Biologically Inspired Computing. Advances in Intelligent Systems and Computing, vol 419. Springer, Cham. https://doi.org/10.1007/978-3-319-27400-3_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-27400-3_35
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27399-0
Online ISBN: 978-3-319-27400-3
eBook Packages: Computer ScienceComputer Science (R0)