Skip to main content
SpringerLink
Log in

Particle swarm optimization with mutation operations controlled by landscape modality estimation using hill-valley detection

  • Special Feature: Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

Particle swarm optimization (PSO) is one of swarm intelligence algorithms and has been used to solve various optimization problems. Since the performance of PSO is much affected by the algorithm parameters of PSO, studies on adaptive control of the parameters have been done. Adaptive PSO (APSO) is one of representative studies. Parameters are controlled according to the evolutionary state, where the state is estimated by distance relations among a best search point and other search points. Also, a global Gaussian mutation operation is introduced to escape from local optima. In this study, a new adaptive control based on landscape modality estimation using hill-valley detection is proposed. A proximity graph is created from search points, hills and valleys are detected in the graph, landscape modality of an objective function is identified as unimodal or multimodal. Parameters are adaptively controlled as: parameters for convergence are selected in unimodal landscape and parameters for divergence are selected in multimodal landscape. Also, two mutation operations are introduced according to the modality. In unimodal landscape, a new local mutation operation is applied to the worst hill point which will be moved toward the best point for convergence. In multimodal landscape, a new adaptive global mutation operation is applied to all hill points for escaping from local optima. The advantage of the proposed method is shown by comparing the results of the method with those by PSO with fixed parameters and APSO.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, Perth, Australia, pp 1942–1948

  2. Kennedy J, Eberhart RC (2001) Swarm intelligence. Morgan Kaufmann, San Francisco

    Google Scholar 

  3. AlRashidi M, El-Hawary M (2009) A survey of particle swarm optimization applications in electric power systems. IEEE Trans Evolut Comput 13(4):913–918

    Article  Google Scholar 

  4. Kulkarni R, Venayagamoorthy G (2011) Particle swarm optimization in wireless-sensor networks: a brief survey. IEEE Trans Syst Man Cybern Part C Appl Rev 41(2):262–267

    Article  Google Scholar 

  5. Zhang Y, Wang S, Ji G (2015) A comprehensive survey on particle swarm optimization algorithm and its applications. Math Probl Eng 2015(1):1–38. doi: 10.1155/2015/931256

    Google Scholar 

  6. Zhan ZH, Zhang J, Li Y, Chung HSH (2009) Adaptive particle swarm optimization. IEEE Trans Syst Man Cybern Part B Cybern 39(6):1362–1381

    Article  Google Scholar 

  7. Takahama T, Sakai S (2012) Differential evolution with dynamic strategy and parameter selection by detecting landscape modality. In: Proceedings of the 2012 IEEE Congress on evolutionary computation, pp 2114–2121

  8. Shi Y, Eberhart R (1999) Empirical study of particle swarm optimization. In: Proceedings of the 1999 Congress on evolutionary computation, pp 1945–1950

  9. Clerc M, Kennedy J (2002) The particle swarm–explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evolut Comput 6(1):58–73

    Article  Google Scholar 

  10. Eberhart R, Shi Y (2000) Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the 2000 Congress on evolutionary computation, pp 84–88

  11. Takahama T, Sakai S (2012) Efficient constrained optimization by the \(\varepsilon\) constrained rank-based differential evolution. In: Proceedings of the 2012 IEEE Congress on evolutionary computation, pp 62–69

  12. Riget J, Vesterstrøm JS (2002) A diversity-guided particle swarm optimizer-the ARPSO. Technical Report. EVAlife 2002-02, Department of Computer Science, University of Aarhus, Denmark

  13. Pant M, Radha T, Singh V (2007) A simple diversity guided particle swarm optimization. In: Proceedings of the 2007 IEEE Congress on evolutionary computation, pp 3294–3299. doi:10.1109/CEC.2007.4424896

  14. Takahama T, Sakai S (2014) Selecting strategies in particle swarm optimization by sampling-based landscape modality detection. In: Proceedings of the 2014 international conference on parallel and distributed processing techniques and applications, pp 215–221

  15. Takahama T, Sakai S (2014) Selecting strategies in particle swarm optimization by sampling-based landscape modality detection using inner products. In: Proceedings of the SICE annual conference 2014, pp 1561–1566

  16. Hu M, Wu T, Weir J (2013) An adaptive particle swarm optimization with multiple adaptive methods. IEEE Trans Evolut Comput 17(5):705–720

    Article  Google Scholar 

  17. Hu M, Wu T, Weir JD (2012) An intelligent augmentation of particle swarm optimization with multiple adaptive methods. Inf Sci 213:68–83

    Article  Google Scholar 

  18. Li C, Yang S (2009) An adaptive learning particle swarm optimizer for function optimization. In: Proceedings of the 2009 IEEE Congress on evolutionary computation, pp 381–388

  19. Li C, Yang S, Nguyen TT (2012) A self-learning particle swarm optimizer for global optimization problems. IEEE Trans Syst Man Cybern Part B Cybern 42(3):627–646

    Article  Google Scholar 

  20. Sakai S, Takahama T (2014) A comparative study on estimation methods of landscape modality for evolutionary algorithms. In: Kitahara M, Czerkawski C (eds) Legal informatics, economic science and mathematical research. Kyushu University Press, pp 55–80

  21. Takahashi R, Yata N, Nagao T (2011) A searching algorithm using features of a solution space and self-organizing maps. Trans Inst Electr Eng Jpn C 131(2):433–441 (in Japanese)

    Google Scholar 

  22. Sakai S, Takahama T (2012) A comparative study on neighborhood structures for speciation in species-based differential evolution. In: Kitahara M, Czerkawski C (eds) Social systems solutions applied by economic sciences and mathematical solutions. Kyushu University Press, Fukuoka, pp 111–135

    Google Scholar 

  23. Takahama T, Sakai S (2012) Differential evolution with graph-based speciation by competitive Hebbian rules. In: Proceedings of the sixth international conference on genetic and evolutionary computing (ICGEC2012), pp 445–448

  24. Gabriel KR, Sokal RR (1969) A new statistical approach to geographic variation analysis. Syst Zool 18:259–270

    Article  Google Scholar 

  25. Toussaint GT (1980) The relative neighborhood graph of a finite planar set. Pattern Recognit 12(4):261–268

    Article  MathSciNet  MATH  Google Scholar 

  26. Kirkpatrick DG, Radke JD (1985) A framework for computational morphology. In: Toussaint G (ed) Computational geometry, North-Holland, pp 217–248

  27. Chakraborty UK (ed) (2008) Advances in differential evolution. Springer, Berlin

    MATH  Google Scholar 

  28. Shang YW, Qiu YH (2006) A note on the extended Rosenbrock function. Evolut Comput 14(1):119–126

    Article  Google Scholar 

  29. Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evolut Comput 3:82–102

    Article  Google Scholar 

  30. Mendes R, Kennedy J, Neves J (2004) The fully informed particle swarm: simpler, maybe better. IEEE Trans Evolut Comput 8(3):204–210

    Article  Google Scholar 

  31. Ratnaweera A, Halgamuge S, Watson H (2004) Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans Evolut Comput 8(3):240–255

    Article  Google Scholar 

  32. Liang J, Suganthan P (2005) Dynamic multi-swarm particle swarm optimizer. In: Proceedings of the IEEE swarm intelligence symposium, pp 124–129

  33. Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evolut Comput 10(3):281–295

    Article  Google Scholar 

Download references

Acknowledgments

This research is supported in part by Grant-in-Aid for Scientific Research (C) (No. 24500177, 26350443) of Japan society for the promotion of science.

Author information

Authors and Affiliations

  1. Hiroshima City University, Hiroshima, Japan

    Tetsuyuki Takahama, Jun-ichi Kushida & Akira Hara

  2. Hiroshima Shudo University, Hiroshima, Japan

    Setsuko Sakai

Authors
  1. Tetsuyuki Takahama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Setsuko Sakai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jun-ichi Kushida
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Akira Hara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tetsuyuki Takahama.

Additional information

This work was presented in part at the 1st International Symposium on Swarm Behavior and Bio-Inspired Robotics, Kyoto, Japan, October 28–30, 2015.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Takahama, T., Sakai, S., Kushida, Ji. et al. Particle swarm optimization with mutation operations controlled by landscape modality estimation using hill-valley detection. Artif Life Robotics 21, 423–433 (2016). https://doi.org/10.1007/s10015-016-0299-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-016-0299-0

Keywords

Search

Navigation