Skip to main content
Log in

Optimization algorithm based on kinetic-molecular theory

  • Published:
Journal of Central South University Aims and scope Submit manuscript

Abstract

Traditionally, the optimization algorithm based on physics principles has some shortcomings such as low population diversity and susceptibility to local extrema. A new optimization algorithm based on kinetic-molecular theory (KMTOA) is proposed. In the KMTOA three operators are designed: attraction, repulsion and wave. The attraction operator simulates the molecular attraction, with the molecules moving towards the optimal ones, which makes possible the optimization. The repulsion operator simulates the molecular repulsion, with the molecules diverging from the optimal ones. The wave operator simulates the thermal molecules moving irregularly, which enlarges the searching spaces and increases the population diversity and global searching ability. Experimental results indicate that KMTOA prevails over other algorithms in the robustness, solution quality, population diversity and convergence speed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. HOLLAND J H. Adaptation in natural and artificial systems [M]. Ann Arbor, MI: University of Michigan Press, 1975, 1–17.

    Google Scholar 

  2. MEZURA-MONTES E, COELLO C A. A simple multimembered evolution strategy to solve constrained optimization problems [J]. IEEE Transactions on Evolutionary Computation, 2005, 9(1): 1–17.

    Article  Google Scholar 

  3. MA Gang, ZHOU Wei, CHANG Xiao-lin. A novel particle swarm optimization algorithm based on particle migration [J]. Applied Mathematics and Computation, 2012, 218(11): 6620–6626.

    Article  MATH  MathSciNet  Google Scholar 

  4. ZHU Guo-pu, KWONG S. Gbest-guided artificial bee colony algorithm for numerical function optimization [J]. Applied Mathematics and Computation, 2010, 217(7): 3166–3173.

    Article  MATH  MathSciNet  Google Scholar 

  5. WU Bin, QIAN Cun-hua, NI Wei-hong, FAN Shu-hai. The improvement of glowworm swarm optimization for continuous optimization problems [J]. Expert Systems with Applications, 2012, 39(7): 6335–6342.

    Article  Google Scholar 

  6. FORMATO R A. Central force optimization: A new deterministic gradient-like optimization metaheuristic [J]. OPSEARCH, 2009, 46(1): 25–51.

    Article  MATH  MathSciNet  Google Scholar 

  7. RASHEDI E, NEZAMABADI-POUR H, SARYAZDI S. GSA: A gravitational search algorithm [J]. Information Sciences, 2009, 179(13): 2232–2248.

    Article  MATH  Google Scholar 

  8. XIE Li-ping, ZENG Jian-chao, CUI Zhi-hua. General framework of artificial physics optimization algorithm [C]// World Congress on Nature & Biologically Inspired Computing. Coimbatore, 2009: 1321–1326.

    Google Scholar 

  9. BIRBIL S L, FANG S C. An electromagnetism-like mechanism for global optimization [J]. Journal of Global Optimization, 2003, 25(3): 263–282.

    Article  MATH  MathSciNet  Google Scholar 

  10. XU Xing, Li Yuan-xiang, JIANG Da-zhi, TANG Ming-duan, FANG Shen-lin. Improved particle swarm optimization algorithm based on theory of molecular motion [J]. Journal of System Simulation, 2009, 21(7): 1904–1907. (in Chinese)

    Google Scholar 

  11. HAN Xu-ming, ZUO Wan-li, WANG Li-ming, SHI Xiao-hu. Atmospheric quality assessment model based on immune algorithm optimization and its applications [J]. Journal of Computer Research and Development, 2011, 48(7): 1307–1313. (in Chinese)

    Google Scholar 

  12. DEB K, PRATAP A, AGARWAL S, MEYARIVAN T. A Fast and elitist multiobjective genetic algorithm: NSGA-II [J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182–197.

    Article  Google Scholar 

  13. HONG Lu, MU Zhi-chun. A new clonal selection adjustment algorithm [J]. Information and Control, 2007, 36(4): 476–485. (in Chinese)

    Google Scholar 

  14. NICKABADI A, EBADZADEH M M, SAFABAKHSH R. A novel particle swarm optimization algorithm with adaptive inertia weight [J]. Applied Soft Computing, 2011, 11(4): 3658–3670.

    Article  Google Scholar 

  15. ZHOU Da-wei, GAO Xiang, LIU Guo-hai, MEI Cong-li, JIANG Dong, LIU Ying. Randomization in particle swarm optimization for global search ability [J]. Expert Systems with Applications, 2011, 38(12): 15356–15364.

    Article  Google Scholar 

  16. VOGLIS C, PARSOPOULOS K E, PAPAGEORGIOU D G, LAGARIS I E, VRAHATIS M N. MEMPSODE: A global optimization software based on hybridization of population-based algorithms and local searches [J]. Computer Physics Communications, 2012, 183(5): 1139–1154.

    Article  Google Scholar 

  17. RIGET J, VESTERSTROM J S. A diversity-guided particle swarm optimizer-the ARPSO [R]. EVAlife: Department of Computer Science, University of Aarhus, Denmark, 2002, 1–13.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ying-jie Zhang  (张英杰).

Additional information

Foundation item: Project(61174140) supported by the National Natural Science Foundation of China; Project(13JJA002) supported by Hunan Provincial Natural Science Foundation, China; Project(20110161110035) supported by the Doctoral Fund of Ministry of Education of China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fan, Cd., Ouyang, Hl., Zhang, Yj. et al. Optimization algorithm based on kinetic-molecular theory. J. Cent. South Univ. 20, 3504–3512 (2013). https://doi.org/10.1007/s11771-013-1875-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-013-1875-2

Key words

Navigation