Exact analysis of the sampling distribution for the canonical particle swarm optimiser and its convergence during stagnation

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 134-141

  Poli, Riccardo ^a   Broomhead, David ^b  

^a UNIVERSITY OF ESSEX   (United Kingdom)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Particle swarm optimisation; Theory

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DYNAMIC PROGRAMMING; SAMPLING; STOCHASTIC CONTROL SYSTEMS;

PARTICLE SWARM OPTIMISATION; SAMPLING DISTRIBUTION;

GLOBAL OPTIMIZATION;

EID: 34548098984     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1276977     Document Type: Conference Paper

References (17)

1. L. M. Adleman, "Molecular Computation of Solutions to Combinatorial Problems," Science, vol. 266, pp. 1021-1024, November 1994.
2. A. Brenneman and A. Condon, "Strand Design for Biomolecular Computation", Theoretical Computer Science, vol. 287, pp.39-58, 2002.
3. S.-Y. Shin, L-H. Lee, D. Kim, and B.-T. Zhang, Multiobjective Evolutionary Optimization of DNA Sequences for Reliable DNA Computing", IEEE Transactions on Evolutionary Computation, vol. 9(20), pp.143-158, 2005.
4. F. Tanaka, A. Kameda, M. Yamamoto, and A. Ohuchi, Design of Nucleic Acid Sequences for DNA Computing based on a Thermodynamic Approach, Nucleic Acids Research, 33(3), pp.903911,2005.
5. J. Santalucia, " A Unified View of polymer, dumbbell, and oligonucleotide DNA nearest neighbor thermodynamics", Proc. Natl. Acad. Sci., Biochemistry, pp. 1460-1465, February 1998.
6. A. D'yachkov, P.L. Erdös, A. Macula, V. Rykov, D. Torney, C-S. Tung, P. Vilenkin and S. White, "Exordium for DNA Codes," Journal of Combinatorial Optimization, vol. 7, no. 4, pp. 369-379, 2003.
7. R. Deaton, M. Garzon, R.C. Murphy, J.A. Rose, D.R. Franceschetti, and S.E. Jr. Stevens, "Genetic search of reliable encodings for DNAbased computation," Proceedings of the First Annual Conference on Genetic Programming, pp. 9-15, July 1996.
8. Bishop, M., Macula, A., Pogozelski, W., and Rykov, V., "DNA Codeword Library Design", Proc. Foundations of Nanoscience Self Assembled Architectures and Devices, (FNANO), April 2005.
9. Tulpan, D.C., Hoos, H., Condon, A.,"Stochastic Local Search Algorithms for DNA Word Design", Eighth International Meeting on DNA Based Computers(DNA8), June 2002.
10. S. Houghten, D. Ashlock and J. Lennarz, "Bounds on Optimal Edit Metric Codes", Brock University Tech. Rer.t # CS-05-07, July 2005.
11. O. Milenkovic and N. Kashyap, "On the Design of Codes for DNA Computing," Lecture Notes in Computer Science, pp. 100-119, Springer Verlag, Berlin-Heidelberg, 2006.
12. R. Brualdi, and V. Pless, "Greedy Codes," Journal of Combinatorial Theory Series A, vol. 64, pp. 10-30, 1993.
13. http://www.xilinx.com/
14. http://www.annapmicro.com/
15. D. Burns, K. May, T. Renz, and V. Ross, "Spiraling in on Speed-Ups of Genetic Algorithm Solvers for Coupled Non-Linear ODE System Parameterization and DNA Code Word Library Synthesis," MAPLD International Conference, 2005.
16. P.D. Michailidis and K.G. Margaritis, "New Processor Array Architectures for the Longest Common Subsequence Problem," The Journal of Supercomputing, vol. 32, pp. 51-69, 2005.
17. Y.C. Lin and J.W. Yeh, "A Scalabl and Efficient Systolic Algorithm for the Longest Common subsequence Problem," Journal of Information Science and Engineering, vol. 18, pp. 519-532, 200