{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:58:07Z","timestamp":1742965087520,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030788100"},{"type":"electronic","value":"9783030788117"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-78811-7_3","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:07:50Z","timestamp":1625612870000},"page":"23-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Multiobjective Memetic Algorithm for Multiobjective Unconstrained Binary Quadratic Programming Problem"],"prefix":"10.1007","author":[{"given":"Ying","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingjing","family":"Kong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaopeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaming","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., et al.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58\u201381 (2014). https:\/\/doi.org\/10.1007\/s10878-014-9734-0","journal-title":"J. Comb. Optim."},{"key":"3_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268\u2013308 (2003)","journal-title":"ACM Comput. Surv."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"104774","DOI":"10.1016\/j.cor.2019.104774","volume":"113","author":"EA Anacleto","year":"2020","unstructured":"Anacleto, E.A., Meneses, C.N., Ravelo, S.V.: Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem. Comput. Oper. Res. 113, 104774 (2020)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s10479-015-2076-1","volume":"238","author":"F Glover","year":"2016","unstructured":"Glover, F., Hao, J.K.: f-Flip strategies for unconstrained binary quadratic programming. Ann. Oper. Res. 238(1), 651\u2013657 (2016)","journal-title":"Ann. Oper. Res."},{"key":"3_CR6","unstructured":"Shi, J., Zhang, Q., Derbel, B., Liefooghe, A.: A parallel tabu search for the unconstrained binary quadratic programming problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 557\u2013564 (2017)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.neucom.2019.06.111","volume":"390","author":"S Gu","year":"2020","unstructured":"Gu, S., Hao, T., Yao, H.: A pointer network based deep learning algorithm for unconstrained binary quadratic programming problem. Neurocomputing 390, 1\u201311 (2020)","journal-title":"Neurocomputing"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"106366","DOI":"10.1016\/j.knosys.2020.106366","volume":"207","author":"M Chen","year":"2020","unstructured":"Chen, M., Chen, Y., Du, Y., Wei, L., Chen, Y.: Heuristic algorithms based on deep reinforcement learning for quadratic unconstrained binary optimization. Knowl. Based Syst. 207, 106366 (2020)","journal-title":"Knowl. Based Syst."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.asoc.2013.11.008","volume":"16","author":"A Liefooghe","year":"2014","unstructured":"Liefooghe, A., Verel, S., Hao, J.K.: A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming. Appl. Soft Comput. 16, 10\u201319 (2014)","journal-title":"Appl. Soft Comput."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Wang, J., Yin, J.: A directional-biased tabu search algorithm for multi-objective unconstrained binary quadratic programming problem. In: 2013 Sixth International Conference on Advanced Computational Intelligence, pp. 281\u2013286. IEEE (2013)","DOI":"10.1109\/ICACI.2013.6748517"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-319-15934-8_12","volume-title":"Evolutionary Multi-Criterion Optimization","author":"A Liefooghe","year":"2015","unstructured":"Liefooghe, A., Verel, S., Paquete, L., Hao, J.-K.: Experiments on local search for Bi-objective unconstrained binary quadratic programming. In: Gaspar-Cunha, A., Henggeler Antunes, C., Coello, C.C. (eds.) EMO 2015, Part I. LNCS, vol. 9018, pp. 171\u2013186. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15934-8_12"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.knosys.2017.11.009","volume":"141","author":"Y Zhou","year":"2018","unstructured":"Zhou, Y., Wang, J., Wu, Z., Wu, K.: A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem. Knowl. Based Syst. 141, 18\u201330 (2018)","journal-title":"Knowl. Based Syst."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.neucom.2016.09.122","volume":"246","author":"M Zangari","year":"2017","unstructured":"Zangari, M., Pozo, A., Santana, R., Mendiburu, A.: A decomposition-based binary ACO algorithm for the multiobjective UBQP. Neurocomputing 246, 58\u201368 (2017)","journal-title":"Neurocomputing"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"105485","DOI":"10.1016\/j.asoc.2019.105485","volume":"81","author":"Y Zhou","year":"2019","unstructured":"Zhou, Y., Kong, L., Wu, Z., Liu, S., Cai, Y., Liu, Y.: Ensemble of multi-objective metaheuristic algorithms for multi-objective unconstrained binary quadratic programming problem. Appl. Soft Comput. 81, 105485 (2019)","journal-title":"Appl. Soft Comput."},{"issue":"6","key":"3_CR15","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multi-objective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10479-007-0230-0","volume":"156","author":"L Paquete","year":"2007","unstructured":"Paquete, L., Schiavinotto, T., St\u00fctzle, T.: On local optima in multiobjective combinatorial problems. Ann. Oper. Res. 156(1), 83\u201397 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"12","key":"3_CR18","doi-asserted-by":"publisher","first-page":"3089","DOI":"10.1016\/j.cor.2012.03.010","volume":"39","author":"F Tricoire","year":"2012","unstructured":"Tricoire, F.: Multi-directional local search. Comput. Oper. Res. 39(12), 3089\u20133101 (2012)","journal-title":"Comput. Oper. Res."},{"key":"3_CR19","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength Pareto evolutionary algorithm. In: Giannakoglou, K., Tsahalis, D.T., Periaux, J., Papailiou, K.D., Fogarty, T. (eds.) Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems, pp. 95\u2013100. CIMNE, Barcelona (2002)"},{"issue":"5","key":"3_CR20","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/TEVC.2020.2964705","volume":"24","author":"K Shang","year":"2020","unstructured":"Shang, K., Ishibuchi, H.: A new hypervolume-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 24(5), 839\u2013852 (2020)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"3_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biome. Bull. 1(6), 80\u201383 (1945)","journal-title":"Biome. Bull."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78811-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:21:38Z","timestamp":1625613698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78811-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030788100","9783030788117"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78811-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"177","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":"104","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":"59% - 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":"2,5","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-5","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)"}}]}}