PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Properties of Quantum Particles in Multi-Swarms for Dynamic Optimization

Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
This paper studies properties of a multi-swarm system based on a concept of physical quantum particles (mQSO). Quantum particles differ from the classic ones in the way they move. As opposed to the classic view of particle movement, where motion is controlled by linear kinematic laws, quantum particles change their location according to random distributions. The procedure for generating a new location for the quantum particle is similar to mutation operators widely used in evolutionary computation with real-valued representation. In this paper we study a set of new distributions of candidates for quantum particle location, and we show different features of these distributions. The distributions considered in this paper are divided into two classes: those with a limited range of the new location coordinates and those without such limitations. They are tested on different types of dynamic optimization problems. Experimental verification has been based on a number of testing environments and two main versions of the algorithm: with and without mechanisms protecting against stagnation caused by convergence of sub-swarms during the search process. The experimental results show the advantages of the distribution class, in which the candidates are spread out in the entire search space, and indicate the positive and negative aspects of application of anti-convergence mechanisms.
Wydawca
Rocznik
Strony
349--380
Opis fizyczny
Bibliogr. 51 poz., tab., wykr.
Twórcy
  • Institute of Computer Science, Polish Academy of Sciences, Ordona 21, 01-237, Warszawa, Poland, trojanow@ipipan.waw.pl
