{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:50:44Z","timestamp":1742982644625,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030317256"},{"type":"electronic","value":"9783030317263"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-31726-3_5","type":"book-chapter","created":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T00:05:31Z","timestamp":1572480331000},"page":"52-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Cooperative Particle Swarm Optimization Algorithm Based on Greedy Disturbance"],"prefix":"10.1007","author":[{"given":"Xing","family":"Huo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieqing","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,31]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.cviu.2007.09.001","volume":"109","author":"K Hammouche","year":"2008","unstructured":"Hammouche, K., Diaf, M., Siarry, P.: A multilevel automatic thresholding method based on a genetic algorithm for a fast image segmentation. Comput. Vis. Image Underst. 109(2), 163\u2013175 (2008)","journal-title":"Comput. Vis. Image Underst."},{"issue":"4","key":"5_CR2","first-page":"39","volume":"5","author":"PD Sathya","year":"2010","unstructured":"Sathya, P.D., Kayalvizhi, R.: PSO-based Tsallis thresholding selection procedure for image segmentation. Int. J. Comput. Appl. 5(4), 39\u201346 (2010)","journal-title":"Int. J. Comput. Appl."},{"key":"5_CR3","unstructured":"Sharma, A., Sharma, M., Rajneesh: SAR image segmentation using Grasshopper Optimization Algorithm. Int. J. Electron. 6(12), 19\u201325 (2017)"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66\u201373 (1992)","journal-title":"Sci. Am."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"5_CR6","unstructured":"Shi, Y.H., Eberhart, R.C.: A modified particle swarm optimizer. In: Proceedings of the IEEE Conference on Evolutionary Computation, Anchorage, pp. 69\u201373 (1998)"},{"issue":"1","key":"5_CR7","first-page":"14","volume":"44","author":"HL Li","year":"2008","unstructured":"Li, H.L., Hou, C.Z., Zhou, S.S.: High efficient algorithm of modified particle swarm optimization. Comput. Eng. Appl. 44(1), 14\u201316 (2008)","journal-title":"Comput. Eng. Appl."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.advengsoft.2017.01.004","volume":"105","author":"S Saremi","year":"2017","unstructured":"Saremi, S., Mirjalili, S., Lewis, A.: Grasshopper optimization algorithm: theory and application. Adv. Eng. Softw. 105, 30\u201347 (2017)","journal-title":"Adv. Eng. Softw."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51\u201367 (2016)","journal-title":"Adv. Eng. Softw."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/3-540-58484-6_269","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN III","author":"MA Potter","year":"1994","unstructured":"Potter, M.A., De Jong, K.A.: A cooperative coevolutionary approach to function optimization. In: Davidor, Y., Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1994. LNCS, vol. 866, pp. 249\u2013257. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58484-6_269"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00500-014-1522-3","volume":"20","author":"G Pan","year":"2016","unstructured":"Pan, G., Li, K., Ouyang, A., et al.: Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP. Soft. Comput. 20(2), 555\u2013566 (2016)","journal-title":"Soft. Comput."},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82\u2013102 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1080\/00207160108805080","volume":"77","author":"JG Digalakis","year":"2001","unstructured":"Digalakis, J.G., Margaritis, K.G.: On benchmarking functions for genetic algorithms. Int. J. Comput. Math 77(4), 481\u2013506 (2001)","journal-title":"Int. J. Comput. Math"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31726-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T00:14:05Z","timestamp":1730333645000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-31726-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030317256","9783030317263"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31726-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"31 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chinese Conference on Pattern Recognition and Computer Vision  (PRCV)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ccprcv2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.prcv2019.com\/en\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"412","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":"165","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":"40% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}