{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:26:55Z","timestamp":1749508015896,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030504199"},{"type":"electronic","value":"9783030504205"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-50420-5_13","type":"book-chapter","created":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T11:04:32Z","timestamp":1592564672000},"page":"172-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Asynchronous Actor-Based Approach to Multiobjective Hierarchical Strategy"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8446-4966","authenticated-orcid":false,"given":"Micha\u0142","family":"Idzik","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6317-7012","authenticated-orcid":false,"given":"Aleksander","family":"Byrski","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Turek","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8459-1877","authenticated-orcid":false,"given":"Marek","family":"Kisiel-Dorohinicki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"unstructured":"B\u00e4ck, T., Schwefel, H.P.: Evolutionary computation: an overview. In: Fukuda, T., Furuhashi, T. (eds.) Proceedings of the Third IEEE Conference on Evolutionary Computation. IEEE Press (1996)","key":"13_CR1"},{"key":"13_CR2","volume-title":"Efficient and Accurate Parallel Genetic Algorithms","author":"E Cant\u00fa-Paz","year":"2000","unstructured":"Cant\u00fa-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers, Norwell (2000)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/978-3-540-69389-5_82","volume-title":"Computational Science \u2013 ICCS 2008","author":"E Ciepiela","year":"2008","unstructured":"Ciepiela, E., Kocot, J., Siwik, L., Dre\u017cewski, R.: Hierarchical approach to evolutionary multi-objective optimization. In: Bubak, M., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2008. LNCS, vol. 5103, pp. 740\u2013749. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69389-5_82"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"K Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast Elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J.J., Schwefel, H.-P. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849\u2013858. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_83"},{"unstructured":"Fonseca, C.M., Paquete, L., L\u00f3pez-Ib\u00e1nez, M.: An improved dimension-sweep algorithm for the hypervolume indicator. In: IEEE Congress on Evolutionary Computation, 2006. CEC 2006, pp. 1157\u20131163. IEEE (2006)","key":"13_CR5"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1016\/j.procs.2015.05.239","volume":"51","author":"E Gajda-Zagorska","year":"2015","unstructured":"Gajda-Zagorska, E., Smolka, M., Schaefer, R., Pardo, D., \u00c1lvarez Aramberri, J.: Multi-objective hierarchic memetic solver for inverse parametric problems. Procedia Comput. Sci. 51, 974\u2013983 (2015)","journal-title":"Procedia Comput. Sci."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-37192-9_12","volume-title":"Applications of Evolutionary Computation","author":"E Gajda-Zag\u00f3rska","year":"2013","unstructured":"Gajda-Zag\u00f3rska, E.: Multiobjective evolutionary strategy for finding neighbourhoods of pareto-optimal solutions. In: Esparcia-Alc\u00e1zar, A.I. (ed.) EvoApplications 2013. LNCS, vol. 7835, pp. 112\u2013121. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37192-9_12"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.jocs.2015.07.003","volume":"11","author":"D Krzywicki","year":"2015","unstructured":"Krzywicki, D., Turek, W., Byrski, A., Kisiel-Dorohinicki, M.: Massively concurrent agent-based evolutionary computing. J. Comput. Science 11, 153\u2013162 (2015). https:\/\/doi.org\/10.1016\/j.jocs.2015.07.003","journal-title":"J. Comput. Science"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.jocs.2016.03.004","volume":"17","author":"R Lazarz","year":"2016","unstructured":"Lazarz, R., Idzik, M., Gadek, K., Gajda-Zagorska, E.: Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization. J. Comput. Sci. 17, 249\u2013260 (2016)","journal-title":"J. Comput. Sci."},{"unstructured":"Martin, W.N., Lienig, J., Cohoon, J.P.: Island (migration) models: evolutionary algorithms based on punctuated equilibria. In: Handbook of Evolutionary Computation, vol. 6, no. 3 (1997)","key":"13_CR10"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.engappai.2004.04.014","volume":"17","author":"R Schaefer","year":"2004","unstructured":"Schaefer, R., Adamska, K., Telega, H.: Clustered genetic search in continuous landscape exploration. Eng. Appl. Artif. Intell. 17(4), 407\u2013416 (2004)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"13_CR12","first-page":"383","volume":"7","author":"R Schaefer","year":"2002","unstructured":"Schaefer, R., Kolodziej, J.: Genetic search reinforced by the population hierarchy. Found. Genet. Algorithms 7, 383\u2013401 (2002)","journal-title":"Found. Genet. Algorithms"},{"unstructured":"Schott, J.R.: Fault tolerant design using single and multicriteria genetic algorithm optimization. Tech. rep, DTIC Document (1995)","key":"13_CR13"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TEVC.2011.2161872","volume":"16","author":"O Sch\u00fctze","year":"2012","unstructured":"Sch\u00fctze, O., Esquivel, X., Lara, A., Coello, C.A.C.: Using the averaged hausdorff distance as a performance measure in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 16(4), 504\u2013522 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-540-31880-4_35","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M Sierra","year":"2005","unstructured":"Sierra, M., Coello Coello, C.: Improving PSO-based multi-objective optimization using crowding, mutation and $$\\epsilon $$-dominance. In: Coello Coello, C., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science, vol. 3410, pp. 505\u2013519. Springer, Berlin Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_35"},{"doi-asserted-by":"publisher","unstructured":"Starzec, M., Starzec, G., Byrski, A., Turek, W.: Distributed ant colony optimization based on actor model. Parallel Comput. 90 (2019). https:\/\/doi.org\/10.1016\/j.parco.2019.102573","key":"13_CR16","DOI":"10.1016\/j.parco.2019.102573"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s10766-017-0503-4","volume":"46","author":"J Stypka","year":"2018","unstructured":"Stypka, J., et al.: The missing link! A new skeleton for evolutionary multi-agent systems in erlang. Int. J. Parallel Prog. 46(1), 4\u201322 (2018). https:\/\/doi.org\/10.1007\/s10766-017-0503-4","journal-title":"Int. J. Parallel Prog."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.jocs.2016.03.003","volume":"17","author":"W Turek","year":"2016","unstructured":"Turek, W., et al.: Highly scalable erlang framework for agent-based metaheuristic computing. J. Comput. Science 17, 234\u2013248 (2016). https:\/\/doi.org\/10.1016\/j.jocs.2016.03.003","journal-title":"J. Comput. Science"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50420-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T23:18:56Z","timestamp":1718752736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50420-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030504199","9783030504205"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50420-5_13","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":"15 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","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":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2020\/","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":"230","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":"98","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":"3","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":"43% - 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":"2.5","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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"248 workshop papers were selected from 489 submissions to the thematic tracks. The conference was canceled due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}