{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:33:41Z","timestamp":1768318421534,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030581145","type":"print"},{"value":"9783030581152","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_19","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"271-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Adaptive Operator Selection Based on Dynamic Thompson Sampling for MOEA\/D"],"prefix":"10.1007","author":[{"given":"Lei","family":"Sun","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7200-4244","authenticated-orcid":false,"given":"Ke","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"19_CR1","first-page":"397","volume":"3","author":"P Auer","year":"2002","unstructured":"Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. J. Mach. Learn. Res. 3, 397\u2013422 (2002)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"PAN Bosman","year":"2003","unstructured":"Bosman, P.A.N., Thierens, D.: The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans. Evol. Comput. 7(2), 174\u2013188 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF00124503","volume":"10","author":"DE Clark","year":"1996","unstructured":"Clark, D.E., Westhead, D.R.: Evolutionary algorithms in computer-aided molecular design. J. Comput. Aided Mol. Des. 10(4), 337\u2013358 (1996)","journal-title":"J. Comput. Aided Mol. Des."},{"key":"19_CR4","unstructured":"Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. Wiley-Interscience Series in Systems and Optimization. Wiley, Hoboken (2001)"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., 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."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, N., Granmo, O., Agrawala, A.K.: Thompson sampling for dynamic multi-armed bandits. In: Chen, X., Dillon, T.S., Ishibuchi, H., Pei, J., Wang, H., Wani, M.A. (eds.) ICMLA 2011: Proceedings of the 2011 10th International Conference on Machine Learning and Applications, pp. 484\u2013489. IEEE Computer Society (2011)","DOI":"10.1109\/ICMLA.2011.144"},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband, S., Hingston, P., Barone, L., While, R.L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477\u2013506 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2009","unstructured":"Li, H., Zhang, Q.: Multiobjective optimization problems with complicated pareto sets, MOEA\/D and NSGA-II. IEEE Trans. Evol. Comput. 13(2), 284\u2013302 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/TEVC.2013.2239648","volume":"18","author":"K Li","year":"2014","unstructured":"Li, K., Fialho, \u00c1., Kwong, S., Zhang, Q.: Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 18(1), 114\u2013130 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"8","key":"19_CR10","doi-asserted-by":"publisher","first-page":"2388","DOI":"10.1109\/TCYB.2017.2739185","volume":"48","author":"Q Lin","year":"2018","unstructured":"Lin, Q., et al.: A diversity-enhanced resource allocation strategy for decomposition-based multiobjective evolutionary algorithm. IEEE Trans. Cybern. 48(8), 2388\u20132401 (2018)","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.envsoft.2008.06.008","volume":"24","author":"F di Pierro","year":"2009","unstructured":"di Pierro, F., Khu, S., Savic, D.A., Berardi, L.: Efficient multi-objective optimal design of water distribution networks on a budget of simulations using hybrid algorithms. Environ. Model Softw. 24(2), 202\u2013213 (2009)","journal-title":"Environ. Model Softw."},{"issue":"3\/4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2307\/2332286","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson, W.R.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3\/4), 285\u2013294 (1933)","journal-title":"Biometrika"},{"issue":"6","key":"19_CR13","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 multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Liu, W., Li, H.: The performance of a new version of MOEA\/D on CEC09 unconstrained MOP test instances. In: CEC 2009: Proceedings of the 2009 IEEE Congress on Evolutionary Computation, pp. 203\u2013208. IEEE (2009)","DOI":"10.1109\/CEC.2009.4982949"},{"key":"19_CR15","unstructured":"Zhang, Q., Zhou, A., Zhao, S., Suganthan, P., Liu, W., Tiwari, S.: Multiobjective optimization test instances for the CEC 2009 special session and competition. Mech. Eng. (2008)"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/TEVC.2015.2424251","volume":"20","author":"A Zhou","year":"2016","unstructured":"Zhou, A., Zhang, Q.: Are all the subproblems equally important? Resource allocation in decomposition-based multiobjective evolutionary algorithms. IEEE Trans. Evol. Comput. 20(1), 52\u201364 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-540-30217-9_84","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"E Zitzler","year":"2004","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832\u2013842. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30217-9_84"},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:06:24Z","timestamp":1598997984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","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":"268","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":"99","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":"37% - 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":"2.2","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)"}}]}}