Table of Contents
Journal of Artificial Evolution and Applications
Volume 2008, Article ID 143624, 14 pages
http://dx.doi.org/10.1155/2008/143624
Research Article

Geometric Particle Swarm Optimization

1Centre for Informatics and Systems of the University of Coimbra, Polo II - University of Coimbra, Coimbra 3030-290, Portugal
2Department of Computing and Electronic Systems, University of Essex, Wivenhoe Park, Colchester CO4 3SQ, UK
3Dalle Molle Institute for Artificial Intelligence (IDSIA), Galleria 2, Manno-Lugano 6928, Switzerland

Received 21 July 2007; Accepted 4 December 2007

Academic Editor: T. Blackwell

Copyright © 2008 Alberto Moraglio et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. T. Bäck, Evolutinary Algorithms in Theory and in Practice, Oxford University Press, Oxford, UK, 1996.
  2. M. Clerc, “Discrete particle swarm optimization, Illustrated by the traveling salesman problem,” in New Optimization Techniques in Engineering, Springer, New York, NY, USA, 2004.
  3. M. Clerc and J. Kennedy, “The particle swarm-explosion, stability, and convergence in a multidimensional complex space,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, 2002. View at Publisher · View at Google Scholar
  4. M. Clerc, “When nearer is better,” 2007, Hal Open Archive.
  5. M. Deza and M. Laurent, Geometry of Cuts and Metrics, Springer, New York, NY, USA, 1991.
  6. K. De Jong, An analysis of the behaviour of a class of genetic adaptive systems, Ph.D. thesis, University of Michigan, Ann Arbor, Mich, USA, 1975.
  7. D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, Mass, USA, 1989.
  8. T. Jones, Evolutionary algorithms, fitness landscapes and search, Ph.D. thesis, University of New Mexico, Albuquerque, NM, USA, 1995.
  9. J. Kennedy and R. C. Eberhart, “A discrete binary version of the particle swarm algorithm,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (ICSMC '97), vol. 5, pp. 4104–4108, Orlando, Fla, USA, October 1997. View at Publisher · View at Google Scholar
  10. J. Kennedy and R. C. Eberhart, Swarm Intelligence, Morgan Kaufmann, San Francisco, Calif, USA, 2001.
  11. D. E. Knuth, “Dancing links,” 2000, Preprint P159, Stanford University.
  12. A. Moraglio, J. Togelius, and S. Lucas, “Product geometric crossover for the Sudoku puzzle,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '06), pp. 470–476, Vancouver, BC, Canada, July 2006.
  13. A. Moraglio and R. Poli, “Topological interpretation of crossover,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '04), vol. 3102, pp. 1377–1388, Seattle, Wash, USA, June 2004.
  14. A. Moraglio and R. Poli, “Topological crossover for the permutation representation,” in Proceedings of the Workshops on Genetic and Evolutionary Computation (GECCO '05), pp. 332–338, Washington, DC, USA, June 2005. View at Publisher · View at Google Scholar
  15. A. Moraglio and R. Poli, “Product geometric crossover,” in Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN '06), pp. 1018–1027, Reykjavik, Iceland, September 2006. View at Publisher · View at Google Scholar
  16. A. Moraglio and R. Poli, “Geometric crossover for sets, multisets and partitions,” in Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN '06), pp. 1038–1047, Reykjavik, Iceland, September 2006. View at Publisher · View at Google Scholar
  17. A. Moraglio and R. Poli, “Geometric landscape of homologous crossover for syntactic trees,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '05), pp. 427–434, Edinburgh, UK, September 2005.
  18. A. Moraglio, R. Poli, and R. Seehuus, “Geometric crossover for biological sequences,” in Proceedings of the 9th European Conference on Genetic Programming, pp. 121–132, Budapest, Hungary, April 2006.
  19. H. Müehlenbein, M. Schomisch, and J. Born, “The Parallel genetic algorithm as function optimizer,” Parallel Computing, vol. 17, pp. 619–632, 1991.
  20. P. M. Pardalos and M. G. C. Resende, Handbook of Applied Optimization, Oxford University Press, Oxford, UK, 2002.
  21. Y. Shi and R. C. Eberhart, “A modified particle swarm optimizer,” in Proceedings of the IEEE Congress on Evolutionary Computation, pp. 69–73, Anchorage, Alaska, USA, May 1998. View at Publisher · View at Google Scholar
  22. A. Törn and A. Zilinskas, Global Optimization, vol. 350 of Lecture Notes in Computer Science, Springer, Berlin, Germany, 1989.
  23. T. Yato and T. Seta, “Complexity and completeness of finding another solution and its application to puzzles,” 2005, Preprint, University of Tokyo.
  24. M. L. J. van de Vel, Theory of Convex Structures, North-Holland, Amsterdam, The Netherlands, 1993.