{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T11:44:42Z","timestamp":1775648682543,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T00:00:00Z","timestamp":1606348800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T00:00:00Z","timestamp":1606348800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CONACyT","award":["221551"],"award-info":[{"award-number":["221551"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00500-020-05450-1","type":"journal-article","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T17:02:52Z","timestamp":1606410172000},"page":"73-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A parallel naive approach for non-dominated sorting: a theoretical study considering PRAM CREW model"],"prefix":"10.1007","volume":"25","author":[{"given":"Sumit","family":"Mishra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos A. Coello","family":"Coello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,26]]},"reference":[{"key":"5450_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jocs.2017.09.015","volume":"23","author":"C Bao","year":"2017","unstructured":"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\u201343","journal-title":"J Comput Sci"},{"key":"5450_CR2","doi-asserted-by":"crossref","unstructured":"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\u2014PPSN XIII, Springer. Lecture Notes in Computer Science vol 8672, Ljubljana, Slovenia, pp 528\u2013537","DOI":"10.1007\/978-3-319-10762-2_52"},{"issue":"4","key":"5450_CR3","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"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\u2013601","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"5450_CR4","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGAII. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"5450_CR5","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TEVC.2014.2366498","volume":"19","author":"M Drozdik","year":"2015","unstructured":"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\u2013678","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"5450_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1162\/evco.2008.16.3.355","volume":"16","author":"H Fang","year":"2008","unstructured":"Fang H, Wang Q, Tu YC, Horstemeyer MF (2008) An efficient non-dominated sorting method for evolutionary algorithms. Evol Comput 16(3):355\u2013384","journal-title":"Evol Comput"},{"key":"5450_CR7","doi-asserted-by":"crossref","unstructured":"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\u20192013), ACM Press, New York, USA, pp 615\u2013622, ISBN: 978-1-4503-1963-8","DOI":"10.1145\/2463372.2463454"},{"key":"5450_CR8","doi-asserted-by":"crossref","unstructured":"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\u20192015), IEEE Press, Sendai, Japan, pp 1567\u20131574, ISBN: 978-1-4799-7492-4","DOI":"10.1109\/CEC.2015.7257074"},{"issue":"1","key":"5450_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1162\/evco_a_00204","volume":"26","author":"P Gustavsson","year":"2018","unstructured":"Gustavsson P, Syberfeldt A (2018) A new algorithm using the non-dominated tree to improve non-dominated sorting. Evol Comput 26(1):89\u2013116","journal-title":"Evol Comput"},{"key":"5450_CR10","volume-title":"An introduction to parallel algorithms","author":"J J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1 J (1992) An introduction to parallel algorithms, vol 17. Addison-Wesley, Boston"},{"issue":"5","key":"5450_CR11","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TEVC.2003.817234","volume":"7","author":"MT Jensen","year":"2003","unstructured":"Jensen MT (2003) Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans Evol Comput 7(5):503\u2013515","journal-title":"IEEE Trans Evol Comput"},{"issue":"11","key":"5450_CR12","doi-asserted-by":"publisher","first-page":"2669","DOI":"10.1021\/ie0343162","volume":"43","author":"K Kim","year":"2004","unstructured":"Kim K, Smith RL (2004) Parallel multiobjective evolutionary algorithms for waste solvent recycling. Ind Eng Chem Res 43(11):2669\u20132679","journal-title":"Ind Eng Chem Res"},{"key":"5450_CR13","volume-title":"Introduction to parallel computing: design and analysis of algorithms","author":"V Kumar","year":"1994","unstructured":"Kumar V, Grama A, Gupta A, Karypis G (1994) Introduction to parallel computing: design and analysis of algorithms, vol 400. Benjamin\/Cummings, Redwood City"},{"issue":"9","key":"5450_CR14","doi-asserted-by":"publisher","first-page":"2838","DOI":"10.1109\/TCYB.2016.2621008","volume":"47","author":"K Li","year":"2017","unstructured":"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\u20132849","journal-title":"IEEE Trans Cybern"},{"key":"5450_CR15","doi-asserted-by":"crossref","unstructured":"Luna F, Alba E (2015) Parallel multiobjective evolutionary algorithms. In: Springer handbook of computational intelligence, Springer, pp 1017\u20131031","DOI":"10.1007\/978-3-662-43505-2_50"},{"issue":"1","key":"5450_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3233\/FI-2010-237","volume":"99","author":"U Maulik","year":"2010","unstructured":"Maulik U, Sarkar A (2010) Evolutionary rough parallel multi-objective optimization algorithm. Fundamenta Informaticae 99(1):13\u201327","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"5450_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/EVCO_a_00041","volume":"20","author":"K McClymont","year":"2012","unstructured":"McClymont K, Keedwell E (2012) Deductive sort and climbing sort: new methods for non-dominated sorting. Evol Comput 20(1):1\u201326","journal-title":"Evol Comput"},{"key":"5450_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11106-2","volume-title":"Algorithms, software and hardware of parallel computers","author":"J Miklo\u0161ko","year":"1984","unstructured":"Miklo\u0161ko J, Kotov VE (1984) Algorithms, software and hardware of parallel computers. Springer, Berlin"},{"key":"5450_CR19","doi-asserted-by":"crossref","unstructured":"Mishra S, Coello CA (2018) P-ENS: Parallelism in efficient non-dominated sorting. In: 2018 IEEE congress on evolutionary computation (CEC\u20192018), IEEE Press, Rio de Janeiro, Brazil, pp 508\u2013515, ISBN: 978-1-5090-6017-7","DOI":"10.1109\/CEC.2018.8477948"},{"key":"5450_CR20","doi-asserted-by":"crossref","unstructured":"Mishra S, Mondal S, Saha S (2016) Fast implementation of steady-state NSGA-II. In: 2016 IEEE congress on evolutionary computation (CEC\u20192016), IEEE Press, Vancouver, Canada, pp 3777\u20133784, ISBN:978-1-5090-0623-6","DOI":"10.1109\/CEC.2016.7744268"},{"key":"5450_CR21","doi-asserted-by":"crossref","unstructured":"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\u20192016), IEEE Press, Vancouver, Canada, pp 4297\u20134304, ISBN: 978-1-5090-0623-6","DOI":"10.1109\/CEC.2016.7744336"},{"key":"5450_CR22","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.asoc.2017.06.038","volume":"60","author":"S Mishra","year":"2017","unstructured":"Mishra S, Mondal S, Saha S (2017) Improved Solution to the Non-Domination Level Update Problem. Appl Soft Comput 60:336\u2013362","journal-title":"Appl Soft Comput"},{"key":"5450_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.06.003","author":"S Mishra","year":"2018","unstructured":"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","journal-title":"Swarm Evolut Comput"},{"key":"5450_CR24","doi-asserted-by":"crossref","unstructured":"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\u20192018), IEEE Press, Rio de Janeiro, Brazil, pp 725\u2013732, ISBN: 978-1-5090-6017-7","DOI":"10.1109\/CEC.2018.8477804"},{"key":"5450_CR25","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10898-018-0669-3","volume":"7","author":"J Moreno","year":"2018","unstructured":"Moreno J, Ortega G, Filatovas E, Mart\u00ednez J, Garz\u00f3n E (2018) Improving the performance and energy of non-dominated sorting for evolutionary multiobjective optimization on GPU\/CPU platforms. J Glob Optim 7:631","journal-title":"J Glob Optim"},{"key":"5450_CR26","doi-asserted-by":"crossref","unstructured":"Niculescu V (2007) Data-distributions in powerlist theory. In: International colloquium on theoretical aspects of computing, Springer, pp 396\u2013409","DOI":"10.1007\/978-3-540-75292-9_27"},{"issue":"3","key":"5450_CR27","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10898-016-0468-7","volume":"69","author":"G Ortega","year":"2017","unstructured":"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\u2013627","journal-title":"J Global Optim"},{"key":"5450_CR28","doi-asserted-by":"crossref","unstructured":"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\u20131120, ISBN: 978-1-4503-4323-7","DOI":"10.1145\/2908961.2931684"},{"issue":"3","key":"5450_CR29","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/TCYB.2017.2789158","volume":"49","author":"PC Roy","year":"2018","unstructured":"Roy PC, Deb K, Islam MM (2018) An efficient nondominated sorting algorithm for large number of fronts. IEEE Trans Cybern 49(3):859\u2013869","journal-title":"IEEE Trans Cybern"},{"key":"5450_CR30","unstructured":"Shinde G, Jagtap SB, Pani SK (2011) Parallelizing multi-objective evolutionary genetic algorithms. In: Proceedings of the world congress on engineering, vol\u00a02"},{"issue":"1\u20132","key":"5450_CR31","first-page":"13","volume":"8","author":"C Smutnicki","year":"2014","unstructured":"Smutnicki C, Rudy J, Zelazny D (2014) Very fast non-dominated sorting. Decis Making Manuf Serv 8(1\u20132):13\u201323","journal-title":"Decis Making Manuf Serv"},{"issue":"3","key":"5450_CR32","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221\u2013248","journal-title":"Evol Comput"},{"key":"5450_CR33","doi-asserted-by":"crossref","unstructured":"Tang S, Cai Z, Zheng J (2008) A fast method of constructing the non-dominated set: arena\u2019s principle. In: 2008 fourth international conference on natural computation, IEEE Computer Society Press, Jinan, China, pp 391\u2013395, ISBN: 978-0-7695-3304-9","DOI":"10.1109\/ICNC.2008.823"},{"issue":"2","key":"5450_CR34","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TEVC.2003.810751","volume":"7","author":"DA Van Veldhuizen","year":"2003","unstructured":"Van Veldhuizen DA, Zydallis JB, Lamont GB (2003) Considerations in engineering parallel multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):144\u2013173","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"5450_CR35","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TCYB.2013.2247594","volume":"44","author":"H Wang","year":"2014","unstructured":"Wang H, Yao X (2014) Corner sort for pareto-based many-objective optimization. IEEE Trans Cybern 44(1):92\u2013102","journal-title":"IEEE Trans Cybern"},{"key":"5450_CR36","unstructured":"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\u2013307, ISBN: 978-3-642-37958-1"},{"key":"5450_CR37","doi-asserted-by":"crossref","unstructured":"Yakupov I, Buzdalov M (2017) Improved incremental non-dominated sorting for steady-state evolutionary multiobjective optimization. In: 2017 genetic and evolutionary computation conference (GECCO\u20192017), ACM Press, Berlin, Germany, pp 649\u2013656, ISBN: 978-1-4503-4920-8","DOI":"10.1145\/3071178.3071307"},{"issue":"2","key":"5450_CR38","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2014.2308305","volume":"19","author":"X Zhang","year":"2015","unstructured":"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\u2013213","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"5450_CR39","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TEVC.2016.2600642","volume":"22","author":"X Zhang","year":"2018","unstructured":"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\u2013112","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05450-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-020-05450-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05450-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T08:28:16Z","timestamp":1610612896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-020-05450-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,26]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["5450"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05450-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,26]]},"assertion":[{"value":"26 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}