Bibliografia
  • [1] Blackwell, T.: Particle swarm optimization in dynamic environments, in: Evolutionary Computation in Dynamic and Uncertain Environments (S. Yang, Y.-S. Ong, Y. Jin, Eds.), vol. 51 of Studies in Computational Intelligence, Springer, 2007, 29-49.
  • [2] Blackwell, T., Bentley, P. J.: Don't push me! Collision-avoiding swarms, Proc. Congress on Evolutionary Computation (D. B. Fogel, et al., Eds.), IEEE Press, 2002.
  • [3] Blackwell, T., Bentley, P. J.: Dynamic search with charged swarms, GECCO 2002: Proc. of the Genetic and Evolutionary Computation Conference, New York, USA, 9-13 July 2002 (W. B. Langdon, et al., Eds.), Morgan Kaufmann, 2002.
  • [4] Blackwell, T., Branke, J.: Multi-swarm optimization in dynamic environments, Applications of Evolutionary Computing, Evo Workshops 2004 (G. R. Raidl, et al., Eds.), LNCS 3005, Springer, 2004.
  • [5] Blackwell, T., Branke, J.: Multiswarms, exclusion, and anti-convergence in dynamic environments, IEEE Trans. Evol. Comput., 10(4), 2006, 459 - 472.
  • [6] Bohachevsky, I. O., Johnson,M. E., Stein, M. L.: Generalized simulated annealing for function optimization, Technometrics, 28(3), Aug. 1986, 209-217.
  • [7] Branke, J.: The Moving Peaks Benchmark, http://www.aifb.uni-karlsruhe.de/~jbr/MovPeaks/movpeaks/.
  • [8] Branke, J.: Memory enhanced evolutionary algorithm for changing optimization problems, Proc. Congress on Evolutionary Computation (P. J. Angeline, et al., Eds.), 3, IEEE Press, 1999.
  • [9] Branke, J.: Evolutionary optimization in dynamic environments, Kluwer Academic Publishers, 2002.
  • [10] Brooks, D. G., Verdini, W. A.: Computational experience with generalized simulated annealing over continuous variables, Am. J. Math. Manage. Sci., 8(3-4), 1988, 425-449.
  • [11] de Castro, L. N., Timmis, J.: An artificial immune network for multimodal function optimization, Proc. Congress on Evolutionary Computation (D. B. Fogel, et al., Eds.), IEEE Press, 2002.
  • [12] Chambers, J. M., Mallows, C. L., Stuck, B. W.: A method for simulating stable random variables, J. Amer. Statist. Assoc., 71(354), 1976, 340-344.
  • [13] Clerc, M., Kennedy, J.: The particle swarm-explosion, stability, and convergence in a multi-dimensional complex space, IEEE Trans. Evol. Comput., 6(1), 2002, 58-73.
  • [14] Eiben, A. E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms, IEEE Trans. Evol. Comput., 3(2), 1999, 124-141.
  • [15] Gutowski, M.: Levy flights as an underlying mechanism for a global optimization algorithm, Proc. 5th National Conf. on Evolutionary Computation and Global Optimisation,Warsaw Univ. of Technology Publishing House, arXiv:math-ph/0106003v1 http://arxiv.org/abs/math-ph/0106003, 2001.
  • [16] Ingberg, L.: Very fast simulated re-annealing, Math. Comput. Model., 12(8), 1989, 967-973.
  • [17] Janson, S., Middendorf, M.: A hierahical particle swarm optimizer for noisy and dynamic environment, Genetic Programming and Evolvable Machines, 7(4), 2006, 329-354.
  • [18] Jin, Y., Branke, J.: Evolutionary algorithms in uncertain environments - a survey, IEEE Trans. Evol. Comput., 9(3), 2005, 303-317.
  • [19] Jones, T.: Evolutionary algorithms, fitness landscapes and search, Ph.D. Thesis, University of New Mexico, 1995.
  • [20] Kennedy, J.: Bare bones particle swarms, IEEE Swarm Intelligence Symposium (SIS 2003), IEEE Press, 2003.
  • [21] Kennedy, J., Eberhart, R. C.: Particle swarm optimization, Proc. IEEE Int. Conf. on Neural Networks (ICNN'95), 4, IEEE Service Center, 1995.
  • [22] Lee, C.-Y., Yao, X.: Evolutionary programming using mutations based on the Levy probability distribution, IEEE Trans. Evol. Comput., 8(1), 2004, 1-13.
  • [23] Li, X.: Adaptively choosing neighborhood bests in a particle swarm optimizer for multimodal function optimization, GECCO 2004: Proc. Conference on Genetic and Evolutionary Computation (K. Deb, et al., Eds.), LNCS 3102, Springer, 2004.
  • [24] Li, X., Branke, J., Blackwell, T.: Particle swarm with speciation and adaptation in a dynamic environment, GECCO 2006: Proc. Conference on Genetic and Evolutionary Computation (M. Keijzer, et al., Eds.), ACM Press, 2006.
  • [25] Lu, H., Chen, W.: Dynamic-objective particle swarm optimization for constrained optimization problems, J. Comb. Optim., 12(4), 2006, 409-419.
  • [26] Marsaglia, G.: Choosing a point from the surface of a sphere, Ann. Math. Statist., 43(2), 1972, 645-646.
  • [27] Morrison, R. W.: Designing evolutionary algorithms for dynamic environments, Springer, 2004.
  • [28] Morrison,W. R.: Performance measurement in dynamic environments, GECCO 2003: Proc. of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, AAAI, 2003.
  • [29] Mu˜noz Zavala, A. E., Aguirre, A. H., Villa Diharce, E. R.: Constrained optimization via particle evolutionary swarm optimization algorithm (PESO), GECCO 2005: Proc. Conference on Genetic and Evolutionary Computation (H.-G. Beyer, et al., Eds.), 1, ACM Press, 2005.
  • [30] Nam, D., Lee, J.-S., Park, C. H.: n-dimensional cauchy neighbor generation for the fast simulated annealing, IEICE T. Inf. Syst., E87-D(11), Nov. 2004, 2499-2502.
  • [31] von Neumann, J.: Various techniques used in connection with random digits. Monte Carlo methods, Nat. Bureau Standards, 12, 1951, 36-38.
  • [32] Obuchowicz, A.: Multidimensionalmutations in evolutionary algorithms based on real-valued representation, Int. J. Syst. Sci., 34(7), June 2003, 469 - 483.
  • [33] Obuchowicz, A.: Evolutionary algorithms with mutations based on _-stable and directional distributions, Proc. 10th National Conf. on Evolutionary Computation and Global Optimisation (J. Arabas, Ed.), number 160 in Prace Naukowe, Elektronika,Warsaw Univ. of Technology Publishing House, 2007.
  • [34] Obuchowicz, A., Pretki, P.: Phenotypic evolution with a mutation based on symmetric _-stable distributions, Int. J. Appl. Math. Comput. Sci., 14(3), 2004, 289-316.
  • [35] Obuchowicz, A., Pretki, P.: Isotropic symmetric _-stable mutations for evolutionary algorithms, Proc. Congress on Evolutionary Computation (D. Corne, et al., Eds.), 1, IEEE Press, 2005.
  • [36] Parrot, D., Li, X.: Locating and tracking multiple dynamic optima by a particle swarm model using speciation, IEEE Trans. Evol. Comput., 10(4), 2006, 440 - 458.
  • [37] Pulido, G. T., Coello, C. A. C.: A constraint handling mechanism for particle swarm optimization, Proc. Congress on Evolutionary Computation, 2, IEEE, 2004.
  • [38] Richer, T. J., Blackwell, T. M.: The Lévy particle swarm, Proc. Congress on Evolutionary Computation (G. G. Yen, et al., Eds.), IEEE Press, 2006.
  • [39] Romeijn, H. E., Smith, R. L.: Simulated annealing for constrained global optimization, J. Global Optim., 5(2), 1994, 101-126.
  • [40] Szu, H., Hartley, R.: Fast simulated annealing, Phys. Lett. A, 122, June 1987, 157-162.
  • [41] Trojanowski, K.: Adaptive non-uniformdistribution of quantumparticles in mQSO, SEAL 2008 (X. Li, et al., Eds.), LNCS 5361, Springer, 2008.
  • [42] Trojanowski, K.: Non-uniform distributions of quantum particles in multi-swarm optimization for dynamic tasks, ICCS 2008, Part I (M. Bubak, et al., Eds.), LNCS 5101, Springer, 2008.
  • [43] Trojanowski, K.: Tuning quantum multi-swarm optimization for dynamic tasks, ICAISC 2008 (Rutkowski, et al., Eds.), LNAI 5097, Springer, 2008.
  • [44] Trojanowski, K., Obuchowicz, A.: Measures for non-stationary optimization tasks, 5th ICANNGA: Artificial Neural Nets and Genetic Algorithms, Springer, 2001.
  • [45] Trojanowski, K., Wierzchoń, S. T.: Immune-based algorithms for dynamic optimization, Inform. Sciences, 179, 2009, 1495-1515.
  • [46] Weicker, K.: Performance measures for dynamic environments, Parallel Problem Solving from Nature - PPSN VII (G. Goos, et al., Eds.), LNCS 2439, Springer, 2002.
  • [47] Weicker, K.: Evolutionary algorithms and dynamic optimization problems, Springer, 2003.
  • [48] Yao, X., Liu, Y.: Fast evolutionary programming, Evolutionary Programming V (L. J. Fogel, et al., Eds.), MIT Press, 1996.
  • [49] Yao, X., Liu, Y.: Fast evolution strategies, Control Cybern., 26(3), 1997, 467-496.
  • [50] Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster, IEEE Trans. Evol. Comput., 3(2), 1999, 82-102.
  • [51] Yuan, B., Orłowska, M., Sadiq, S.: Extending a class of continuous estimation of distribution algorithms to dynamic problems, Optimization Letters, 2(3), 2008, 433-443.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS8-0005-0084
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.