{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:51Z","timestamp":1740122751282,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T00:00:00Z","timestamp":1549238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CONACyT","award":["2016-01-1920"],"award-info":[{"award-number":["2016-01-1920"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10732-019-09407-y","type":"journal-article","created":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T07:54:53Z","timestamp":1549266893000},"page":"455-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallelism in divide-and-conquer non-dominated sorting: a theoretical study considering the PRAM-CREW model"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9333-2001","authenticated-orcid":false,"given":"Sumit","family":"Mishra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos A.","family":"Coello Coello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,4]]},"reference":[{"key":"9407_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, E.D., Cao, L.: A novel non-dominated sorting algorithm for evolutionary multi-objective optimization. J. Comput. Sci. 23, 31\u201343 (2017)","journal-title":"J. Comput. Sci."},{"key":"9407_CR2","doi-asserted-by":"crossref","unstructured":"Buzdalov, M., Shalyto, A.: A provably asymptotically fast version of the generalized Jensen algorithm for non-dominated sorting. In: 13th International Conference on Parallel Problem Solving from Nature\u2014PPSN XIII, Springer. Lecture Notes in Computer Science, Ljubljana, Slovenia, vol. 8672, pp. 528\u2013537 (2014)","DOI":"10.1007\/978-3-319-10762-2_52"},{"key":"9407_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009). ISBN 978-0-262-03384-8"},{"issue":"2","key":"9407_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.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolut. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"5","key":"9407_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.: Computational cost reduction of nondominated sorting using the M-front. IEEE Trans. Evolut. Comput. 19(5), 659\u2013678 (2015)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"3","key":"9407_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, Y.C., Horstemeyer, M.F.: An efficient non-dominated sorting method for evolutionary algorithms. Evolut. Comput. 16(3), 355\u2013384 (2008)","journal-title":"Evolut. Comput."},{"key":"9407_CR7","unstructured":"Fortin, F.A., Greiner, S., Parizeau, M.: Generalizing the improved run-time complexity algorithm for non-dominated sorting. In: 2013 Genetic and Evolutionary Computation Conference (GECCO\u20192013), pp. 615\u2013622. ACM Press, New York (2013). ISBN: 978-1-4503-1963-8"},{"key":"9407_CR8","unstructured":"Gupta, S., Tan, G.: A scalable parallel implementation of evolutionary algorithms for multi-objective optimization on GPUs. In: 2015 IEEE Congress on Evolutionary Computation (CEC\u20192015), pp. 1567\u20131574. IEEE Press, Sendai (2005). ISBN: 978-1-4799-7492-4"},{"issue":"1","key":"9407_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.: A new algorithm using the non-dominated tree to improve non-dominated sorting. Evolut. Comput. 26(1), 89\u2013116 (2018)","journal-title":"Evolut. Comput."},{"key":"9407_CR10","volume-title":"An Introduction to Parallel Algorithms","author":"J J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms, vol. 17. Addison-Wesley, Reading (1992)"},{"issue":"5","key":"9407_CR11","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TEVC.2003.817234","volume":"7","author":"MT Jensen","year":"2003","unstructured":"Jensen, M.T.: Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans. Evolut. Comput. 7(5), 503\u2013515 (2003)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"9407_CR12","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.: Introduction to Parallel Computing: Design and Analysis of Algorithms, vol. 400. Benjamin Cummings, Redwood City (1994)"},{"issue":"4","key":"9407_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"HT Kung","year":"1975","unstructured":"Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. JACM 22(4), 469\u2013476 (1975)","journal-title":"JACM"},{"issue":"1","key":"9407_CR14","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.: Deductive sort and climbing sort: new methods for non-dominated sorting. Evolut. Comput. 20(1), 1\u201326 (2012)","journal-title":"Evolut. Comput."},{"key":"9407_CR15","doi-asserted-by":"crossref","unstructured":"Miklo\u0161ko, J., Kotov, V.E.: Algorithms, Software and Hardware of Parallel Computers (1984). ISBN: 978-3-662-11106-2","DOI":"10.1007\/978-3-662-11106-2"},{"key":"9407_CR16","unstructured":"Mishra, S., Coello Coello, C.A.: P-ENS: parallelism in efficient non-dominated sorting. In: 2018 IEEE Congress on Evolutionary Computation (CEC\u20192018), pp 508\u2013515. IEEE Press, Rio de Janeiro (2018). ISBN: 978-1-5090-6017-7"},{"key":"9407_CR17","unstructured":"Mishra, S., Saha, S., Mondal, S.: Divide and conquer based non-dominated sorting for parallel environment. In: 2016 IEEE Congress on Evolutionary Computation (CEC\u20192016), pp 4297\u20134304. IEEE Press, Vancouver (2016). ISBN: 978-1-5090-0623-6"},{"key":"9407_CR18","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.swevo.2018.06.003","volume":"43","author":"S Mishra","year":"2018","unstructured":"Mishra, S., Mondal, S., Saha, S., Coello Coello, C.A.: GBOS: generalized best order sort algorithm for non-dominated sorting. Swarm Evolut. Comput. 43, 244\u2013264 (2018a). \n                    https:\/\/doi.org\/10.1016\/j.swevo.2018.06.003","journal-title":"Swarm Evolut. Comput."},{"key":"9407_CR19","doi-asserted-by":"crossref","unstructured":"Mishra, S., Saha, S., Mondal, S.: MBOS: modified best order sort algorithm for performing non-dominated sorting. In: 2018 IEEE Congress on Evolutionary Computation (CEC\u20192018), pp 725\u2013732. IEEE Press, Rio de Janeiro (2018b). ISBN: 978-1-5090-6017-7","DOI":"10.1109\/CEC.2018.8477804"},{"key":"9407_CR20","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.swevo.2018.08.011","volume":"44","author":"S Mishra","year":"2019","unstructured":"Mishra, S., Saha, S., Mondal, S., Coello Coello, C.A.: A divide-and-conquer based efficient non-dominated sorting approach. Swarm Evolut. Comput. 44, 748\u2013773 (2019). \n                    https:\/\/doi.org\/10.1016\/j.swevo.2018.08.011","journal-title":"Swarm Evolut. Comput."},{"issue":"3","key":"9407_CR21","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10898-018-0669-3","volume":"71","author":"J Moreno","year":"2018","unstructured":"Moreno, J., Ortega, G., Filatovas, E., Mart\u00ednez, J., Garz\u00f3n, E.: Improving the performance and energy of non-dominated sorting for evolutionary multiobjective optimization on GPU\/CPU platforms. J. Global Optim. 71(3), 631\u2013649 (2018)","journal-title":"J. Global Optim."},{"key":"9407_CR22","doi-asserted-by":"crossref","unstructured":"Niculescu, V.: Data-distributions in powerlist theory. In: International Colloquium on Theoretical Aspects of Computing, pp. 396\u2013409. Springer, New York (2007)","DOI":"10.1007\/978-3-540-75292-9_27"},{"issue":"10","key":"9407_CR23","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1080\/0305215X.2016.1271661","volume":"49","author":"W Ning","year":"2017","unstructured":"Ning, W., Guo, B., Yan, Y., Wu, X., Wu, J., Zhao, D.: Constrained multi-objective optimization using constrained non-dominated sorting combined with an improved hybrid multi-objective evolutionary algorithm. Eng. Optim. 49(10), 1645\u20131664 (2017)","journal-title":"Eng. Optim."},{"issue":"3","key":"9407_CR24","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, E.M., Casado, L.G.: Non-dominated sorting procedure for pareto dominance ranking on multicore CPU and\/or GPU. J. Global Optim. 69(3), 607\u2013627 (2017)","journal-title":"J. Global Optim."},{"key":"9407_CR25","doi-asserted-by":"crossref","unstructured":"Palakonda, V., Pamulapati, T., Mallipeddi, R., Biswas, P.P., Veluvolu, K.C.: Nondominated sorting based on sum of objectives. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1\u20138 (2017)","DOI":"10.1109\/SSCI.2017.8280950"},{"key":"9407_CR26","unstructured":"Roy, P.C., Islam, M.M., Deb, K.: 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, pp. 1113\u20131120. ACM Press, Denver, Colorado (2016). ISBN: 978-1-4503-4323-7"},{"key":"9407_CR27","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2789158","author":"PC Roy","year":"2018","unstructured":"Roy, P.C., Deb, K., Islam, M.M.: An efficient nondominated sorting algorithm for large number of fronts. IEEE Trans. Cybern. (2018). \n                    https:\/\/doi.org\/10.1109\/TCYB.2017.2789158","journal-title":"IEEE Trans. Cybern."},{"issue":"1\u20132","key":"9407_CR28","first-page":"13","volume":"8","author":"C Smutnicki","year":"2014","unstructured":"Smutnicki, C., Rudy, J., Zelazny, D.: Very fast non-dominated sorting. Decis. Mak. Manuf. Serv. 8(1\u20132), 13\u201323 (2014)","journal-title":"Decis. Mak. Manuf. Serv."},{"issue":"3","key":"9407_CR29","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.: Multiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221\u2013248 (1994)","journal-title":"Evol. Comput."},{"key":"9407_CR30","unstructured":"Tang, S., Cai, Z., Zheng, J.: 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 (2008). ISBN: 978-0-7695-3304-9"},{"issue":"2","key":"9407_CR31","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TEVC.2003.810751","volume":"7","author":"DA Veldhuizen Van","year":"2003","unstructured":"Van Veldhuizen, D.A., Zydallis, J.B., Lamont, G.B.: Considerations in engineering parallel multiobjective evolutionary algorithms. IEEE Trans. Evolut. Comput. 7(2), 144\u2013173 (2003)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"2","key":"9407_CR32","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.: An efficient approach to nondominated sorting for evolutionary multiobjective optimization. IEEE Trans. Evolut. Comput. 19(2), 201\u2013213 (2015)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"1","key":"9407_CR33","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.: A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization. IEEE Trans. Evolut. Comput. 22(1), 97\u2013112 (2018)","journal-title":"IEEE Trans. Evolut. Comput."},{"issue":"1","key":"9407_CR34","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/TEVC.2016.2567648","volume":"21","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Chen, Z., Zhang, J.: Ranking vectors by means of the dominance degree matrix. IEEE Trans. Evolut. Comput. 21(1), 34\u201351 (2017)","journal-title":"IEEE Trans. Evolut. Comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-019-09407-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09407-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09407-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T19:34:09Z","timestamp":1580758449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-019-09407-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,4]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["9407"],"URL":"https:\/\/doi.org\/10.1007\/s10732-019-09407-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2019,2,4]]},"assertion":[{"value":"16 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}