Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2010 (2010), Article ID 379649, 30 pages
http://dx.doi.org/10.1155/2010/379649
Research Article

Hierarchical Swarm Model: A New Approach to Optimization

1Key Laboratory of Industrial Informatics, Shenyang Institute of Automation, Chinese Academy of Sciences, Faculty Office III, Nanta Street 114#, Dongling District, Shenyang 110016, China
2School of Information Science and Engineering, Central South University, Changsha 410083, China

Received 1 September 2009; Revised 16 January 2010; Accepted 8 March 2010

Academic Editor: Aura Reggiani

Copyright © 2010 Hanning Chen 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. S. Liu and K. Passino, “Swarm intelligence: literature overview,” Department of Electrical Engineering, the Ohio State University, March 2000.
  2. D. Chowdhury, K. Nishinari, and A. Schadschneider, “Self-organized patterns and traffic flow in colonies of organisms: from bacteria and social insects to vertebrates,” Phase Transitions, vol. 77, no. 5–7, pp. 601–624, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. E. Bonabeau, M. Dorigo, and G. Theraulaz, Swarm Intelligence: From Natural to Artificial Systems, Oxford University Press, Oxford, UK, 1999.
  4. M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 26, no. 1, pp. 29–41, 1996. View at Google Scholar
  5. M. Dorigo, G. Di Caro, and L. M. Gambardella, “Ant algorithms for discrete optimization,” Artificial Life, vol. 5, no. 2, pp. 137–172, 1999. View at Google Scholar
  6. M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997. View at Google Scholar
  7. J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, Piscataway, NJ, USA, 1995.
  8. J. Kennedy and R. C. Eberhart, Swarm Intelligence, chapter 9, Morgan Kaufmann Publishers, San Francisco, Calif, USA, 2001.
  9. K. E. Parsopoulos and M. N. Vrahatis, “On the computation of all global minimizers through particle swarm optimization,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 211–224, 2004. View at Publisher · View at Google Scholar
  10. D. N. Wilke, Analysis of the particle swarm optimization algorithm, M.S. thesis, Department of Mechanical and Aeronautical Engineering, University of Pretoria, Pretoria, South Africa, 2005.
  11. K. M. Passino, “Biomimicry of bacterial foraging for distributed optimization and control,” IEEE Control Systems Magazine, vol. 22, no. 3, pp. 52–67, 2002. View at Publisher · View at Google Scholar
  12. D. Dasgupta, Artificial Immune Systems and Their Applications, Springer, Heidelberg, Germany, 1999.
  13. E. Benjamini, G. Sunshine, and S. Leskowitz, Immunology: A Short Course, Wiley, New York, NY, USA, 3rd edition, 1996.
  14. D. Karaboga, “An idea based on honeybee swarm for numerical optimization,” Tech. Rep. TR06, Computer Engineering Department, Engineering Faculty, Erciyes University, 2005. View at Google Scholar
  15. B. Basturk and D. Karaboga, “An artificial bee colony (ABC) algorithm for numeric function optimization,” in Proceedings of IEEE Swarm Intelligence Symposium, Indianapolis, Ind, USA, May 2006.
  16. R. C. Eberhart and Y. Shi, “Particle swarm optimization: developments, applications and resources,” in Proceedings of the IEEE Conference on Evolutionary Computation (ICEC '01), vol. 1, pp. 81–86, Piscataway, NJ, USA, 2001.
  17. S. Mishra, “A hybrid least square-fuzzy bacterial foraging strategy for harmonic estimation,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 1, pp. 61–73, 2005. View at Publisher · View at Google Scholar
  18. M. Tripathy, S. Mishra, and G. K. Venayagamoorthy, “Bacteria foraging: a new tool for simultaneous robust design of UPFC controllers,” in Proceedings of IEEE International Joint Conference on Neural Networks (IJCNN '06), pp. 2274–2280, Vancouver, Canada, July 2006.
  19. M. Tripathy, S. Mishra, L. L. Lai, and Q. P. Zhang, “Transmission loss reduction based on FACTS and bacteria foraging algorithm,” in Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN '06), vol. 4193 of Lecture Notes in Computer Science, pp. 222–231, September 2006.
  20. C. A. Coello and N. C. Cores, “A parallel implementation of the artificial immune system to handle constraints in genetic algorithms: preliminary results,” in Proceedings of the Congress on Evolutionary Computation (CEC '02), pp. 819–824, Honolulu, Hawaii, USA, 2002.
  21. A. Swiecicka, F. Seredynski, and A. Y. Zomaya, “Multiprocessor scheduling and rescheduling with use of cellular automata and artificial immune system support,” IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 3, pp. 253–262, 2006. View at Publisher · View at Google Scholar
  22. V. Maniezzo and A. Colorni, “The ant system applied to the quadratic assignment problem,” IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 5, pp. 769–778, 1999. View at Google Scholar
  23. N. Minar, R. Burkhard, C. Langton, and M. Askenazi, “The swarm simulation system: a toolkit for building multi-agent simulations,” Tech. Rep. 96-06-042, Santa Fe Institute, Santa Fe, NM, USA, 1996, http://www.santafe.edu/media/workingpapers/96-06-042.pdf. View at Google Scholar
  24. C. Anderson, N. R. Franks, and D. W. McShea, “The complexity and hierarchical structure of tasks in insect societies,” Animal Behaviour, vol. 62, no. 4, pp. 643–651, 2001. View at Publisher · View at Google Scholar
  25. H. A. Simon, Sciences of the Artificial, MIT Press, Cambridge, Mass, USA, 1969.
  26. N. Boccara, Modeling Complex Systems, Graduate Texts in Contemporary Physics, Springer, New York, NY, USA, 2004. View at Zentralblatt MATH · View at MathSciNet
  27. C. Anderson and D. W. McShea, “Intermediate-level parts in insect societies: adaptive structures that ants build away from the nest,” Insectes Sociaux, vol. 48, no. 4, pp. 291–301, 2001. View at Google Scholar
  28. M. J. Jacobson, “Problem solving about complex systems: differences between experts and novices,” in Proceedings of the 4th International Conference of the Learning Sciences, pp. 14–21, Erlbaum, Mahwah, NJ, USA, 2000.
  29. F. Atay and J. Jost, “On the emergence of complex systems on the basis of the coordination of complex behavior of their elements,” Tech. Rep. 04-02-005, Santa Fe Institute, Santa Fe, NM, USA, 2003, http://www.santafe.edu/media/workingpapers/04-02-005.pdf. View at Google Scholar
  30. S. Halloy, “A theoretical framework for abundance distributions in complex systems,” Tech. Rep. 99-04-031, Santa Fe Institute, Santa Fe, NM, USA, 1999, http://www.santafe.edu/media/workingpapers/99-04-031.pdf. View at Google Scholar
  31. S. Salthe, Evolving Hierarchical Systems: Their Structure and Representation, Columbia University Press, New York, NY, USA, 1985.
  32. H. H. Pattee, Ed., Hierarchy Theory: The Challenge of Complex Systems, George Braziller, New York, NY, USA, 1973.
  33. H. N. Chen, Y. L. Zhu, and K. Y. Hu, “Cooperative bacterial foraging optimization,” Discrete Dynamics in Nature and Society, vol. 2009, Article ID 815247, 17 pages, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  34. H. Chen and Y. Zhu, “Optimization based on symbiotic multi-species coevolution,” Applied Mathematics and Computation, vol. 205, no. 1, pp. 47–60, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  35. H. Chen, Y. Zhu, and K. Hu, “Multi-colony bacteria foraging optimization with cell-to-cell communication for RFID network planning,” Applied Soft Computing Journal, vol. 10, no. 2, pp. 539–547, 2010. View at Publisher · View at Google Scholar
  36. J. Kennedy, “Particle swarm: social adaptation of knowledge,” in Proceedings of the IEEE Conference on Evolutionary Computation (ICEC '97), pp. 303–308, Indianapolis, Ind, USA, April 1997.
  37. 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
  38. H. L. Zhang, C. H. C. Leung, and G. K. Raikundalia, “Classification of intelligent agent network topologies and a new topological description language for agent networks,” in Proceedings of the 4th IFIP International Federation for Information Processing, vol. 228, pp. 21–31, Springer, 2006.
  39. D. H. Wolpert and W. G. Macready, “No free lunch theorems for search,” Tech. Rep. SFI-TR-95-02-010, Santa Fe Institute, Santa Fe, NM, USA, 1995. View at Google Scholar
  40. R. Mendes, J. Kennedy, and J. Neves, “The fully informed particle swarm: simpler, maybe better,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 204–210, 2004. View at Publisher · View at Google Scholar
  41. K. E. Parsopoulos and M. N. Vrahatis, “UPSO—a unified particle swarm optimization scheme,” in Proceedings of the International Conference of Computational Methods in Sciences and Engineering (ICCMSE '04), vol. 1 of Lecture Series on Computational Sciences, pp. 868–873, Zeist, The Netherlands, 2004.
  42. T. Peram, K. Veeramachaneni, and C. K. Mohan, “Fitness-distance-ratio based particle swarm optimization,” in Proceedings of the IEEE Swarm Intelligence Symposium, pp. 174–181, 2003.
  43. S. Sumathi, T. Hamsapriya, and P. Surekha, Evolutionary Intelligence: An Introduction to Theory and Applications with Matlab, Springer, New York, NY, USA, 2008.
  44. N. Hansen and A. Ostermeier, “Completely derandomized self-adaptation in evolution strategies,” Evolutionary Computation, vol. 9, no. 2, pp. 159–195, 2001. View at Google Scholar
  45. J. Kennedy and R. Eberhart, “A discrete binary version of the particle swarm optimization algorithm,” in Proceedings of the Conference on Systems, Man, and Cybernetics (SMC '97), pp. 4104–4109, Orlando, Fla, USA, 1997.
  46. M. Clerc, “Binary particle swarm optimisers: toolbox, derivations, and mathematical insights,” February 2005, http://clerc.maurice.free.fr/pso/.
  47. J. J. Liang, P. N. Suganthan, and K. Deb, “Novel composition test functions for numerical global optimization,” in Proceedings of IEEE Swarm Intelligence Symposium (SIS '05), pp. 71–78, Pasadena, Calif, USA, June 2005. View at Publisher · View at Google Scholar
  48. M. Clerc, Discrete Particle Swarm Optimization, New Optimization Techniques in Engineering, Springer, New York, NY, USA, 2004.