Particle Swarms for Linearly Constrained Optimisation

• Autorzy: Paquet U. , Engelbrecht A.P.
• Języki publikacji: EN

Abstrakty

EN

Particle Swarm Optimisation (PSO) has proved to be a very useful algorithm to optimise unconstrained functions. This paper extends PSO to a Linear PSO (LPSO) to optimise functions constrained by a set of equality constraints of the form Ax = b. By initialising particles within a constrained hyperplane, the LPSO is guaranteed to `fly' only through this hyperplane. A criterion on the initial swarm stipulates when the optimum solution can possibly be reached. The Linear PSO is modified to the Converging Linear PSO, for which it is proved to always find at least a local minimum. Experimental results are given, which compare the LPSO and CLPSO with Genocop II.

Słowa kluczowe

EN

Particle Swarm Optimisation (PSO); constrained optimisation; convergence proofs

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2007
• Tom: Vol. 76, nr 1-2
• Strony: 147--170
• Opis fizyczny: bibliogr. 32 poz., tab., wykr.

Twórcy

autor

Paquet U.

autor

Engelbrecht A.P.

• Department of Computer Science University of Pretoria Pretoria 0002, South Africa,

Bibliografia

• [1] Angeline, P.J.: Evolutionary optimization versus particle swarm optimization: philosophy and performance differences, Proceedings of the Seventh Annual Conference on Evolutionary Programming, 1998.
• [2] Bäck, T., Fogel, D.B., Michalewicz, Z.: Handbook of Evolutionary Computation, Oxford University Press, New York, 1997.
• [3] Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From natural to artificial systems, Oxford University Press, 1999.
• [4] Brits, R.: Niching particle swarm optimizers, Masters Thesis, University of Pretoria, 2003.
• [5] Clerc, M., Kennedy, J.: The particle swarm - explosion, stability, and convergence in a multidimensional complex space, IEEE Transactions on Evolutionary Computation, 6(1), 2002, 58-73.
• [6] Corne, D., Dorigo, M., Glover, F.: New Ideas in Optimization, McGraw-Hill, 1999.
• [7] Davis, L.: Genetic Algorithms and Simulated Annealing, Pitman, London, 1987.
• [8] Dorigo, M., Stützle, T.: Ant Colony Optimization, MIT Press, 2004.
• [9] Eberhart, R.C., Dobbins, R.W., Simpson, P.: Computational Intelligence PC Tools, Academic Press, 1996.
• [10] Eberhart, R.C., Shi, Y.: Comparing inertia weights and constriction factors in particle swarm optimization, Proceedings of the Congress on Evolutionary Computation, 2000, 84-88.
• [11] Engelbrecht, A.P.: Fundamentals of Computational Swarm Intelligence, Wiley & Sons, 2005.
• [12] Fletcher, R.: Practical Methods of Optimization, vol. 1, John Wiley & Sons, 1980.
• [13] Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learning, Addison-Wesley, 1989.
• [14] Hamida, S.B., Schoenauer, M.: ASHEA: New results using adaptive segregational handling, IEEE World Congress on Computational Intelligence, Proceedings of the Congress on Evolutionary Computing, Honolulu, Hawaii, 2002.
• [15] Kennedy, J., Eberhart, R.C.: Particle swarm optimization, Proceedings of the IEEE International Conference on Neural Networks, vol. 4, 1995, 1942-1948.
• [16] Kennedy, J.: Small worlds and mega minds: effects of neighborhood topology on particle swarm performance, Proceedings of the Congress of Evolutionary Computation, Washingto D.C., USA, 1999, 1931-1938.
• [17] Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm Intelligence, Morgan Kaufmann Publishers, 2001.
• [18] Kennedy, J., Mendes, R.: Population structure and particle swarm performance, IEEE World Congress on Computational Intelligence, Proceedings of the Congress on Evolutionary Computing, Honolulu, Hawaii, 2002.
• [19] Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, Springer Verlag, 1996.
• [20] Michalewicz, Z., Janikow, C.Z.: GENOCOP: a genetic algorithm for numerical optimization problems with linear constraints, Communications of the ACM, 39, article no. 175, 1996.
• [21] Michalewicz, Z., Schoenauer,M.: Evolutionary algorithms for constrained parameter optimization Problems, Evolutionary Computation, 4, 1996, 1-32.
• [22] Nocedal, J., Wright, S.J.: Numerical Optimization, Springer Verlag, 1999.
• [23] Paquet, U., Engelbrecht, A.P.i: Training Support Vector Machines with Particle Swarms, Proceedings of the IEEE International Joint Conference on Neural Networks, Portland, USA, 2003.
• [24] Shi, Y., Eberhart, R.C.: Parameter selection in particle swarm optimization, Proceedings of the Seventh Annual Conference on Evolutionary Programming, 1998, 591-600.
• [25] Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer, Proceedings of the IEEE Congress on Evolutionary Computation, 1998, 69-73.
• [26] Shi, Y., Eberhart, R.C.: Empirical study of particle swarm optimization, Proceedings of the IEEE Congress on Evolutionary Computation, vol. 3, 1999, 1945-1950.
• [27] Shi, Y., Krohling, R.A.: Co-evolutionary particle swarm optimization to solve min-max problems, IEEE World Congress on Computational Intelligence, Proceedings of the Congress on Evolutionary Computing, Honolulu, Hawaii, 2002.
• [28] Solis, F., Wets, R.: Minimization by random search techniques, Mathematics of Operations Research, 6, 1981, 19-30.
• [29] Suganthan, P.N.: Particle swarm optimiser with neighbourhood operator. Proceedings of the IEEE Congress on Evolutionary Computation, 1999, 1958-1962.
• [30] Van den Bergh, F.: An analysis of particle swarm optimizers. PhD Thesis, University of Pretoria, 2002.
• [31] Van den Bergh, F., Engelbrecht A.P.: A locally convergent particle swarm optimiser, IEEE conference on Systems, Man, and Cybernetics, Tunisia, 2002.
• [32] Whitley, D., Gordon, V.S., Mathias, K.: Lamarcian evolution, the baldwin effect and function optimization, Proceedings of the Third Conference on Parallel Problem Solving from Nature (Y. Davidor, H-P. Schwefel, R. Männer, Ed), Springer, 1996.