{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:46:22Z","timestamp":1743104782989,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819635375"},{"type":"electronic","value":"9789819635382"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-3538-2_4","type":"book-chapter","created":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T13:08:54Z","timestamp":1740748134000},"page":"46-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of\u00a0Merge Non-dominated Sorting Algorithm"],"prefix":"10.1007","author":[{"given":"Sumit","family":"Mishra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ved","family":"Prakash","sequence":"additional","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":[[2025,2,28]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N Beume","year":"2007","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653\u20131669 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Buzdalov, M.: Make evolutionary multiobjective algorithms scale better with advanced data structures: van emde boas tree for non-dominated sorting. In: International Conference on Evolutionary Multi-Criterion Optimization (EMO\u20192019), pp. 66\u201377. Springer. Lecture Notes in Computer Science, vol. 11411, East Lansing, MI, USA (2019). ISBN: 978-3-030-12597-4","DOI":"10.1007\/978-3-030-12598-1_6"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Buzdalov, M., Shalyto, A.: A provably asymptotically fast version of the generalized Jensen algorithm for non-dominated sorting. In: International Conference on Parallel Problem Solving from Nature \u2013 PPSN XIII. Lecture Notes in Computer Science, vol. 8672, Ljubljana, Slovenia, pp. 528\u2013537. Springer (2014)","DOI":"10.1007\/978-3-319-10762-2_52"},{"issue":"2","key":"4_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. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"van Emde\u00a0Boas, P.: Preserving order in a forest in less than logarithmic time. In: Annual Symposium on Foundations of Computer Science (SFCS\u20191975), pp. 75\u201384. IEEE (1975)","DOI":"10.1109\/SFCS.1975.26"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P van Emde Boas","year":"1976","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Math. Syst. Theory 10(1), 99\u2013127 (1976)","journal-title":"Math. Syst. Theory"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Fang, H., Wang, Q., Tu, Y.C., Horstemeyer, M.F.: An efficient non-dominated sorting method for evolutionary algorithms. Evol. Comput. 16(3), 355\u2013384 (2008)","DOI":"10.1162\/evco.2008.16.3.355"},{"key":"4_CR8","unstructured":"Fortin, F.A., Greiner, S., Parizeau, M.: Generalizing the improved run-time complexity algorithm for non-dominated sorting. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u20192013), New York, USA, pp. 615\u2013622. ACM Press (2013). ISBN: 978-1-4503-1963-8"},{"issue":"1","key":"4_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. Evol. Comput. 26(1), 89\u2013116 (2018)","journal-title":"Evol. Comput."},{"issue":"5","key":"4_CR10","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. Evol. Comput. 7(5), 503\u2013515 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"4_CR11","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. J. ACM 22(4), 469\u2013476 (1975)","journal-title":"J. ACM"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"McClymont, K., Keedwell, E.: Deductive sort and climbing sort: new methods for non-dominated sorting. Evol. Comput. 20(1), 1\u201326 (2012)","DOI":"10.1162\/EVCO_a_00041"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Mishra, S., Buzdalov, M.: Filter sort is $$\\Omega (N^3)$$ in the worst case. In: International Conference on Parallel Problem Solving from Nature \u2013 PPSN XVI, pp. 675\u2013685. Springer (2020)","DOI":"10.1007\/978-3-030-58115-2_47"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Mishra, S., Buzdalov, M.: If unsure, shuffle: deductive sort is $$\\Theta (MN^3)$$, but $$\\cal{O}(MN^2)$$ in expectation over input permutations. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u20192020), pp. 516\u2013523 (2020)","DOI":"10.1145\/3377930.3390246"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Mishra, S., Buzdalov, M., Senwar, R.: Time complexity analysis of the dominance degree approach for non-dominated sorting. In: Proceedings of Genetic and Evolutionary Computation Conference Companion (GECCO\u20192020), pp. 169\u2013170 (2020)","DOI":"10.1145\/3377929.3389900"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Mishra, S., Saha, S., Mondal, S.: Divide and conquer based non-dominated sorting for parallel environment. In: IEEE Congress on Evolutionary Computation (CEC\u20192016), Vancouver, Canada, pp. 4297\u20134304. IEEE Press (2016), ISBN: 978-1-5090-0623-6","DOI":"10.1109\/CEC.2016.7744336"},{"key":"4_CR17","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 Evol. Comput. 44, 748\u2013773 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Mishra, S., Saha, S., Mondal, S., Coello Coello, C.A.: Divide-and-conquer based non-dominated sorting with reduced comparisons. Swarm Evol. Comput. 51 (2019). article Number: UNSP 100580","DOI":"10.1016\/j.swevo.2019.100580"},{"issue":"12","key":"4_CR19","doi-asserted-by":"publisher","first-page":"6154","DOI":"10.1109\/TCYB.2020.2968301","volume":"51","author":"J Moreno","year":"2020","unstructured":"Moreno, J., Rodriguez, D., Nebro, A.J., Lozano, J.A.: Merge nondominated sorting algorithm for many-objective optimization. IEEE Trans. Cybern. 51(12), 6154\u20136164 (2020)","journal-title":"IEEE Trans. Cybern."},{"key":"4_CR20","doi-asserted-by":"crossref","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 Genetic and Evolutionary Computation Conference (GECCO\u20192016), Denver, Colorado, USA, pp. 1113\u20131120. ACM Press (2016). ISBN: 978-1-4503-4323-7","DOI":"10.1145\/2908961.2931684"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221\u2013248 (1994)","DOI":"10.1162\/evco.1994.2.3.221"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, C., Diao, Y., Zeng, S., Wang, H.: An efficient nondominated sorting algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u20192018), pp. 203\u2013204. ACM (2018)","DOI":"10.1145\/3205651.3205663"},{"issue":"2","key":"4_CR23","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. Evol. Comput. 19(2), 201\u2013213 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"4_CR24","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. Evol. Comput. 21(1), 34\u201351 (2017)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-3538-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T13:09:04Z","timestamp":1740748144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-3538-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819635375","9789819635382"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-3538-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canberra, ACT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.emo2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}