Some massively parallel algorithms from nature

  • Li Yan
  • Kang Li-shan
  • Chen Yu-ping
  • Liu Pu
  • Cao Hong-qing
  • Pan Zheng-jun


We introduced the work on parallel problem solvers from physics and biology being developed by the research team at the State Key Laboratory of Software Engineering, Wuhan University. Results on parallel solvers include the following areas: Evolutionary algorithms based on imitating the evolution processes of nature for parallel problem solving, especially for parallel optimization and model-building; Asynchronous parallel algorithms based on domain decomposition which are inspired by physical analogies such as elastic relaxation process and annealing process, for scientific computations, especially for solving nonlinear mathematical physics problems. All these algorithms have the following common characteristics: inherent parallelism, self-adaptation and self-organization, because the basic ideas of these solvers are from imitating the natural evolutionary processes.

Key words

evolutionary computation parallel algorithm imitating nature domain decomposition knowledge discovery in databases 

CLC number

TP 301 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Southwell R V.Relaxation Methods in Theoretical Physics. Oxford Oxford, University Press, 1946.Google Scholar
  2. [2]
    Birkhoff G, Lynch R E.Numerical Solution of Elliptic Problems. Phitadelphia, SIAM: 1984, 124–126.MATHGoogle Scholar
  3. [3]
    Evans D J, Kang Li-shan, Shao Jian-ping,et al. The Convergencerate of the Schwarz Alternating Procedure (I)-for One-Dimensional Problems.Intern J Computer Math, 1986,20: 325–339.CrossRefGoogle Scholar
  4. [4]
    Evans D J, Kang Li-shan, Chen Yu-ping,et al. The Convergence Rate of the Schwarz Alternating Procedure (IV)- With Pseudo-Boundary Relaxation Factor.Intern J Computer Math, 1987,21: 185–203.MATHCrossRefGoogle Scholar
  5. [5]
    Kang Li-shan, Evans D J. The Convergence Rate of the Schwarz Alternating Procedure (III)-for Neumann Problems.Intern J Computer Math, 1987,21: 85–108.CrossRefGoogle Scholar
  6. [6]
    Evans D J, Shao Jian-ping, Kang Li-shan,et al. The Convergence Rate of the Schwarz Alternating Procedure (II)-for Two-Dimensional Problems.Intern J Computer Math, 1986,20: 157–170.MATHCrossRefGoogle Scholar
  7. [7]
    Kang Li-shan, Evans D J. The Convergence Rate of the Schwarz Alternating Procedure (V)—for More Than Two Subdomains.Intern J Computer Math, 1988,23: 295–313.CrossRefGoogle Scholar
  8. [8]
    Shao Jian-ping, Kang Li-shan, Chen Yu-ping,et al. The Convergence Rate of the Schwarz Alternating Procedure (VI)-for Unsymmetric Problems.Intern J Computer Math, 1988,25: 139–152.CrossRefGoogle Scholar
  9. [9]
    Liu Yu-hui, Kang Li-shan, Evans D J. The Convergence Rate of the Schwarz Alternating Procedure (VII)-for the Sum of Two Disks.Intern J Computer Math, 1989,27: 55–65.CrossRefGoogle Scholar
  10. [10]
    Kang Li-shan.Parallel Algorithms and Domain Decomposition. Wuhan: Wuhan University Press, 1987 (Ch).Google Scholar
  11. [11]
    Durbin R, Willshaw D. An Analogue Approach to the Travelling Salesman Problem Using an Elastic Net Method.Nature, 1987,326: 689–691.CrossRefGoogle Scholar
  12. [12]
    Kang Li-shan, Xie Yun, You Shi-yong,et al. Non-Numerical Parallel Algorithms: (I) Simulated Annealing. Beijing: China Academic Publisher, 1994 (Ch).Google Scholar
  13. [13]
    Kang Li-shan, Macleod I, Chen Lu-juan,et al. Evolutionary Computation Algorithms for Solving Traveling Salesman Problems, Intelligent Computer Theory’94. Beijing: Qinghua University Press, 1994, 23–35 (Ch).Google Scholar
  14. [14]
    Liu Yong, Kang Li-shan, Evans D J. The Annealing Evolution Algorithm as Function Optimizer.Parallel Computing, 1995,21: 389–400.MATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    He Jun, Kang Li-shan, Chen Yong-jun. Convergence of Genetic Evolution Algorithms for Optimization.Parallel Algorithms and Applications, 1995,5: 37–56.MATHGoogle Scholar
  16. [16]
    He Jun, Kang Li-shan. The Convergence Rate of Genetic Algorithms.Theoretical Computer Science, 1999,229(1): 23–39.CrossRefMathSciNetGoogle Scholar
  17. [17]
    Kang Li-shan, Li Yan, Kang Zhuo,et al. Asynchronous Parallel Evolutionary Algorithms for Optimizations.Proceedings of 2001 International Symposium on Distributed Computing and Application to Business, Engineering and Science. Wuhan: Hubei Science and Technology Press, 2001, 1–4 (Ch).Google Scholar
  18. [18]
    Kang Li-shan, Kang Zhuo, Li Yan,et al. Asynchronous Parallelization of Guo’s Algorithm for Function Optimization.Procedings of Evolutionary Computation Congress, July 16–19, 2000, Pisataway NJ: IEEE Press, 783–789.Google Scholar
  19. [19]
    Michalewicz Z, Esguvel S. The Spirit of Evolutionary Algorithms.Journal of Computing and Information Technology, 1999,7: 1–18.Google Scholar
  20. [20]
    Pan Zheng-jun, Kang Li-shan, He Jun,et al. An Evolutionary Approach to Adaptive Model-Building, In: X. Yao ed.Progress in Evolutionary Computation, Lecture Notes in Artificial Intelligence. Berlin: Springer-Verlag, 1995,956: 236–244.Google Scholar
  21. [21]
    Cao Hong-qing, Kang Li-shan, Michalewicz Z,et al. A Two-Level Evolutionary Algorithm for Modeling System of Ordinary Differential Equations. In: David E, Iba, Hitoshi, et al (editors),Genetic Programming 1998:Proceedings of the Third Annual Conference. University of Wisconsin, Madison: Morgan Kaufmann Publishers, 17–22, 1998.Google Scholar
  22. [22]
    Cao Hong-qing, Kang Li-shan, Chen Yu-ping. Evolutionary Modeling of Systems of Ordinary Differential Equations with Genetic Programming.Genetic Programming and Evolvable Machines, 2000,1(4): 309–337.CrossRefGoogle Scholar

Copyright information

© Springer 2002

Authors and Affiliations

  • Li Yan
    • 1
  • Kang Li-shan
    • 1
  • Chen Yu-ping
    • 1
  • Liu Pu
    • 1
  • Cao Hong-qing
    • 1
  • Pan Zheng-jun
    • 1
  1. 1.The State Key Laboratory of Software EngineeringWuhan UniversityWuhan, HubeiChina

Personalised recommendations