Skip to main content
Log in

A parallel naive approach for non-dominated sorting: a theoretical study considering PRAM CREW model

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

Abstract

Pareto-based multi-objective evolutionary algorithms use non-dominated sorting as an intermediate step. These algorithms are easy to parallelize as various steps of these algorithms are independent of each other. Researchers have focused on the parallelization of non-dominated sorting in order to reduce the execution time of these algorithms. In this paper, we focus on one of the initial approaches for non-dominated sorting also known as naive approach, proposed by Srinivas et al. and explore the scope of parallelism in this approach. Parallelism is explored in the considered approach in three different ways considering Parallel Random Access Machine, Concurrent Read Exclusive Write model. The time and space complexities of three different parallel versions are also analyzed. Analysis of parallel algorithms is usually carried out under the assumption that an unbounded number of processors are available. Thus, the same assumption has been considered in our analysis too and we have obtained the maximum number of processors required for three parallel versions.

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.

Institutional subscriptions

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

Similar content being viewed by others

Notes

  1. https://github.com/Proteek/Best-Order-Sort/.

References

  • Bao C, Xu L, Goodman ED, Cao L (2017) A novel non-dominated sorting algorithm for evolutionary multi-objective optimization. J Comput Sci 23:31–43

    Article  MathSciNet  Google Scholar 

  • Buzdalov M, Shalyto A (2014) A provably asymptotically fast version of the generalized Jensen Algorithm for non-dominated sorting. In: 13th International Conference Parallel Problem Solving from Nature—PPSN XIII, Springer. Lecture Notes in Computer Science vol 8672, Ljubljana, Slovenia, pp 528–537

  • Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577–601

    Article  Google Scholar 

  • Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGAII. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  • Drozdik M, Akimoto Y, Aguirre H, Tanaka K (2015) Computational cost reduction of nondominated sorting using the M-Front. IEEE Trans Evol Comput 19(5):659–678

    Article  Google Scholar 

  • Fang H, Wang Q, Tu YC, Horstemeyer MF (2008) An efficient non-dominated sorting method for evolutionary algorithms. Evol Comput 16(3):355–384

    Article  Google Scholar 

  • Fortin FA, Greiner S, Parizeau M (2013) Generalizing the improved run-time complexity algorithm for non-dominated sorting. In: 2013 genetic and evolutionary computation conference (GECCO’2013), ACM Press, New York, USA, pp 615–622, ISBN: 978-1-4503-1963-8

  • Gupta S, Tan G (2015) A scalable parallel implementation of evolutionary algorithms for multi-objective optimization on GPUs. In: 2015 IEEE congress on evolutionary computation (CEC’2015), IEEE Press, Sendai, Japan, pp 1567–1574, ISBN: 978-1-4799-7492-4

  • Gustavsson P, Syberfeldt A (2018) A new algorithm using the non-dominated tree to improve non-dominated sorting. Evol Comput 26(1):89–116

    Article  Google Scholar 

  • JáJá J (1992) An introduction to parallel algorithms, vol 17. Addison-Wesley, Boston

    MATH  Google Scholar 

  • Jensen MT (2003) Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans Evol Comput 7(5):503–515

    Article  Google Scholar 

  • Kim K, Smith RL (2004) Parallel multiobjective evolutionary algorithms for waste solvent recycling. Ind Eng Chem Res 43(11):2669–2679

    Article  Google Scholar 

  • Kumar V, Grama A, Gupta A, Karypis G (1994) Introduction to parallel computing: design and analysis of algorithms, vol 400. Benjamin/Cummings, Redwood City

    MATH  Google Scholar 

  • Li K, Deb K, Zhang Q, Zhang Q (2017) Efficient nondomination level update method for steady-state evolutionary multiobjective optimization. IEEE Trans Cybern 47(9):2838–2849

    Article  Google Scholar 

  • Luna F, Alba E (2015) Parallel multiobjective evolutionary algorithms. In: Springer handbook of computational intelligence, Springer, pp 1017–1031

  • Maulik U, Sarkar A (2010) Evolutionary rough parallel multi-objective optimization algorithm. Fundamenta Informaticae 99(1):13–27

    Article  MathSciNet  MATH  Google Scholar 

  • McClymont K, Keedwell E (2012) Deductive sort and climbing sort: new methods for non-dominated sorting. Evol Comput 20(1):1–26

    Article  Google Scholar 

  • Mikloško J, Kotov VE (1984) Algorithms, software and hardware of parallel computers. Springer, Berlin

    Book  MATH  Google Scholar 

  • Mishra S, Coello CA (2018) P-ENS: Parallelism in efficient non-dominated sorting. In: 2018 IEEE congress on evolutionary computation (CEC’2018), IEEE Press, Rio de Janeiro, Brazil, pp 508–515, ISBN: 978-1-5090-6017-7

  • Mishra S, Mondal S, Saha S (2016) Fast implementation of steady-state NSGA-II. In: 2016 IEEE congress on evolutionary computation (CEC’2016), IEEE Press, Vancouver, Canada, pp 3777–3784, ISBN:978-1-5090-0623-6

  • Mishra S, Saha S, Mondal S (2016) Divide and conquer based non-dominated sorting for parallel environment. In: 2016 IEEE congress on evolutionary computation (CEC’2016), IEEE Press, Vancouver, Canada, pp 4297–4304, ISBN: 978-1-5090-0623-6

  • Mishra S, Mondal S, Saha S (2017) Improved Solution to the Non-Domination Level Update Problem. Appl Soft Comput 60:336–362

    Article  Google Scholar 

  • Mishra S, Mondal S, Saha S, Coello CAC (2018) GBOS: generalized best order sort algorithm for non-dominated sorting. Swarm Evolut Comput. https://doi.org/10.1016/j.swevo.2018.06.003

    Article  Google Scholar 

  • Mishra S, Saha S, Mondal S (2018) MBOS: Modified best order sort algorithm for performing non-dominated sorting. In: 2018 IEEE congress on evolutionary computation (CEC’2018), IEEE Press, Rio de Janeiro, Brazil, pp 725–732, ISBN: 978-1-5090-6017-7

  • Moreno J, Ortega G, Filatovas E, Martínez J, Garzón E (2018) Improving the performance and energy of non-dominated sorting for evolutionary multiobjective optimization on GPU/CPU platforms. J Glob Optim 7:631

    Article  MathSciNet  MATH  Google Scholar 

  • Niculescu V (2007) Data-distributions in powerlist theory. In: International colloquium on theoretical aspects of computing, Springer, pp 396–409

  • Ortega G, Filatovas E, Garzon EM, Casado LG (2017) Non-dominated sorting procedure for pareto dominance ranking on multicore CPU and/or GPU. J Global Optim 69(3):607–627

    Article  MathSciNet  MATH  Google Scholar 

  • Roy PC, Islam MM, Deb K (2016) Best order sort: a new algorithm to non-dominated sorting for evolutionary multi-objective optimization. In: Proceedings of the 2016 on genetic and evolutionary computation conference companion, ACM Press, Denver, Colorado, USA, pp 1113–1120, ISBN: 978-1-4503-4323-7

  • Roy PC, Deb K, Islam MM (2018) An efficient nondominated sorting algorithm for large number of fronts. IEEE Trans Cybern 49(3):859–869

    Article  Google Scholar 

  • Shinde G, Jagtap SB, Pani SK (2011) Parallelizing multi-objective evolutionary genetic algorithms. In: Proceedings of the world congress on engineering, vol 2

  • Smutnicki C, Rudy J, Zelazny D (2014) Very fast non-dominated sorting. Decis Making Manuf Serv 8(1–2):13–23

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  • Tang S, Cai Z, Zheng J (2008) A fast method of constructing the non-dominated set: arena’s principle. In: 2008 fourth international conference on natural computation, IEEE Computer Society Press, Jinan, China, pp 391–395, ISBN: 978-0-7695-3304-9

  • Van Veldhuizen DA, Zydallis JB, Lamont GB (2003) Considerations in engineering parallel multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):144–173

    Article  Google Scholar 

  • Wang H, Yao X (2014) Corner sort for pareto-based many-objective optimization. IEEE Trans Cybern 44(1):92–102

    Article  Google Scholar 

  • Wong ML, Cui G (2013) Data Mining Using Parallel Multi-objective Evolutionary Algorithms on Graphics Processing Units. In: Massively Parallel Evolutionary Computation on GPGPUs, Springer, pp 287–307, ISBN: 978-3-642-37958-1

  • Yakupov I, Buzdalov M (2017) Improved incremental non-dominated sorting for steady-state evolutionary multiobjective optimization. In: 2017 genetic and evolutionary computation conference (GECCO’2017), ACM Press, Berlin, Germany, pp 649–656, ISBN: 978-1-4503-4920-8

  • Zhang X, Tian Y, Cheng R, Yaochu J (2015) An efficient approach to nondominated sorting for evolutionary multiobjective optimization. IEEE Trans Evol Comput 19(2):201–213

    Article  Google Scholar 

  • Zhang X, Tian Y, Cheng R, Jin Y (2018) A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization. IEEE Trans Evol Comput 22(1):97–112

    Article  Google Scholar 

Download references

Acknowledgements

The Carlos A. Coello Coello gratefully acknowledges financial support from CONACyT Grant Nos. \(2016-01-1920\) and 221551 (Investigación en Fronteras de la Ciencia 2016) and from a project from the 2018 SEP-Cinvestav Fund (Application No. 4).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sumit Mishra.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Human and animal rights

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by A. Di Nola.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mishra, S., Coello, C.A.C. A parallel naive approach for non-dominated sorting: a theoretical study considering PRAM CREW model. Soft Comput 25, 73–84 (2021). https://doi.org/10.1007/s00500-020-05450-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05450-1

Keywords

Navigation