{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:55:49Z","timestamp":1743044149927,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_12","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"171-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Sharing Information Between Sub-populations in MOEA\/S"],"prefix":"10.1007","author":[{"given":"Lucas","family":"de Almeida Ribeiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Emmerich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anderson","family":"da Silva Soares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Telma Woerle","family":"de Lima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"12_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (2007)"},{"issue":"20","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1002\/jcc.23315","volume":"34","author":"CRS Brasil","year":"2013","unstructured":"Brasil, C.R.S., Delbem, A.C.B., da Silva, F.L.B.: Multiobjective evolutionary algorithm with many tables for purely ab initio protein structure prediction. J. Comput. Chem. 34(20), 1719\u20131734 (2013)","journal-title":"J. Comput. Chem."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.epsr.2015.12.003","volume":"134","author":"MHM Camillo","year":"2016","unstructured":"Camillo, M.H.M., et al.: Combining exhaustive search and multi-objective evolutionary algorithm for service restoration in large-scale distribution systems. Electric Power Syst. Res. 134, 1\u20138 (2016)","journal-title":"Electric Power Syst. Res."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Camillo, M.H.M., et al.: Validation of a methodology for service restoration on a real Brazilian distribution system. In: 2014 IEEE PES Transmission & Distribution Conference and Exposition-Latin America (PES T&D-LA), pp. 1\u20136. IEEE (2014)","DOI":"10.1109\/TDC-LA.2014.6955192"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"2367","DOI":"10.1016\/j.procs.2016.05.448","volume":"80","author":"MHM Camillo","year":"2016","unstructured":"Camillo, M.H.M., et al.: A multi-objective evolutionary algorithm with efficient data structure and heuristic initialization for fault service restoration. Procedia Comput. Sci. 80, 2367\u20132371 (2016)","journal-title":"Procedia Comput. Sci."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Corne, D.W., Knowles, J.D.: Techniques for highly multiobjective optimisation: some nondominated points are better than others. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007, pp. 773\u2013780. Association for Computing Machinery, New York (2007)","DOI":"10.1145\/1276958.1277115"},{"issue":"4","key":"12_CR7","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.: 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 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/1-84628-137-7_6","volume-title":"Evolutionary Multiobjective Optimization","author":"K Deb","year":"2005","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolutionary Multiobjective Optimization, pp. 105\u2013145. Springer, London (2005). https:\/\/doi.org\/10.1007\/1-84628-137-7_6"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TPWRS.2004.840442","volume":"20","author":"ACB Delbem","year":"2005","unstructured":"Delbem, A.C.B., de Carvalho, A.C.P.D.L.F., Bretas, N.G.: Main chain representation for evolutionary algorithms applied to distribution system reconfiguration. IEEE Trans. Power Syst. 20(1), 425\u2013436 (2005)","journal-title":"IEEE Trans. Power Syst."},{"key":"12_CR10","unstructured":"Fonseca, C.M., Fleming, P.J.: Genetic algorithms for multiobjective optimization: formulation: discussion and generalization. In: Proceedings of the 5th International Conference on Genetic Algorithms, San Francisco, CA, USA, pp. 416\u2013423. Morgan Kaufmann Publishers Inc. (1993)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/978-3-642-37140-0_57","volume-title":"Evolutionary Multi-Criterion Optimization","author":"MM Gois","year":"2013","unstructured":"Gois, M.M., Sanches, D.S., Martins, J., Junior, J.B.A.L., Delbem, A.C.B.: Multi-objective evolutionary algorithm with node-depth encoding and strength pareto for service restoration in large-scale distribution systems. In: Purshouse, R.C., Fleming, P.J., Fonseca, C.M., Greco, S., Shaw, J. (eds.) EMO 2013. LNCS, vol. 7811, pp. 771\u2013786. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37140-0_57"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-37140-0_35","volume-title":"Evolutionary Multi-Criterion Optimization","author":"H Ishibuchi","year":"2013","unstructured":"Ishibuchi, H., Akedo, N., Nojima, Y.: Relation between neighborhood size and MOEA\/D performance on many-objective problems. In: Purshouse, R.C., Fleming, P.J., Fonseca, C.M., Greco, S., Shaw, J. (eds.) EMO 2013. LNCS, vol. 7811, pp. 459\u2013474. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37140-0_35"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/3-540-36970-8_31","volume-title":"Evolutionary Multi-Criterion Optimization","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi, H., Shibata, Y.: An empirical study on the effect of mating restriction on the search ability of EMO algorithms. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Thiele, L., Deb, K. (eds.) EMO 2003. LNCS, vol. 2632, pp. 433\u2013447. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36970-8_31"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/3-540-45105-6_116","volume-title":"Genetic and Evolutionary Computation \u2014 GECCO 2003","author":"H Ishibuchi","year":"2003","unstructured":"Ishibuchi, H., Shibata, Y.: A similarity-based mating scheme for evolutionary multiobjective optimization. In: Cant\u00fa-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 1065\u20131076. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45105-6_116"},{"key":"12_CR15","unstructured":"Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Choosing extreme parents for diversity improvement in evolutionary multiobjective optimization algorithms. In: 2007 IEEE International Conference on Systems, Man and Cybernetics, ISIC, pp. 1946\u20131951. IEEE (2007)"},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1109\/TEVC.2013.2281534","volume":"18","author":"H Jain","year":"2014","unstructured":"Jain, H., Deb, K.: An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part ii: handling constraints and extending to an adaptive approach. IEEE Trans. Evol. Comput. 18(4), 602\u2013622 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-44719-9_6","volume-title":"Evolutionary Multi-Criterion Optimization","author":"T Murata","year":"2001","unstructured":"Murata, T., Ishibuchi, H., Gen, M.: Specification of genetic search directions in cellular multi-objective genetic algorithms. In: Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A., Corne, D. (eds.) EMO 2001. LNCS, vol. 1993, pp. 82\u201395. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44719-9_6"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Okabe, T., Jin, Y., Sendhoff, B.: A critical survey of performance indices for multi-objective optimisation. In: The 2003 Congress on Evolutionary Computation, CEC 2003, vol. 2, pp. 878\u2013885. IEEE (2003)","DOI":"10.1109\/CEC.2003.1299759"},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1162\/106365605774666886","volume":"13","author":"GR Raidl","year":"2005","unstructured":"Raidl, G.R., Gottlieb, J.R.: Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem. Evol. Comput. 13(4), 441\u2013475 (2005)","journal-title":"Evol. Comput."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Riquelme, N., Von L\u00fccken, C., Baran, B.: Performance metrics in multi-objective optimization. In: 2015 Latin American Computing Conference (CLEI), pp. 1\u201311. IEEE (2015)","DOI":"10.1109\/CLEI.2015.7360024"},{"key":"12_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72962-4","volume-title":"Design of Modern Heuristics: Principles and Application","author":"F Rothlauf","year":"2011","unstructured":"Rothlauf, F.: Design of Modern Heuristics: Principles and Application. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-540-72962-4"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Sanches, D.S., Mazucato, S.C., Castoldi, M.F., Delbem, A., London Jr., J.B.: Combining subpopulation tables, non-dominated solutions and strength pareto of MOEAs to treat service restoration problem in large-scale distribution systems. In: IECON 2013\u201339th Annual Conference of the IEEE Industrial Electronics Society, pp. 1986\u20131991, November 2013","DOI":"10.1109\/IECON.2013.6699436"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.ijepes.2014.05.008","volume":"62","author":"DS Sanches","year":"2014","unstructured":"Sanches, D.S., et al.: Multiobjective evolutionary algorithm with a discrete differential mutation operator developed for service restoration in distribution systems. Int. J. Electr. Power Energy Syst. 62, 700\u2013711 (2014)","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Sanches, D.S., Mansour, M., London Jr., J.B., Delbem, A., Santos, A.C.: Integrating relevant aspects of MOEAs to solve loss reduction problem in large-scale distribution systems. In: 2011 IEEE PES Trondheim PowerTech: The Power of Technology for a Sustainable Society, POWERTECH 2011, June 2011","DOI":"10.1109\/PTC.2011.6019287"},{"issue":"3","key":"12_CR25","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1109\/TPWRS.2010.2041475","volume":"25","author":"A Santos","year":"2010","unstructured":"Santos, A., Delbem, A., London, J.B., Bretas, N.: Node-depth encoding and multiobjective evolutionary algorithm applied to large-scale distribution system reconfiguration. IEEE Trans. Power Syst. 25(3), 1254\u20131265 (2010)","journal-title":"IEEE Trans. Power Syst."},{"key":"12_CR26","unstructured":"Sprave, J.: A unified model of non-panmictic population structures in evolutionary algorithms. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), vol. 2, pp. 1384\u20131391 (1999)"},{"issue":"4","key":"12_CR27","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian, Y., Cheng, R., Zhang, X., Jin, Y.: Platemo: a matlab platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput. Intell. Mag. 12(4), 73\u201387 (2017)","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"2","key":"12_CR28","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TCYB.2015.2403849","volume":"46","author":"Z Wang","year":"2016","unstructured":"Wang, Z., Zhang, Q., Zhou, A., Gong, M., Jiao, L.: Adaptive replacement strategies for MOEA\/D. IEEE Trans. Cybern. 46(2), 474\u2013486 (2016)","journal-title":"IEEE Trans. Cybern."},{"issue":"6","key":"12_CR29","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"12_CR30","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E Zitzler","year":"2000","unstructured":"Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173\u2013195 (2000)","journal-title":"Evol. Comput."},{"issue":"4","key":"12_CR31","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T00:45:09Z","timestamp":1723509909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"268","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"99","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}