{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:05:50Z","timestamp":1726063550697},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030378370"},{"type":"electronic","value":"9783030378387"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-37838-7_5","type":"book-chapter","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T20:02:45Z","timestamp":1577995365000},"page":"43-57","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-organizing Migrating Algorithm with Non-binary Perturbation"],"prefix":"10.1007","author":[{"given":"Michal","family":"Pluhacek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Senkerik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Viktorin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas","family":"Kadavy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"key":"5_CR1","series-title":"The Morgan Kaufmann Series in Artificial Intelligence","volume-title":"Swarm Intelligence","author":"R Eberhart","year":"2001","unstructured":"Eberhart, R., Kennedy, J.: Swarm Intelligence. The Morgan Kaufmann Series in Artificial Intelligence. Morgan Kaufmann, Burlington (2001)"},{"key":"5_CR2","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, IV, pp. 1942\u20131948 (1995)"},{"key":"5_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/11839088","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M.: Ant Colony Optimization and Swarm Intelligence. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11839088"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJBIC.2011.038700","volume":"3","author":"RS Parpinelli","year":"2011","unstructured":"Parpinelli, R.S., Lopes, H.S.: New inspirations in swarm intelligence: a survey. Int. J. Bio-Inspired Comput. 3(1), 1\u201316 (2011)","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"5_CR5","unstructured":"Zelinka, I., Jouni, L.: SOMA self-organizing migrating algorithm mendel. In: 6th International Conference on Soft Computing, Brno, Czech Republic (2000)"},{"key":"5_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39930-8_7","volume-title":"New Optimization Techniques in Engineering","author":"I Zelinka","year":"2004","unstructured":"Zelinka, I.: SOMA - self organizing migrating algorithm. In: Babu, B.V., Onwubolu, G. (eds.) New Optimization Techniques in Engineering, vol. 33. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-39930-8_7\n\n. ISBN 3-540-20167X"},{"key":"5_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28161-2","volume-title":"Self-organizing Migrating Algorithm","author":"D Davendra","year":"2016","unstructured":"Davendra, D., Zelinka, I.: Self-organizing Migrating Algorithm. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-28161-2"},{"issue":"10","key":"5_CR8","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/j.advengsoft.2005.03.012","volume":"36","author":"L Nolle","year":"2005","unstructured":"Nolle, L., et al.: Comparison of an self-organizing migration algorithm with simulated annealing and differential evolution for automated waveform tuning. Adv. Eng. Softw. 36(10), 645\u2013653 (2005)","journal-title":"Adv. Eng. Softw."},{"issue":"1\u20132","key":"5_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.mcm.2011.05.029","volume":"57","author":"D Davendra","year":"2013","unstructured":"Davendra, D., et al.: Discrete self-organising migrating algorithm for flow-shop scheduling with no-wait makespan. Math. Comput. Model. 57(1\u20132), 100\u2013110 (2013)","journal-title":"Math. Comput. Model."},{"issue":"4","key":"5_CR10","first-page":"804","volume":"20","author":"P Kadlec","year":"2011","unstructured":"Kadlec, P., Raida, Z.: A novel multi-objective self-organizing migrating algorithm. Radioengineering 20(4), 804\u2013816 (2011)","journal-title":"Radioengineering"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.amc.2007.08.032","volume":"198","author":"Kusum Deep","year":"2008","unstructured":"Deep, K., Dipti: A self-organizing migrating genetic algorithm for constrained optimization. Appl. Math. Comput. 198(1), 237\u2013250 (2008)","journal-title":"Applied Mathematics and Computation"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Deep, K., et al.: A new hybrid self organizing migrating genetic algorithm for function optimization. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 2796\u20132803. IEEE (2007)","DOI":"10.1109\/CEC.2007.4424825"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.procs.2019.02.073","volume":"150","author":"DQ Bao","year":"2019","unstructured":"Bao, D.Q., Zelinka, I.: Obstacle avoidance for swarm robot based on self-organizing migrating algorithm. Procedia Comput. Sci. 150, 425\u2013432 (2019)","journal-title":"Procedia Comput. Sci."},{"issue":"4","key":"5_CR14","first-page":"320","volume":"16","author":"SK Sharma","year":"2018","unstructured":"Sharma, S.K., Jain, Y.K.: Self organizing migration algorithm with curvelet based non local means method for the removal of different types of noise. Int. J. Comput. Sci. Inf. Secur. (IJCSIS) 16(4), 320\u2013330 (2018)","journal-title":"Int. J. Comput. Sci. Inf. Secur. (IJCSIS)"},{"key":"5_CR15","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-030-14907-9_21","volume-title":"AETA 2018 - Recent Advances in Electrical Engineering and Related Sciences: Theory and Application","author":"R Fusek","year":"2020","unstructured":"Fusek, R., Dobe\u0161, P.: Pupil localization using self-organizing migrating algorithm. In: Zelinka, I., Brandstetter, P., Trong Dao, T., Hoang Duy, V., Kim, S.B. (eds.) AETA 2018. LNEE, vol. 554, pp. 207\u2013216. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-14907-9_21"},{"key":"5_CR16","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-14907-9_33","volume-title":"AETA 2018 - Recent Advances in Electrical Engineering and Related Sciences: Theory and Application","author":"L Tomaszek","year":"2020","unstructured":"Tomaszek, L., Lycka, P., Zelinka, I.: On the self-organizing migrating algorithm comparison by means of centrality measures. In: Zelinka, I., Brandstetter, P., Trong Dao, T., Hoang Duy, V., Kim, S.B. (eds.) AETA 2018. LNEE, vol. 554, pp. 335\u2013343. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-14907-9_33"},{"key":"5_CR17","unstructured":"Riget, J., Vesterstr\u00f8m, J.S.: A diversity-guided particle swarm optimizer - the ARPSO. Technical report 2, Department of Computer Science, University of Aarhus, Aarhus, Denmark (2002)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-319-91253-0_45","volume-title":"Artificial Intelligence and Soft Computing","author":"M Pluhacek","year":"2018","unstructured":"Pluhacek, M., Senkerik, R., Viktorin, A., Kadavy, T.: Particle swarm optimization with single particle repulsivity for multi-modal optimization. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds.) ICAISC 2018. LNCS (LNAI), vol. 10841, pp. 486\u2013494. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-91253-0_45"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Dieterich, J.M., Hartke, B.: Empirical review of standard benchmark functions using evolutionary global optimization. arXiv preprint \narXiv:1207.4318\n\n (2012)","DOI":"10.4236\/am.2012.330215"}],"container-title":["Communications in Computer and Information Science","Swarm, Evolutionary, and Memetic Computing and Fuzzy and Neural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37838-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T20:10:27Z","timestamp":1577995827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37838-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030378370","9783030378387"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37838-7_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEMCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm, Evolutionary, and Memetic Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Maribor","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semcco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/semcco2019.org\/","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":"31","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":"15","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":"48% - 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":"1.6","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)"}}]}}