{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:42:06Z","timestamp":1743000126418,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959320"},{"type":"electronic","value":"9783319959337"}],"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-95933-7_77","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:48:38Z","timestamp":1530773318000},"page":"681-692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two Possible Paradoxes in Numerical Comparisons of Optimization Algorithms"],"prefix":"10.1007","author":[{"given":"Qunfeng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingying","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"77_CR1","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/962437.962444","volume":"9","author":"M Gaviano","year":"2003","unstructured":"Gaviano, M., Kvasov, D., Lera, D., Sergeyev, Y.D.: Algorithm 829: software for generation of classes of test functions with known local and global minima for global optimization. ACM Trans. Math. Softw. 9, 469\u2013480 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"77_CR2","doi-asserted-by":"crossref","unstructured":"Hansen, N., Auger, A., Ros, R., Finck, S. and Po\u0161\u00edk P.: Comparing results of 31 algorithms from the black-box optimization benchmarking bbob-2009. In: Proceedings of the 12th annual conference companion on genetic and evolutionary computation, pp. 1689\u20131696 (2010)","DOI":"10.1145\/1830761.1830790"},{"key":"77_CR3","unstructured":"Awad, N.H., Ali, M.Z., Liang, J.J., Qu, B.Y., Suganthan, P.N.: Problem definitions and evaluation criteria for the CEC2017 special session and competition on single objective bound constrained real parameter numerical optimization. Nanyang Technological University, Singapore, Technical report, November 2016"},{"key":"77_CR4","unstructured":"Hansen, N., Auger, A., Mersmann, O., Tu\u0161ar, T., Brockhoff, D.: Coco: A platform for comparing continuous optimizers in a black-box setting. ArXiv e-prints arXiv:1603.08785 (2016)"},{"key":"77_CR5","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1109\/TEVC.2017.2690446","volume":"21","author":"M Gong","year":"2017","unstructured":"Gong, M., Wang, Z., Zhu, Z., Jiao, L.: A similarity-based multiobjective evolutionary algorithm for deployment optimization of near space communication system. IEEE Trans. Evol. Comput. 21, 878\u2013897 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR6","first-page":"171","volume":"12","author":"Y Valle","year":"2008","unstructured":"Valle, Y., Venayagamoorthy, G.K., Mohagheghi, S., Hernandez, J.-C., Harley, R.G.: Particle swarm optimization: Basic concepts, variants and applications in power systems. Inf. Sci. 12, 171\u2013195 (2008)","journal-title":"Inf. Sci."},{"key":"77_CR7","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TEVC.2017.2669098","volume":"21","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Xu, B., Sun, G., Yang, S.: A two-phase differential evolution for uniform designs in constrained experimental domains. IEEE Trans. Evol. Comput. 21, 665\u2013680 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mo\u0155e, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"77_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10898-014-0152-8","volume":"61","author":"Q Liu","year":"2015","unstructured":"Liu, Q., Zeng, J.: Global optimization by multilevel partition. J. Glob. Optim. 61, 47\u201369 (2015)","journal-title":"J. Glob. Optim."},{"key":"77_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10898-014-0263-2","volume":"62","author":"Q Liu","year":"2015","unstructured":"Liu, Q., Zeng, J., Yang, G.: MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems. J. Glob. Optim. 62, 205\u2013227 (2015)","journal-title":"J. Glob. Optim."},{"key":"77_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"J Mo\u0155e","year":"2009","unstructured":"Mo\u0155e, J., Wild, S.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20, 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"77_CR12","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TEVC.2017.2694221","volume":"21","author":"MN Omidvar","year":"2017","unstructured":"Omidvar, M.N., Yang, M., Mei, Y., Li, X., Yao, X.: Dg2: A faster and more accurate differential grouping for large-scale black-box optimization. IEEE Trans. Evol. Comput. 21, 929\u2013942 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR13","first-page":"493","volume":"21","author":"M Yang","year":"2017","unstructured":"Yang, M., Omidvar, M.N., Li, C., Li, X., Cai, Z., Kazimipour, B., Yao, X.: Efficient resource allocation in cooperative co-evolution for large-scale global optimization. IEEE Trans. Cybern. 21, 493\u2013505 (2017)","journal-title":"IEEE Trans. Cybern."},{"key":"77_CR14","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TEVC.2011.2169966","volume":"16","author":"X Li","year":"2012","unstructured":"Li, X., Yao, X.: Cooperatively coevolving particle swarms for large scale optimization. IEEE Trans. Evol. Comput. 16, 210\u2013224 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR15","doi-asserted-by":"publisher","first-page":"2238","DOI":"10.1109\/TCYB.2015.2474153","volume":"46","author":"Q Qin","year":"2015","unstructured":"Qin, Q., Cheng, S., Zhang, Q., Li, L., Shi, Y.: Particle swarm optimization with interswarm interactive learning strategy. IEEE Trans. Cybern. 46, 2238\u20132251 (2015)","journal-title":"IEEE Trans. Cybern."},{"key":"77_CR16","doi-asserted-by":"publisher","first-page":"2277","DOI":"10.1109\/TCYB.2015.2475174","volume":"46","author":"Y-J Gong","year":"2016","unstructured":"Gong, Y.-J., Li, J.-J., Zhou, Y., Li, Y., Chung, H.S.-H., Shi, Y.-H., Zhang, J.: Genetic learning particle swarm optimization. IEEE Trans. Cybern. 46, 2277\u20132290 (2016)","journal-title":"IEEE Trans. Cybern."},{"key":"77_CR17","doi-asserted-by":"publisher","first-page":"2896","DOI":"10.1109\/TCYB.2016.2616170","volume":"47","author":"Q Yang","year":"2017","unstructured":"Yang, Q., Chen, W.-N., Gu, T., Zhang, H., Deng, J.D., Li, Y., Zhang, J.: Segment-based predominant learning swarm optimizer for large-scale optimization. IEEE Trans. Cybern. 47, 2896\u20132910 (2017)","journal-title":"IEEE Trans. Cybern."},{"key":"77_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1162\/EVCO_a_00129","volume":"23","author":"Q Liu","year":"2015","unstructured":"Liu, Q.: Order-2 stability analysis of particle swarm optimization. Evol. Comput. 23, 187\u2013216 (2015)","journal-title":"Evol. Comput."},{"key":"77_CR19","doi-asserted-by":"publisher","first-page":"2924","DOI":"10.1109\/TCYB.2017.2659659","volume":"47","author":"Q Liu","year":"2017","unstructured":"Liu, Q., Chen, W.-N., Deng, J.D., Gu, T., Zhang, H., Yu, Z., Zhang, J.: Benchmarking stochastic algorithms for global optimization problems by visualizing confidence intervals. IEEE Trans. Cybern. 47, 2924\u20132937 (2017)","journal-title":"IEEE Trans. Cybern."},{"key":"77_CR20","unstructured":"Hansen N., Auger A., Brockhoff D., Tu\u0161ar D., and Tu\u0161ar T.: Coco: Performance assessment. ArXiv e-prints arXiv:1605.03560 (2016)"},{"key":"77_CR21","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s003550100129","volume":"19","author":"H Maassen","year":"2002","unstructured":"Maassen, H., Bezembinder, T.: Generating random weak orders and the probability of a Condorcet winner. Soc. Choice Welf. 19, 517\u2013532 (2002)","journal-title":"Soc. Choice Welf."},{"key":"77_CR22","doi-asserted-by":"crossref","unstructured":"Dwork C., Kumar R., Naor M., and Sivakumar D.: Rank aggregation methods for the web. In: Proceedings of the 10th International Conference on World Wide Web, pp. 613\u2013622. ACM (2001)","DOI":"10.1145\/371920.372165"},{"key":"77_CR23","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/TNSE.2016.2523761","volume":"3","author":"M Cucuringu","year":"2016","unstructured":"Cucuringu, M.: Sync-rank: Robust ranking, constrained ranking and rank aggregation via eigenvector and SDP synchronization. IEEE Trans. Netw. Sci. Eng. 3, 58\u201379 (2016)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"77_CR24","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.ins.2014.09.030","volume":"293","author":"YH Li","year":"2015","unstructured":"Li, Y.H., Zhan, Z.-H., Lin, S.J., Zhang, J., Luo, X.N.: Competitive and cooperative particle swarm optimization with information sharing mechanism for global optimization problems. Inf. Sci. 293, 370\u2013382 (2015)","journal-title":"Inf. Sci."},{"key":"77_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/TEVC.2011.2173577","volume":"17","author":"W-N Chen","year":"2013","unstructured":"Chen, W.-N., Zhang, J., Lin, Y., Chen, N., Zhan, Z.-H., Chung, H.S.-H., Li, Y., Shi, Y.-H.: Particle swarm optimization with an aging leader and challengers. IEEE Trans. Evol. Comput. 17, 241\u2013258 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR26","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ins.2016.04.050","volume":"363","author":"Q Liu","year":"2016","unstructured":"Liu, Q., Wei, W., Yuan, H., Zhan, Z.-H., Li, Y.: Topology selection for particle swarm optimization. Inf. Sci. 363, 154\u2013173 (2016)","journal-title":"Inf. Sci."},{"key":"77_CR27","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56, 1247\u20131293 (2013)","journal-title":"J. Glob. Optim."},{"key":"77_CR28","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10898-014-0180-4","volume":"59","author":"R Paulavi\u010dius","year":"2014","unstructured":"Paulavi\u010dius, R., Sergeyev, Y.D., Kvasov, D.E., \u017dlinskas, J.: Globally-biased DISIMPL algorithm for expensive global optimization. J. Glob. Optim. 59, 545\u2013567 (2014)","journal-title":"J. Glob. Optim."},{"key":"77_CR29","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s11127-013-0133-3","volume":"158","author":"AV Deemen","year":"2014","unstructured":"Deemen, A.V.: On the empirical relevance of condorcet\u2019s paradox. Pub. Choice 158, 311\u2013330 (2014)","journal-title":"Pub. Choice"},{"key":"77_CR30","volume-title":"Condorcet\u2019s Paradox","author":"WV Gehrlein","year":"2006","unstructured":"Gehrlein, W.V.: Condorcet\u2019s Paradox. Springer, Berlin (2006)"},{"key":"77_CR31","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"77_CR32","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00355-010-0522-1","volume":"38","author":"M Diss","year":"2012","unstructured":"Diss, M., Gehrlein, W.V.: Borda\u2019s Paradox and weighted scoring rules. Soc. Choice Welf. 38, 121\u2013136 (2012)","journal-title":"Soc. Choice Welf."},{"key":"77_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00355-009-0415-3","volume":"35","author":"WV Gehrlein","year":"2015","unstructured":"Gehrlein, W.V., Lepelley, D.: On the probability of observing Borda\u2019s paradox. Soc. Choice Welf. 35, 1\u201323 (2015)","journal-title":"Soc. Choice Welf."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95933-7_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:03:28Z","timestamp":1709827408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95933-7_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959320","9783319959337"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95933-7_77","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)"}}]}}