{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T16:48:31Z","timestamp":1770223711972,"version":"3.49.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030539559","type":"print"},{"value":"9783030539566","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-53956-6_41","type":"book-chapter","created":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T11:02:42Z","timestamp":1594551762000},"page":"455-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Success-History Based Parameter Adaptation in MOEA\/D Algorithm"],"prefix":"10.1007","author":[{"given":"Shakhnaz","family":"Akhmedova","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Stanovov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,13]]},"reference":[{"key":"41_CR1","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength Pareto evolutionary algorithm. Technical report TIK-Report103, Swiss Federal Institute of Technology, Zurich, Germany (2001)"},{"issue":"2","key":"41_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratab, A., Agrawal, 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":"6","key":"41_CR3","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."},{"issue":"2","key":"41_CR4","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9(2), 115\u2013148 (1995)","journal-title":"Complex Syst."},{"issue":"1","key":"41_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJAISC.2014.059280","volume":"4","author":"K Deb","year":"2014","unstructured":"Deb, K., Deb, D.: Analysing mutation schemes for real-parameter genetic algorithms. Int. J. Artif. Intell. Soft Comput. 4(1), 1\u201328 (2014)","journal-title":"Int. J. Artif. Intell. Soft Comput."},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2016.01.004","volume":"27","author":"S Das","year":"2016","unstructured":"Das, S., Mullick, S.S., Suganthan, P.N.: Recent advances in differential evolution \u2013 an updated survey. Swarm Evol. Comput. 27, 1\u201330 (2016)","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"41_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3(2), 124\u2013141 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"41_CR8","unstructured":"Zhang, J., Sanderson, A.C.: Self-adaptive multiobjective differential evolution with direction information provided by archived inferior solutions. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 2806\u20132815, July 2008"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Huang, V.L., Qin, A.K., Suganthan, P.N., Tasgetiren, M.F.: Multiobjective optimization based on self-adaptive differential evolution algorithm. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 3601\u20133608, May 2007","DOI":"10.1109\/CEC.2007.4424939"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Li, K., Kwong, S., Wang, R., Cao, J., Rudas, I.J.: Multiobjective differential evolution with self-navigation. In: Proceedings of the IEEE nternational Conference on Systems, Man, and Cybernetics, pp. 508\u2013513, October 2012","DOI":"10.1109\/ICSMC.2012.6377775"},{"issue":"1","key":"41_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/TEVC.2013.2239648","volume":"18","author":"K Li","year":"2014","unstructured":"Li, K., Fialho, A., 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":"6","key":"41_CR12","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1109\/TEVC.2006.872133","volume":"10","author":"J Brest","year":"2006","unstructured":"Brest, J., Greiner, S., Bo\u0161kovic\u0301, B., Mernik, M., \u017dumer, V.: Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans. Evol. Comput. 10(6), 646\u2013657 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Tanabe, R., Fukunaga, A.: Success-history based parameter adaptation for differential evolution. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 71\u201378 (2013)","DOI":"10.1109\/CEC.2013.6557555"},{"issue":"2","key":"41_CR14","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":"5","key":"41_CR15","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, 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":"4","key":"41_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/mci.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian, Y., Cheng, R., Zhang, X., Jin, Y.: PlatEMO: a MATLAB platform for evolutionary multi-objective optimization. IEEE Comput. Intell. Mag. 12(4), 73\u201387 (2017). https:\/\/doi.org\/10.1109\/mci.2017.2742868","journal-title":"IEEE Comput. Intell. Mag."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53956-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T08:40:01Z","timestamp":1609144801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53956-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030539559","9783030539566"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53956-6_41","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":"13 July 2020","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":"Belgrade","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","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":"14 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-si.org\/committees\/","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":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"127","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":"63","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":"50% - 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","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.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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}