Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Multi-objective particle swarm-differential evolution algorithm

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

A multi-objective particle swarm-differential evolution algorithm (MOPSDE) is proposed that combined a particle swarm optimization (PSO) with a differential evolution (DE). During consecutive generations, a scale factor is produced by using a proposed mechanism based on the simulated annealing method and is applied to dynamically adjust the percentage of use of PSO and DE. In addition, the mutation operation of DE is improved, to satisfy that the proposed algorithm has different mutation operation in different searching stage. As a result, the capability of the local searching is enhanced and the prematurity of the population is restrained. The effectiveness of the proposed method has been validated through comprehensive tests using benchmark test functions. The numerical results obtained by this algorithm are compared with those obtained by the improved non-dominated sorting genetic algorithm (NSGA-II) and the other algorithms mentioned in the literature. The results show the effectiveness of the proposed MOPSDE algorithm.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Horn J, Nafpliotis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multi-objective optimization. In: Proceedings of the first IEEE conference on evolutionary computation. IEEE, Piscataway, pp 82–87

  2. Srinivas N, Deb K (1994) Multi-objective function optimization using non-dominated sorting genetic algorithms. Evol Comput 2(3):221–248

    Article  Google Scholar 

  3. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  4. Zitzler E, Thiele L (1999) Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257–271

    Article  Google Scholar 

  5. Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Proceedings of the EUROGEN 2001-evolutionary method for design: optimization and control for industrial problem, K.C. Giannakoglou, Ed., pp 95–100

  6. Knowles J, Corne D (1999) The Pareto archived evolutionary strategy: a new baseline algorithm for multi-objective optimization. In: Proceedings of the conference on evolutionary computation. IEEE Press, Piscataway, NJ, pp 98–105

  7. Coello Coello CA, Lechuga MS et al (2002) MOPSO: a proposal for multiple objective particle swarm optimization. In: Proceedings of the IEEE international conference on evolutionary computation. New Jersey, pp 1051–1056

  8. Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the IEEE Intentional joint conference on neural networks. IEEE Press, pp 1942–1948

  9. Coello Coello CA, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE Trans Evol Comput 8(3):256–279

    Article  Google Scholar 

  10. Joshua TK, David JS, Matthew DC (2014) Testing of a spreading mechanism to promote diversity in multi-objective particle swarm optimization. Optim Eng 16(2):279–302

    Google Scholar 

  11. Hu X, Eberhart RC (2002) Multi-objective optimization using dynamic neighborhood particle swarm optimization. In: IEEE congress on evolutionary computation (CEC 2002). Honolulu. Hawaii, USA, pp 1677–1681

  12. Hernández-Domínguez JS, Toscano-Pulido G, Coello Coello AC (2012) A multi-objective particle swarm optimizer enhanced with a differential evolution scheme. Artif Evol. Springer, Berlin, Heidelberg, pp 169–180

    Chapter  Google Scholar 

  13. Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–359

    Article  MathSciNet  MATH  Google Scholar 

  14. Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester

    MATH  Google Scholar 

  15. Wu LH, Wang YN, Chen ZL (2007) Modified differential evolution algorithm for mixed-integer non-linear programming problems. J Chin Comput Syst 28(4):666–669

    Google Scholar 

  16. Hao ZF, Guo GH, Huang H (2007) A particle swarm optimization algorithm with differential evolution. IEEE Int Conf Syst Mach Learn Cybernet 2:1031–1035

    Article  Google Scholar 

  17. Wang XS, Hao ML, Cheng YH, Lei RH (2009) PDE-PEDA: a new Pareto-based multi-objective optimization algorithm. J Univ Comput Sci 15(4):722–741

    MathSciNet  MATH  Google Scholar 

  18. Van Veldhuizen DA and Lamont GB (1998) evolutionary computation and convergence to a Pareto Front. In: Late breaking papers at the genetic programming 1998 conference. Stanford University, pp 221–228

  19. Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Lect Notes Comput Sci 1917:849–858

    Article  Google Scholar 

  20. Bazaraa MS, Sherali HD, Shetty CM (1979) Nonlinear programming, theory and algorithm[m]. Academic Press, New York

    MATH  Google Scholar 

  21. Coello Coello CA, Lamont GB, Van Veldhuizen DA (2007) Evolutionary algorithms for solving multi-objective problems. Springer Science & Business Media, Berlin, Heidelberg, New York

    MATH  Google Scholar 

Download references

Acknowledgments

The work is supported by the Natural Science Foundation of Hubei Province, China (#2015cfb586).

Author information

Authors and Affiliations

  1. School of Automation, Wuhan University of Technology, Wuhan, 430070, China

    Yi-xin Su & Rui Chi

Authors
  1. Yi-xin Su
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rui Chi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Yi-xin Su or Rui Chi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Su, Yx., Chi, R. Multi-objective particle swarm-differential evolution algorithm. Neural Comput & Applic 28, 407–418 (2017). https://doi.org/10.1007/s00521-015-2073-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-015-2073-y

Keywords

Search

Navigation