LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Bratton, Daniel
Languages: English
Types: Doctoral thesis
Subjects: G490

Classified by OpenAIRE into

ACM Ref: MathematicsofComputing_NUMERICALANALYSIS
The substantial advances that have been made to both the theoretical and practical aspects of particle\ud swarm optimization over the past 10 years have taken it far beyond its original intent as a biological\ud swarm simulation. This thesis details and explains these advances in the context of what has been\ud achieved to this point, as well as what has yet to be understood or solidified within the research community.\ud Taking into account the state of the modern field, a standardized PSO algorithm is defined for\ud benchmarking and comparative purposes both within the work, and for the community as a whole.\ud \ud This standard is refined and simplified over several iterations into a form that does away with potentially\ud undesirable properties of the standard algorithm while retaining equivalent or superior performance\ud on the common set of benchmarks. This refinement, referred to as a discrete recombinant swarm (PSODRS)\ud requires only a single user-defined parameter in the positional update equation, and uses minimal\ud additive stochasticity, rather than the multiplicative stochasticity inherent in the standard PSO. After a\ud mathematical analysis of the PSO-DRS algorithm, an adaptive framework is developed and rigorously\ud tested, demonstrating the effects of the tunable particle- and swarm-level parameters. This adaptability\ud shows practical benefit by broadening the range of problems which the PSO-DRS algorithm is wellsuited\ud to optimize.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 4 A Simplified, Recombinant PSO Algorithm 68 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 4.2 PSO with Discrete Recombination . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 4.3 Simplifying Recombinant PSO . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 4.3.1 PSO-DR Model 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 4.3.2 PSO-DR Model 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 4.4 Performance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 74 4.4.1 Dip Statistics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 4.5 Velocity Bursts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 4.5.1 Bursting under PSO-DR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 4.6 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 4.7 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
    • [11] M. Clerc. Tribes, a parameter free particle swarm optimizer. In Proc of the OEP, Paris, France, 2003.
    • [12] R. Mendes. Population Topologies and their Influence in Particle Swarm Performance. PhD thesis, Escola de Engenharia, Universidade do Minho, 2004.
    • [13] G.B. Dantzig. Programming of interdependent activities II. Mathematical model. Econometrica, 17:200-211, 1949.
    • [14] N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373- 395, 1984.
    • [25] C. Schumacher, M. D. Vose, and L. D. Whitley. The No Free Lunch and problem description length. In Proc of the Genetic and Evolutionary Computation Conference (GECCO 2001), pages 565-570, San Francisco, CA, USA, 2001.
    • [26] T. Ba¨ck. Evolutionary Algorithms in Theory and Practice. Oxford University Press, USA, 1995.
    • [27] A.S. Fraser. Simulation of genetic systems by automatic digital computers. Aust. J. Biol. Sci., 10, 1957.
    • [28] A. Fraser and D. Burnell. Computer Models in Genetics. New York, McGraw-Hill, 1970.
    • [29] J.L. Crosby. Computer Simulation in Genetics. London, John Wiley & Sons, 1973.
    • [30] S. Ronald. Robust encodings in genetic algorithms: A survey of encoding issues. In Proc of the 1997 IEEE International Conference on Evolutionary Computation, pages 43-48, 1997.
    • [31] D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. AddisonWesley, 1989.
    • [32] L.J. Fogel, A.J. Owens, and M.J. Walsh. Artificial Intelligence through Simulated Evolution. John Wiley, 1966.
    • [40] M. Millonas. Swarms, phase transitions, and collective intelligence. Computational Intelligence: A Dynamic System Perspective. IEEE Press, Piscataway, NJ, USA, 1994.
    • [41] R. Eberhart, P. Simpson, and R. Dobbins. Computational Intelligence PC Tools. Morgan Kaufmann Publishers, 1996.
    • [42] J.M. Bishop. Stochastic searching networks. In Proc. 1st IEE Int. Conf. on Artificial Neural Networks, pages 329-331. Chapman & Hall, 1989.
    • [43] S. Hurley and R.M. Whitaker. An agent based approach to site selection for wireless networks. In Proceedings of the 2002 ACM symposium on Applied computing, SAC '02, pages 574-577, New York, NY, USA, 2002. ACM.
    • [44] H. J. Grech-Cini and G.T. McKee. Locating the mouth region in images of human faces. Sensor Fusion VI, 2059(1):458-465, 1993.
    • [45] N. I. Katevas, N. M. Sgouros, S. G. Tzafestas, G. Papakonstantinou, P. Beattie, J. M. Bishop, P. Tsanakas, and D. Koutsouris. The autonomous mobile robot SENARIO: A sensor aided intelligent navigation system for powered wheelchairs. Robotics & Automation Magazine, IEEE, 4(4):60-70+, 1997.
    • [46] S.J. Nasuto, J.M. Bishop, and S. Lauria. Time Complexity Analysis of the Stochastic Diffusion Search. In Neural Computation, pages 260-266, 1998.
    • [47] S. J. Nasuto and J. M. Bishop. Convergence Analysis of Stochastic Diffusion Search. Parallel Algorithms Appl., 14(2):89-107, 1999.
    • [48] D.R. Myatt, J.M. Bishop, and S.J. Nasuto. Minimum stable convergence criteria for stochastic diffusion search. Electronics Letters, 40(2):112-113, 2004.
    • [53] C.W. Reynolds. Flocks, herds, and schools: A distributed behavioral model. Computer Graphics, 21:25-34, 1987.
    • [55] Y. Shi and R. Eberhart. A modified particle swarm optimizer. In Proc of the 1998 IEEE Conference on Evolutionary Computation, pages 69-73, Anchorage, AK, 1998.
    • [56] Y. Shi and R. Eberhart. Empirical study of particle swarm optimization. In Proc of the Congress on Evolutionary Computation, pages 1945-1959, Washington, D.C., USA, 1999. IEEE Service Center, Piscataway, NJ, USA.
    • [57] R. Eberhart and Y. Shi. Tracking and optimizing dynamic systems with particle swarms. In Proc of the 2001 Congress on Evolutionary Computation (CEC'01), volume 1, pages 94-100, 2001.
    • [58] Y. Zheng, L. Ma, L. Zhang, and J. Qian. On the convergence analysis and parameter selection in PSO. In Proc of the 2003 IEEE International Conference on Machine Learning and Cybernetics, pages 1802-1807. IEEE Press, Piscataway, NJ, USA, 2003.
    • [59] M. Clerc. Personal communication on the development of the constriction method, 2006.
    • [60] R. Eberhart and Y. Shi. Comparing inertia weights and constriction factors in particle swarm optimization. In Proc of the 2000 Congress on Evolutionary Computation, volume 1, pages 84- 88, 2000.
    • [61] J. Kennedy. Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance. In Proc of the 1999 IEEE Congress on Evolutionary Computation, pages 1931- 1938. IEEE Press, Piscataway, NJ, USA, 1999.
    • [62] J. Kennedy and R. Mendes. Population structure and particle swarm performance. In Proc of the 2002 IEEE Congress on Evolutionary Computation, pages 1671-1676, Honolulu, HA, USA, 2002. IEEE Press, Piscataway, NJ, USA.
    • [66] P. Suganthan. Particle swarm optimizer with neighborhood operator. In Proc of the 1999 IEEE Congress on Evolutionary Computation, pages 1958-1962. IEEE Press, Piscataway, NJ, USA, 1999.
    • [67] M. Clerc. Standard PSO 2006, available at http://www.particleswarm.info/, 2006.
    • [68] E. Ozcan and C. K. Mohan. Analysis of a simple particle swarm optimization system. Intelligent Engineering Systems through Artificial Neural Networks, 8:253-258, 1998.
    • [69] E. Ozcan and C. K. Mohan. Particle swarm optimization: Surfing the waves. In Proc of the 1999 Congress on Evolutionary Computation, pages 1939-1944, Piscataway, NJ, 1999. IEEE Service Center.
    • [78] R. Poli. On the moments of the sampling distribution of particle swarm optimisers. In GECCO '07: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation, pages 2907-2914, New York, NY, USA, 2007. ACM.
    • [92] K. Yasuda and N. Iwasaki. Adaptive particle swarm optimization via velocity feedback. In A. Abraham, Y. Dote, T. Furuhashi, M. Ko¨ppen, A. Ohuchi, and Y. Ohsawa, editors, Soft Computing as Transdisciplinary Science and Technology, volume 29 of Advances in Soft Computing, pages 423-432. Springer Berlin / Heidelberg, 2005.
    • [103] T. Blackwell and P. Bentley. Don't Push Me! Collision-Avoiding Swarms. In Proc of the IEEE Congress on Evolutionary Computation 2002, volume 2, pages 1691-1696, 2002.
    • [142] A. Sutton, D. Whitley, M. Lunacek, and A. Howe. PSO and multi-funnel landscapes: How cooperation might limit exploration. In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 75-82, New York, NY, USA, 2006. ACM.
    • [143] S. Call, D. Zubarev, and A. Boldyrev. Global minimum structure searches via particle swarm optimization. Journal of Computational Chemistry, 28(7):1177-1186, 2007.
    • [144] B. Secrest and G. Lamont. Visualizing particle swarm optimization - Gaussian particle swarm optimization. In Proc of the IEEE Swarm Intelligence Symposium, pages 198-204. IEEE Press, Piscataway, NJ, USA, 2003.
    • [145] D. Bratton and T. Blackwell. Understanding particle swarms through simplification: A study of recombinant PSO. In Proc. of the GECCO-2007 Workshop on Particle Swarms: The Second Decade, London, UK, 2007.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article