{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:04:13Z","timestamp":1725980653392},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319936970"},{"type":"electronic","value":"9783319936987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93698-7_10","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:30:25Z","timestamp":1528745425000},"page":"129-140","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-population Genetic Algorithm for Cardinality Constrained Portfolio Selection Problems"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-0276-4704","authenticated-orcid":false,"given":"Nasser R.","family":"Sabar","sequence":"first","affiliation":[]},{"given":"Ayad","family":"Turky","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Leenders","sequence":"additional","affiliation":[]},{"given":"Andy","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"issue":"1","key":"10_CR1","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection*. J. Finan. 7(1), 77\u201391 (1952)","journal-title":"J. Finan."},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1257\/jep.7.1.159","volume":"7","author":"Hal Varian","year":"1993","unstructured":"Varian, H.: A portfolio of nobel laureates: Markowitz, Miller and Sharpe. J. Econ. Perspect. 159\u2013169 (1993)","journal-title":"Journal of Economic Perspectives"},{"issue":"13","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1016\/S0305-0548(99)00074-X","volume":"27","author":"T-J Chang","year":"2000","unstructured":"Chang, T.-J., Meade, N., Beasley, J.E., Sharaiha, Y.M.: Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27(13), 1271\u20131302 (2000)","journal-title":"Comput. Oper. Res."},{"key":"10_CR4","unstructured":"Markowitz, H.M.: Portfolio selection: efficient diversification of investments, vol. 16. Yale University Press, New Haven (1968)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-1-4419-1665-5_2","volume-title":"Handbook of Metaheuristics","author":"Michel Gendreau","year":"2010","unstructured":"Gendreau, M., Potvin, J.-Y.: Handbook of Metaheuristics, vol. 2. Springer, Heidelberg (2010)"},{"issue":"4","key":"10_CR6","doi-asserted-by":"publisher","first-page":"4558","DOI":"10.1016\/j.eswa.2011.09.129","volume":"39","author":"G-F Deng","year":"2012","unstructured":"Deng, G.-F., Lin, W.-T., Lo, C.-C.: Markowitz-based portfolio selection with cardinality constraints using improved particle swarm optimization. Expert Syst. Appl. 39(4), 4558\u20134566 (2012)","journal-title":"Expert Syst. Appl."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Sabar, N.R., Kendall, G.: Using harmony search with multiple pitch adjustment operators for the portfolio selection problem. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 499\u2013503. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900384"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1109\/TEVC.2006.887348","volume":"11","author":"G Kendall","year":"2007","unstructured":"Kendall, G., Yan, S.: Imperfect evolutionary systems. IEEE Trans. Evol. Comput. 11(3), 294\u2013307 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1016\/j.cor.2005.06.017","volume":"34","author":"A Fern\u00e1ndez","year":"2007","unstructured":"Fern\u00e1ndez, A., G\u00f3mez, S.: Portfolio selection using neural networks. Comput. Oper. Res. 34(4), 1177\u20131191 (2007)","journal-title":"Comput. Oper. Res."},{"key":"10_CR10","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. U Michigan Press, Oxford (1975)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri, F., Cotta, C.: Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol. Comput. 2, 1\u201314 (2012)","journal-title":"Swarm Evol. Comput."},{"key":"10_CR12","unstructured":"Moral-Escudero, R., Ruiz-Torrubiano, R., Su\u00e1rez, A.: Selection of optimal investment portfolios with cardinality constraints. In: IEEE Congress on Evolutionary Computation, CEC 2006, pp. 2382\u20132388. IEEE (2006)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-319-51691-2_22","volume-title":"Artificial Life and Computational Intelligence","author":"NR Sabar","year":"2017","unstructured":"Sabar, N.R., Aleti, A.: An adaptive memetic algorithm for the architecture optimisation problem. In: Wagner, M., Li, X., Hendtlass, T. (eds.) ACALCI 2017. LNCS (LNAI), vol. 10142, pp. 254\u2013265. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51691-2_22"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-31204-0_18","volume-title":"Applications of Evolutionary Computation","author":"NR Sabar","year":"2016","unstructured":"Sabar, N.R., Song, A., Zhang, M.: A variable local search based memetic algorithm for the load balancing problem in cloud computing. In: Squillero, G., Burelli, P. (eds.) EvoApplications 2016. LNCS, vol. 9597, pp. 267\u2013282. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31204-0_18"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/TEVC.2016.2602860","volume":"21","author":"NR Sabar","year":"2017","unstructured":"Sabar, N.R., Abawajy, J., Yearwood, J.: Heterogeneous cooperative co-evolution memetic differential evolution algorithm for big data optimization problems. IEEE Trans. Evol. Comput. 21(2), 315\u2013327 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.engappai.2017.04.021","volume":"63","author":"Nasser R. Sabar","year":"2017","unstructured":"Sabar, N.R., Chung, E., Tsubota, T., Maciel de Almeida, P.E., et al.: A memetic algorithm for real world multi-intersection traffic signal optimisation problems. Eng. Appl. Artif. Intell. 63, 45\u201353 (2017)","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10489-013-0444-6","volume":"40","author":"Anmar Abuhamdah","year":"2013","unstructured":"Abuhamdah, A., Ayob, M., Kendall, G., Sabar, N.R.: Population based local search for university course timetabling problems. Appl. Intell. 40(1), 44\u201353 (2014)","journal-title":"Applied Intelligence"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-319-13563-2_59","volume-title":"Simulated Evolution and Learning","author":"NR Sabar","year":"2014","unstructured":"Sabar, N.R., Song, A.: Dual population genetic algorithm for the cardinality constrained portfolio selection problem. In: Dick, G., et al. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 703\u2013712. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13563-2_59"},{"issue":"11","key":"10_CR19","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J E Beasley","year":"1990","unstructured":"Beasley, J.E.: Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 1069\u20131072 (1990)","journal-title":"Journal of the Operational Research Society"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93698-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:03:33Z","timestamp":1654905813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93698-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319936970","9783319936987"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93698-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","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":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","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":"406","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":"148","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":"60","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":"36% - 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":"3","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":"Acceptance rate in the Main Track is 28%. Acceptance rate in the workshops is 43%. A high acceptance rate in the workshops is explained by the nature of these thematic sessions, where many experts in a particular field are personally invited by workshop organisers to participate in their sessions.","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"}]}}