{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:49:43Z","timestamp":1742935783348,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959566"},{"type":"electronic","value":"9783319959573"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-95957-3_70","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T07:31:20Z","timestamp":1530775880000},"page":"682-688","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Interactive Swarm Intelligence Algorithm Based on Master-Slave Gaussian Surrogate Model"],"prefix":"10.1007","author":[{"given":"Jing","family":"Jie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengdao","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"issue":"5","key":"70_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/TEVC.2002.800884","volume":"6","author":"Y Jin","year":"2002","unstructured":"Jin, Y., Olhofer, M., Sendhoff, B.: A framework for evolutionary optimization with approximate fitness functions. IEEE Trans. Evol. Comput. 6(5), 481\u2013494 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"70_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TEVC.2013.2248012","volume":"18","author":"B Liu","year":"2014","unstructured":"Liu, B., Zhang, Q., Gielen, G.G.: A Gaussian process surrogate model assisted evolutionary algorithm for medium scale expensive optimization problems. IEEE Trans. Evol. Comput. 18(2), 180\u2013192 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"70_CR3","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1109\/TEVC.2012.2185052","volume":"16","author":"YJ Gong","year":"2012","unstructured":"Gong, Y.J., Zhang, J., Chung, H.S.H., Chen, W.N., Zhan, Z.H., Li, Y., Shi, Y.H.: An efficient resource allocation scheme using particle swarm optimization. IEEE Trans. Evol. Comput. 16(6), 801\u2013816 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"70_CR4","first-page":"206","volume":"42","author":"H Yuan","year":"2015","unstructured":"Yuan, H., Li, C.: Resource scheduling algorithm based on social force swarm optimization algorithm in cloud computing. Comput. Sci. 42(4), 206\u2013208 (2015)","journal-title":"Comput. Sci."},{"issue":"2","key":"70_CR5","first-page":"172","volume":"40","author":"X Sun","year":"2014","unstructured":"Sun, X., Chen, S., Gong, D., Zhang, Y.: Weighted multi-output Gaussian process-based surrogate of interactive genetic algorithm with individuals interval fitness. Acta Autom. Sin. 40(2), 172\u2013184 (2014)","journal-title":"Acta Autom. Sin."},{"issue":"6","key":"70_CR6","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/TEVC.2016.2555315","volume":"20","author":"H Wang","year":"2016","unstructured":"Wang, H., Jin, Y., Jansen, J.O.: Data-driven surrogate-assisted multiobjective evolutionary optimization of a trauma system. IEEE Trans. Evol. Comput. 20(6), 939\u2013952 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"70_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/TEVC.2009.2027359","volume":"14","author":"D Lim","year":"2010","unstructured":"Lim, D., Jin, Y., Ong, Y.S., Sendhoff, B.: Generalizing surrogate-assisted evolutionary computation. IEEE Trans. Evol. Comput. 14(3), 329\u2013355 (2010)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"70_CR8","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1007\/s00500-014-1283-z","volume":"19","author":"C Sun","year":"2015","unstructured":"Sun, C., Jin, Y., Zeng, J., Yu, Y.: A two-layer surrogate-assisted particle swarm optimization algorithm. Soft. Comput. 19(6), 1461\u20131475 (2015)","journal-title":"Soft. Comput."},{"key":"70_CR9","doi-asserted-by":"crossref","unstructured":"Kong, Q., He, X., Sun, C.: A surrogate-assisted hybrid optimization algorithms for computational expensive problems. In: 12th World Congress on Intelligent Control and Automation, pp. 2126\u20132130. IEEE, Guilin (2016)","DOI":"10.1109\/WCICA.2016.7578825"},{"key":"70_CR10","volume-title":"Surrogate Assisted Evolutionary Algorithm","author":"JF Lu","year":"2013","unstructured":"Lu, J.F.: Surrogate Assisted Evolutionary Algorithm. University of Science and Technology of China, Anhui (2013)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Methodologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95957-3_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:28:00Z","timestamp":1710325680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95957-3_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959566","9783319959573"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95957-3_70","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":"6 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","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":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","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":"275","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":"72","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":"44% - 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.46","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":"0","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)"}}]}}