Skip to main content
Log in

A multi-objective artificial physics optimization algorithm based on ranks of individuals

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper proposes a multi-objective artificial physics optimization algorithm based on individuals’ ranks. Using a Pareto sorting based technique and incorporating the concept of neighborhood crowding degree, evolutionary individuals in the search space are evaluated at first. Then each individual is assigned a unique serial number in terms of its performance, which affects the mass of the individual. Thereby, the population evolves towards the direction of the Pareto-optimal front. Synchronously, the presented approach has good diversity, such that the population is spread evenly on the Pareto front. Results of simulation on a number of difficult test problems show that the proposed algorithm, with less evolutionary generations, is able to find a better spread of solutions and better convergence near the true Pareto-optimal front compared to classical multi-objective evolutionary algorithms (NSGA, SPEA, MOPSO) and to simple multi-objective artificial physics optimization algorithm.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Abido MA (2007) Two level of nondominated solutions approach to multi-objective particle swarm optimization. In: Thierens D, Beyer HG, Bongard J, Branke J, Clark JA, Cliff D, Congdon CB, Deb K (eds) Proceedings of the genetic and evolutionary computation conference, GECCO 2007. ACM Press, New York, pp 726–733

    Chapter  Google Scholar 

  • Coello CAC, Lechuga MS (2002) MOPSO: a proposal for multiple objective particle swarm optimization. Congress on Evolutionary Computation (CEC’2002), Vol 2, pp 1051–1056, IEEE Service Center, Piscataway

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

    Article  Google Scholar 

  • Corne DW, Knowles JD, Oates MJ (2000) The Pareto envelope-based selection algorithm for multi-objective optimization. Proceedings of the Parallel Problem Solving from Nature VI Conference, pp 839–848. Springer

  • Deb K, Pratap A, Agarwal S, Meyarivan T (2000) A fast and elitist multi-objective genetic algorithm: NSGA-II. Parallel problem solving from nature (PPSN VI). pp 849–858, Springer

  • Durillo JJ, García-Nieto J, Nebro AJ, Coello CAC, Luna F, Alba E (2009) Multi-objective particle swarm optimizers: an experimental comparison. Evolutionary multi-criterion optimization. 5th International Conference, EMO 2009, pp 495–509, Springer. Lecture Notes in Computer Science, vol 5467, Nantes, April 2009

  • Fernández E, López E, Bernal S, Coello CAC (2010) Evolutionary multiobjective optimization using an outranking-based dominance generalization. Comput Oper Res 37(2):390–395

    Article  MATH  Google Scholar 

  • Fieldsend JE, Singh S (2002) A multi-objective algorithm based upon particle swarm optimization, an efficient data structure and turbulence. Proceedings of the UK workshop on computational intelligence. Birmingham, pp 37–44

  • Fonseca CM, Fleming PJ (1993) Genetic algorithms for multi-objective optimization: formulation, discussion and generalization. Presented at Proceedings of the 5th International Conference on Genetic Algorithms, San Mateo

  • Garza Fabre M, Toscano Pulido G, Coello CAC (2009) Ranking methods for many-objective problems. MICAI 2009: advances in artificial intelligence. 8th Mexican International Conference on Artificial Intelligence, pp 633–645, Springer, Lecture Notes in Artificial Intelligence, vol 5845, Guanajuato

  • Garza Fabre M, Toscano Pulido G, Coello CAC (2010) Two novel approaches for many-objective optimization. 2010 IEEE congress on evolutionary computation (CEC’2010), pp 4480–4487, IEEE Press, Barcelona

  • Horn J, Nafpliotis N, Goldberg DE (1994) A niched pareto genetic algorithm for multi-objective optimization. IEEE World Congress on Computational Computation, Piscataway

  • Hu X, Eberhart RC (2002) Multiobjective optimization using dynamic neighborhood particle swarm optimization. Proceedings of IEEE congress on evolutionary computation (CEC2002). Honolulu

  • Knowles JD, Corne DW (1999) The Pareto archived evolution strategy: a new baseline algorithm for pareto multi-objective optimization. Congress on Evolutionary Computation (CEC99) Piscataway

  • López A, Aguirre H, Tanaka K, Coello CAC (2010) Objective space partitioning using conflict information for many-objective optimization. Parallel problem solving from nature–PPSN XI, 11th International Conference, Part I, pp 657–666, Springer, Lecture Notes in Computer Science, vol 6238, Krakow

  • Martínez SZ, Coello CAC (2010) An archive strategy based on the convex hull of individual minima for MOEAs. 2010 IEEE Congress on Evolutionary Computation (CEC’2010), pp 912–919, IEEE Press, Barcelona

  • Molina J, Santana LV, Hernández-Díaz AG, Coello CAC, Caballero R (2009) g-dominance: reference point based dominance for multi-objective metaheuristics. Eur J Oper Res 197(2):685–692

    Article  MATH  Google Scholar 

  • Nebro AJ, Durillo JJ, Garcia-Nieto J, Coello CAC, Luna F, Alba E (2009) SMPSO: a new PSO-based metaheuristic for multi-objective optimization. IEEE symposium on computational intelligence in multicriteria decision-making, pp 66–73, IEEE Press, Nashville, March 30–April 2, 2009

  • Nedjah N, dos Santos Coelho L, de Macedo de Mourelle L (2010) Multi-objective swarm intelligent systems. Theory Exp, pp 83–104, Springer, Berlin

  • Santana-Quintero LV, Ramírez-Santiago N, Coello CAC, Molina Luque J, García Hernández-Díaz A (2006) A new proposal for multiobjective optimization using particle swarm optimization and rough sets theory. Parallel Problem Solving from Nature (PPSN IX). 9th International Conference, Springer, pp 483–492, Lecture Notes in Computer Science, vol 4193, Reykjavik, September 2006

  • Sierra MR, Coello CAC (2005) Improving PSO-based multi-objective optimization using crowding, mutation and ε-dominance. In: Coello CAC, Aguirre AH, Zitzler E (eds) Proceedings of the 3rd international conference on evolutionary multi-criterion optimization EMO 2005. Springer, Berlin, pp 505–519

    Chapter  Google Scholar 

  • Spears WM, Spears DF, Kerr W et al (2005) An overview of Physicomimetics’. Lecture Notes in Computer Science-State of the Art Series 3342:84–97

    Article  Google Scholar 

  • Srinivas N, Deb K (1994) Multi-objective optimization using nondominated sorting in genetic algorithms. Evol Comput 2:221–248

    Article  Google Scholar 

  • Toscano-Pulido G, Coello CAC, Santana-Quintero LV (2007) EMOPSO: A multi-objective particle swarm optimizer with emphasis on efficiency. Evolutionary multi-criterion optimization, 4th International Conference, EMO 2007, pp 272–285, Springer. Lecture Notes in Computer Science, vol. 4403, Matshushima

  • Wang Y, Zeng JC (2010) A multi-objective optimization algorithm based on artificial physics optimization. Control Decis 25(7):1040–1044

    Google Scholar 

  • Wang Y, Zeng JC, Tan Y (2010) A multi-objective artificial physics optimization algorithm based on virtual force sorting. International Conference on Swarm, Evolutionary and Memetic Computing (SEMCCO 2010), pp. 615–622, Springer LNCS 6466, Chennai, Dec 16–18, 2010

  • Wang Y, Zeng JC, Cui ZH, He XJ (2011) A novel constraint multi-objective artificial physics optimization algorithm and its convergence. Int J Innov Comput Appl 3(2):61–70

    Article  Google Scholar 

  • Xie LP, Zeng JC (2009) A global optimization based on physicomimetics framework. The 2009 World Summit on Genetic and Evolutionary Computation (GEC’09), Shanghai

  • Xie LP, Zeng JC, Cui ZH (2009) Using artificial physics to solve global optimization problems. The 8th IEEE international conference on cognitive informatics (ICCI 2009), Hong Kong

  • Xie LP, Zeng JC (2010) The performance analysis of artificial physics optimization algorithm driven by different virtual force. ICIC Express Lett (ICIC-EL) 4(1):239-244

    Google Scholar 

  • Xie LP, Zeng JC, Cui ZH (2010) On mass effects to artificial physics optimization algorithm for global optimization problems. Int J Innov Comput Appl 2(2):69–76

    Google Scholar 

  • Yang JJ, Zhou JZ, Fang RC et al (2008) Multi-objective particle swarm optimization based on adaptive grid algorithms. J Syst Simul 20(21):5843–5847

    Google Scholar 

  • Zeng JC, Jie J, Cui ZH (2004) Particle swarm optimization. Science Press, Beijing

    Google Scholar 

  • Zilter E, Laumanns M (2008) Test problems and test data for multiobjective optimizers [EB/OL] (30 Jun 2008) http://www.tik.ee.ethz.ch/sop/download/supplementary/testProblemSuite/

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

    Article  Google Scholar 

  • Zitzler E, Thiele L (2002) SPEA2: Improving the strength Pareto evolutionary algorithm for multi-objective optimization. EUROGEN 2001-evolutionary methods for design, optimization and control with applications to industrial problems, pp 95–100, Athens

Download references

Acknowledgments

The authors gratefully acknowledge the comments from the anonymous reviewers, which greatly helped them to improve the contents of this paper. The authors acknowledge support from the fund of the scholarship to pursue graduated studies in Taiyuan University of Science and Technology and the project number is 20122030.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yan Wang.

Additional information

Communicated by A-A. Tantar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Y., Zeng, Jc. A multi-objective artificial physics optimization algorithm based on ranks of individuals. Soft Comput 17, 939–952 (2013). https://doi.org/10.1007/s00500-012-0969-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-012-0969-3

Keywords

Navigation