A Peer-to-Peer Dynamic Multi-objective Particle Swarm Optimizer
Multi-objective optimization problem is an important part in solving a wide number of engineering and scientific applications. To-date, most of the research has been conducted in solving static multi-objective problems where the decision variables and/or the objective functions do not change over a period of time. In a dynamic environment, the particles non dominated solution set during a specific iteration may no longer be valid due to change in the underlying system. As a result, traditional techniques for solving static multi-objective functions cannot be applied for solving dynamic multi-objective functions. Further, with the increase in the number of variables/objective functions, a single system based optimizer will take a long time to compute the non-dominated solution set. In this paper, we present a peer-to-peer distributed particle swarm optimization algorithm that tracks the change in the underlying system and is able to produce a diversified and dense non- dominated set using a network of peer-to-peer system. Our algorithms are tested using a set of known benchmark problems and results are reported. To our knowledge, this algorithm is the first of its kind in the areas of peer-to-peer particle swarm optimization.
Unable to display preview. Download preview PDF.
- 1.Helbig, M.: Solving dynamic multi-objective optimisation problems using vector evaluated particle swarm optimisation. PhD thesis, University of Pretoria (2012)Google Scholar
- 2.Wang, Y., Li, B.: Investigation of memory-based multi-objective optimization evolutionary algorithm in dynamic environment. In: IEEE Congress on Evolutionary Computation, CEC 2009, pp. 630–637. IEEE (2009)Google Scholar
- 4.Schaffer, J.D.: Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the 1st International Conference on Genetic Algorithms, pp. 93–100. L. Erlbaum Associates Inc. (1985)Google Scholar
- 7.Zeng, S.Y., Chen, G., Zheng, L., Shi, H., de Garis, H., Ding, L., Kang, L.: A dynamic multi-objective evolutionary algorithm based on an orthogonal design. In: IEEE Congress on Evolutionary Computation, CEC 2006, pp. 573–580. IEEE (2006)Google Scholar
- 8.Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech concurrent computation program, C3P Report 826 (1989)Google Scholar
- 10.Cámara, M., Ortega, J., Toro, F.J.: Parallel processing for multi-objective optimization in dynamic environments. In: IEEE International Parallel and Distributed Processing Symposium, IPDPS 2007, pp. 1–8. IEEE (2007)Google Scholar
- 11.Cámara, M., Ortega, J., de Toro, F.: Approaching dynamic multi-objective optimization problems by using parallel evolutionary algorithms. In: Coello Coello, C.A., Dhaenens, C., Jourdan, L. (eds.) Advances in Multi-Objective Nature Inspired Computing. SCI, vol. 272, pp. 63–86. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 12.Ruiz, I.R.: Sinta-cc: Adaptive intelligent systems for modelling, prediction and dynamic optimization in clusters of computers tin2004-01419Google Scholar